Šeštadieninė informatikos olimpiadininkų mokykla

Labirintas

• [1] 2026-01-17 13:14 (85.2)
• [2] 2026-01-17 13:20 (85.2)
• [3] 2026-01-17 13:23 (100)

Taškai: 85.2

Compile: OK

labirintas.cpp: In function ‘void PathfindBFS()’: labirintas.cpp:32:68: warning: narrowing conversion of ‘((((int)p.std::pair<short int, short int>::first) + ((int)OFFSETS[((int)o)].std::pair<short int, short int>::first)) + ((((int)p.std::pair<short int, short int>::second) + ((int)OFFSETS[((int)o)].std::pair<short int, short int>::second)) * ((int)sizeX)))’ from ‘int’ to ‘short int’ [-Wnarrowing] 32 | short offset {(p.first + OFFSETS[o].first) + (p.second + OFFSETS[o].second) * sizeX}; | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ labirintas.cpp: In function ‘int main()’: labirintas.cpp:67:30: warning: narrowing conversion of ‘(((int)end.std::pair<short int, short int>::first) + (((int)end.std::pair<short int, short int>::second) * ((int)sizeX)))’ from ‘int’ to ‘short int’ [-Wnarrowing] 67 | short pos {end.first + end.second * sizeX}; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

nr.	result	time	message
1	True	0.001 s	Teisingai
2	True	0.001 s	Teisingai
3	True	0.001 s	Teisingai
4	True	0.001 s	Teisingai
5	True	0.002 s	Teisingai
6	True	0.001 s	Teisingai
7	True	0.001 s	Teisingai
8	True	0.001 s	Teisingai
9	False	0.001 s	Neteisingai
10	True	0.001 s	Teisingai
11	True	0.001 s	Teisingai
12	True	0.001 s	Teisingai
13	True	0.001 s	Teisingai
14	True	0.001 s	Teisingai
15	True	0.001 s	Teisingai
16	True	0.001 s	Teisingai
17	True	0.002 s	Teisingai
18	False	0.001 s	Neteisingai
19	False	0.001 s	Neteisingai
20	True	0.002 s	Teisingai
21	True	0.001 s	Teisingai
22	True	0.001 s	Teisingai
23	True	0.001 s	Teisingai
24	False	0.001 s	Neteisingai
25	True	0.001 s	Teisingai
26	True	0.001 s	Teisingai
27	True	0.001 s	Teisingai