Borderou de evaluare (job #1132452)
Raport evaluator
Compilare:
user.cpp: In function ‘std::vector<std::complex<_Tp> > intersect_poly_halfplane(const std::vector<std::complex<_Tp> >&, const std::complex<_Tp>&, const std::complex<_Tp>&)’:
user.cpp:442:6: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses]
if (N == 1) if (! clockwise(A,B,V[0]) ) return V; else return res;
^
user.cpp: In function ‘double distance_point_polygon(const point&, const std::vector<std::complex<double> >&)’:
user.cpp:153:46: warning: unused variable ‘_NN’ [-Wunused-variable]
#define re(II, NN) for (int II(0), _NN(NN); (II) < (NN); ++(II))
^
user.cpp:610:3: note: in expansion of macro ‘re’
re (i, size(ch) - 1)
^
user.cpp: In function ‘int same_side(const point&, const point&, const polygon&)’:
user.cpp:153:46: warning: unused variable ‘_NN’ [-Wunused-variable]
#define re(II, NN) for (int II(0), _NN(NN); (II) < (NN); ++(II))
^
user.cpp:678:3: note: in expansion of macro ‘re’
re (i, size(ch)) {
^
user.cpp: In function ‘int closest_point_to_polygon(const polygon&, const polygon&)’:
user.cpp:153:46: warning: unused variable ‘_NN’ [-Wunused-variable]
#define re(II, NN) for (int II(0), _NN(NN); (II) < (NN); ++(II))
^
user.cpp:695:3: note: in expansion of macro ‘re’
re (i, size(from)) {
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 388kb | Killed by signal 6(SIGABRT). | 0 |
| 2 | 0ms | 372kb | OK! | 10 |
| 3 | 80ms | 2672kb | Killed by signal 6(SIGABRT). | 0 |
| 4 | 112ms | 3388kb | OK! | 10 |
| 5 | Depăşit | 6316kb | Time limit exceeded. | 0 |
| 6 | Depăşit | 7132kb | Time limit exceeded. | 0 |
| 7 | Depăşit | 7612kb | Time limit exceeded. | 0 |
| 8 | Depăşit | 7604kb | Time limit exceeded. | 0 |
| 9 | Depăşit | 8104kb | Time limit exceeded. | 0 |
| 10 | 0ms | 376kb | OK! | 10 |
| Punctaj total | 30 |