Pagini recente » Borderou de evaluare (job #2909412) | Borderou de evaluare (job #1518526) | Borderou de evaluare (job #1288742) | Borderou de evaluare (job #1380974) | Borderou de evaluare (job #905471)
Borderou de evaluare (job #905471)
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘bool BF()’:
user.cpp:54:17: error: reference to ‘prev’ is ambiguous
prev[*it] = x;
^
user.cpp:14:36: note: candidates are: int prev [200]
int val[MAXM], Mx[MAXM], My[MAXM], prev[MAXN], D[MAXN], L[MAXN][MAXN], F[MAXN][MAXN], C[MAXN][MAXN];
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp: In function ‘int main()’:
user.cpp:96:32: error: reference to ‘prev’ is ambiguous
for(i = n; i != 1; i = prev[i])
^
user.cpp:14:36: note: candidates are: int prev [200]
int val[MAXM], Mx[MAXM], My[MAXM], prev[MAXN], D[MAXN], L[MAXN][MAXN], F[MAXN][MAXN], C[MAXN][MAXN];
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:97:32: error: reference to ‘prev’ is ambiguous
flow = min(flow, C[prev[i]][i] - F[prev[i]][i]);
^
user.cpp:14:36: note: candidates are: int prev [200]
int val[MAXM], Mx[MAXM], My[MAXM], prev[MAXN], D[MAXN], L[MAXN][MAXN], F[MAXN][MAXN], C[MAXN][MAXN];
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:97:48: error: reference to ‘prev’ is ambiguous
flow = min(flow, C[prev[i]][i] - F[prev[i]][i]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 12ms | 940kb | Incorect | 0 |
| 2 | 4ms | 520kb | OK | 5 |
| 3 | 4ms | 792kb | Incorect | 0 |
| 4 | 4ms | 736kb | OK | 5 |
| 5 | 4ms | 540kb | Incorect | 0 |
| 6 | 4ms | 460kb | OK | 5 |
| 7 | 4ms | 612kb | Incorect | 0 |
| 8 | 12ms | 872kb | Incorect | 0 |
| 9 | 8ms | 848kb | Incorect | 0 |
| 10 | 4ms | 712kb | Incorect | 0 |
| 11 | 4ms | 656kb | OK | 5 |
| 12 | 8ms | 780kb | Incorect | 0 |
| 13 | 4ms | 456kb | OK | 5 |
| 14 | 12ms | 944kb | Incorect | 0 |
| 15 | 8ms | 904kb | Incorect | 0 |
| 16 | 4ms | 640kb | OK | 5 |
| 17 | 4ms | 808kb | OK | 5 |
| 18 | 8ms | 820kb | Incorect | 0 |
| 19 | 4ms | 796kb | Incorect | 0 |
| 20 | 4ms | 716kb | OK | 5 |
| Punctaj total | 0 |
Daria Dicu dicu_daria