# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
290580 |
2020-09-04T05:22:10 Z |
gabrc52 |
Seats (IOI18_seats) |
C++14 |
|
4000 ms |
24312 KB |
#include <iostream>
#include "seats.h"
//#define DEBUG
#ifdef DEBUG
#define watch(x) cerr<<#x<<": "<<(x)<<endl
#define watcharr(x,N) cerr<<#x<<": ";for (int i=0; i<N; i++)cerr<<(x)[i]<<' ';cerr<<endl
#else
#define watch(x)
#define watcharr(x,N)
#endif
using namespace std;
using vi = vector<int>;
int H, W;
vi R, C;
void give_initial_chart(int _H, int _W, vi _R, vi _C) {
H = _H;
W = _W;
R = _R;
C = _C;
}
int swap_seats(int a, int b) {
watch(a);
watch(b);
watcharr(R,H*W);
watcharr(C,H*W);
swap(R[a], R[b]);
swap(C[a], C[b]);
watcharr(R,H*W);
watcharr(C,H*W);
int minRow, minCol, maxRow, maxCol;
minRow = minCol = H*W;
maxRow = maxCol = -1;
int beautifulRects = 0;
for (int i=0; i<H*W; i++) {
minRow = min(minRow, R[i]);
minCol = min(minCol, C[i]);
maxRow = max(maxRow, R[i]);
maxCol = max(maxCol, C[i]);
watch(minRow);
watch(maxRow);
watch(minCol);
watch(maxCol);
int expectedSize = i+1;
int size = (maxRow - minRow + 1) * (maxCol - minCol + 1);
watch(i);
watch(size);
watch(expectedSize);
if (size == expectedSize) {
beautifulRects++;
}
}
return beautifulRects;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
13 |
Correct |
166 ms |
632 KB |
Output is correct |
14 |
Correct |
163 ms |
640 KB |
Output is correct |
15 |
Correct |
163 ms |
632 KB |
Output is correct |
16 |
Correct |
164 ms |
632 KB |
Output is correct |
17 |
Correct |
163 ms |
632 KB |
Output is correct |
18 |
Correct |
158 ms |
632 KB |
Output is correct |
19 |
Correct |
162 ms |
632 KB |
Output is correct |
20 |
Correct |
163 ms |
632 KB |
Output is correct |
21 |
Correct |
162 ms |
632 KB |
Output is correct |
22 |
Correct |
167 ms |
636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4080 ms |
23928 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
167 ms |
640 KB |
Output is correct |
2 |
Correct |
1430 ms |
2432 KB |
Output is correct |
3 |
Execution timed out |
4094 ms |
23800 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
1396 KB |
Output is correct |
2 |
Correct |
24 ms |
1404 KB |
Output is correct |
3 |
Correct |
38 ms |
1396 KB |
Output is correct |
4 |
Correct |
177 ms |
1396 KB |
Output is correct |
5 |
Correct |
1569 ms |
1572 KB |
Output is correct |
6 |
Execution timed out |
4094 ms |
24312 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
4 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
384 KB |
Output is correct |
13 |
Correct |
166 ms |
632 KB |
Output is correct |
14 |
Correct |
163 ms |
640 KB |
Output is correct |
15 |
Correct |
163 ms |
632 KB |
Output is correct |
16 |
Correct |
164 ms |
632 KB |
Output is correct |
17 |
Correct |
163 ms |
632 KB |
Output is correct |
18 |
Correct |
158 ms |
632 KB |
Output is correct |
19 |
Correct |
162 ms |
632 KB |
Output is correct |
20 |
Correct |
163 ms |
632 KB |
Output is correct |
21 |
Correct |
162 ms |
632 KB |
Output is correct |
22 |
Correct |
167 ms |
636 KB |
Output is correct |
23 |
Execution timed out |
4080 ms |
23928 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |