Žaidimas su ratais
- [1] 2020-05-13 21:26 (0)
- [2] 2020-05-13 21:28 (100)
Taškai: 100
Compile: OK
ratai.cpp: In function ‘int paieskaiploti()’: ratai.cpp:31:105: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::p) + 1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[n(eile.front().p+1)][eile.front().a][eile.front().t][eile.front().k].negalimi)eile.push({n(eile.front().p+1),eile.front().a,eile.front().t,eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:32:105: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::p) + -1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[n(eile.front().p-1)][eile.front().a][eile.front().t][eile.front().k].negalimi)eile.push({n(eile.front().p-1),eile.front().a,eile.front().t,eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:34:120: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::a) + 1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][n(eile.front().a+1)][eile.front().t][eile.front().k].negalimi)eile.push({eile.front().p,n(eile.front().a+1),eile.front().t,eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:35:120: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::a) + -1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][n(eile.front().a-1)][eile.front().t][eile.front().k].negalimi)eile.push({eile.front().p,n(eile.front().a-1),eile.front().t,eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:37:135: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::t) + 1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][eile.front().a][n(eile.front().t+1)][eile.front().k].negalimi)eile.push({eile.front().p,eile.front().a,n(eile.front().t+1),eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:38:135: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::t) + -1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][eile.front().a][n(eile.front().t-1)][eile.front().k].negalimi)eile.push({eile.front().p,eile.front().a,n(eile.front().t-1),eile.front().k,eile.front().kiekis+1}); ^ ratai.cpp:40:150: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::k) + 1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][eile.front().a][eile.front().t][n(eile.front().k+1)].negalimi)eile.push({eile.front().p,eile.front().a,eile.front().t,n(eile.front().k+1),eile.front().kiekis+1}); ^ ratai.cpp:41:150: warning: narrowing conversion of ‘n((((int)eile.std::queue<_Tp, _Sequence>::front<keturi, std::deque<keturi, std::allocator<keturi> > >().keturi::k) + -1))’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] if(!ratai[eile.front().p][eile.front().a][eile.front().t][n(eile.front().k-1)].negalimi)eile.push({eile.front().p,eile.front().a,eile.front().t,n(eile.front().k-1),eile.front().kiekis+1}); ^
| nr. | result | time | message |
|---|---|---|---|
| 1 | True | 0.0 s | ok |
| 2 | True | 0.0 s | ok |
| 3 | True | 0.004 s | ok |
| 4 | True | 0.004 s | ok |
| 5 | True | 0.008 s | ok |
| 6 | True | 0.008 s | ok |
| 7 | True | 0.004 s | ok |
| 8 | True | 0.008 s | ok |
| 9 | True | 0.008 s | ok |
| 10 | True | 0.008 s | ok |