// incorrect/mruxim-wa-overflow.cpp
#include "pyramids.h"
#include <numeric>
using namespace std;
vector<int> pa, pb;
void init(std::vector<int> A, std::vector<int> B) {
pa.assign(size(A) + 1, 0);
pb.assign(size(B) + 1, 0);
partial_sum(A.begin(), A.end(), pa.begin() + 1);
partial_sum(B.begin(), B.end(), pb.begin() + 1);
}
bool can_transform(int L, int R, int X, int Y) {
return pa[R+1] - pa[L] == pb[Y+1] - pb[X];
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
34 ms |
4316 KB |
Output is correct |
| 2 |
Correct |
36 ms |
4180 KB |
Output is correct |
| 3 |
Correct |
35 ms |
4300 KB |
Output is correct |
| 4 |
Correct |
36 ms |
4180 KB |
Output is correct |
| 5 |
Correct |
35 ms |
4180 KB |
Output is correct |
| 6 |
Correct |
35 ms |
4292 KB |
Output is correct |
| 7 |
Correct |
46 ms |
4312 KB |
Output is correct |
| 8 |
Correct |
35 ms |
4180 KB |
Output is correct |
| 9 |
Correct |
39 ms |
4176 KB |
Output is correct |
| 10 |
Correct |
39 ms |
4184 KB |
Output is correct |
| 11 |
Correct |
39 ms |
4180 KB |
Output is correct |
| 12 |
Correct |
42 ms |
4180 KB |
Output is correct |
| 13 |
Correct |
37 ms |
4176 KB |
Output is correct |
| 14 |
Correct |
41 ms |
4180 KB |
Output is correct |
| 15 |
Correct |
39 ms |
4180 KB |
Output is correct |
| 16 |
Correct |
39 ms |
4180 KB |
Output is correct |
| 17 |
Correct |
39 ms |
4188 KB |
Output is correct |
| 18 |
Correct |
49 ms |
4176 KB |
Output is correct |
| 19 |
Correct |
43 ms |
4176 KB |
Output is correct |
| 20 |
Correct |
37 ms |
4176 KB |
Output is correct |
| 21 |
Correct |
33 ms |
4184 KB |
Output is correct |
| 22 |
Correct |
36 ms |
4180 KB |
Output is correct |
| 23 |
Correct |
44 ms |
4176 KB |
Output is correct |
| 24 |
Correct |
37 ms |
4276 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
