Pagini recente » Borderou de evaluare (job #1319659) | Borderou de evaluare (job #1197804) | Borderou de evaluare (job #1086556) | Borderou de evaluare (job #2593047) | Borderou de evaluare (job #2778974)
Borderou de evaluare (job #2778974)
Raport evaluator
Compilare:
main.cpp: In function 'int sePoate(int)':
main.cpp:2:161: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~~~~~~~~~~^~~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:170: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~^~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:197: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~~^~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:255: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~~~~~~~~^~~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:264: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~^~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:290: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~^~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:344: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~^~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:372: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
2 | #define SOLVE using namespace std; unsigned int v[1000002];unsigned int n, i, k, p, u, mid, dist, centre;int sePoate(int d) {int s = 0;int i=2;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}centre = 1;for (;;) {s = 0;while (s + v[i]<= d && i<=n) {s += v[i];i++;}if (i<=n) {centre++;if (centre > k)return 0;s = 0;i++;if (i>n)return 1;while (s + v[i] <= d && i<=n) {s += v[i];i++;}if (i > n) {return 1;}} else {return 1;}}}int main() {ifstream fin("orase1.in");ofstream fout("orase1.out");fin>>n>>k;for (i=2;i<=n;i++) {fin>>v[i];dist += v[i];}sePoate(4);p = 1;u = dist;while (p<=u) {mid = p + (u-p)/2;if (sePoate(mid))u = mid - 1;else p = mid + 1;}fout<<p;sePoate(p);fout<<" "<<centre<<"";return 0;}
| ~~~~~~~~~^~~~
main.cpp:3:1: note: in expansion of macro 'SOLVE'
3 | SOLVE
| ^~~~~
main.cpp:2:381: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 200kb | OK | 10 | 10 |
2 | 1ms | 184kb | OK | 10 | 10 |
3 | 40ms | 2732kb | OK | 10 | 10 |
4 | 42ms | 2670kb | OK | 10 | 10 |
5 | 165ms | 2691kb | OK | 10 | 10 |
6 | 134ms | 2998kb | OK | 10 | 10 |
7 | 161ms | 3395kb | OK | 10 | 30 |
8 | 138ms | 3780kb | OK | 10 |
9 | 191ms | 4173kb | OK | 10 |
10 | 1ms | 184kb | OK | 10 | 10 |
Punctaj total | 100 |