# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
75745 |
2018-09-11T01:56:57 Z |
arock |
Seats (IOI18_seats) |
C++14 |
|
4000 ms |
40236 KB |
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
int ans = 1, H, W;
vector<int> R, C, lor, hir, loc, hic;
void give_initial_chart(int HH, int WW, vector<int> RR, vector<int> CC) {
H = HH, W = WW, R = RR, C = CC;
lor.resize(H * W), hir.resize(H * W);
loc.resize(H * W), hic.resize(H * W);
lor[0] = hir[0] = R[0];
loc[0] = hic[0] = C[0];
for (int i = 1; i < H * W; i++) {
lor[i] = min(lor[i - 1], R[i]);
hir[i] = max(hir[i - 1], R[i]);
loc[i] = min(loc[i - 1], C[i]);
hic[i] = max(hic[i - 1], C[i]);
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans++;
}
}
}
int swap_seats(int a, int b) {
if (b < a) {
swap(a, b);
}
swap(R[a], R[b]);
swap(C[a], C[b]);
for (int i = a; i <= min(H * W - 1, b + 1); i++) {
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans--;
}
if (i == 0) {
lor[i] = hir[i] = R[i];
loc[i] = hic[i] = C[i];
} else {
lor[i] = min(lor[i - 1], R[i]);
hir[i] = max(hir[i - 1], R[i]);
loc[i] = min(loc[i - 1], C[i]);
hic[i] = max(hic[i - 1], C[i]);
}
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans++;
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
500 KB |
Output is correct |
3 |
Correct |
5 ms |
720 KB |
Output is correct |
4 |
Correct |
6 ms |
740 KB |
Output is correct |
5 |
Correct |
5 ms |
740 KB |
Output is correct |
6 |
Correct |
5 ms |
740 KB |
Output is correct |
7 |
Correct |
5 ms |
740 KB |
Output is correct |
8 |
Correct |
5 ms |
768 KB |
Output is correct |
9 |
Correct |
5 ms |
768 KB |
Output is correct |
10 |
Correct |
6 ms |
768 KB |
Output is correct |
11 |
Correct |
7 ms |
768 KB |
Output is correct |
12 |
Correct |
9 ms |
768 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
500 KB |
Output is correct |
3 |
Correct |
5 ms |
720 KB |
Output is correct |
4 |
Correct |
6 ms |
740 KB |
Output is correct |
5 |
Correct |
5 ms |
740 KB |
Output is correct |
6 |
Correct |
5 ms |
740 KB |
Output is correct |
7 |
Correct |
5 ms |
740 KB |
Output is correct |
8 |
Correct |
5 ms |
768 KB |
Output is correct |
9 |
Correct |
5 ms |
768 KB |
Output is correct |
10 |
Correct |
6 ms |
768 KB |
Output is correct |
11 |
Correct |
7 ms |
768 KB |
Output is correct |
12 |
Correct |
9 ms |
768 KB |
Output is correct |
13 |
Correct |
132 ms |
1084 KB |
Output is correct |
14 |
Correct |
125 ms |
1084 KB |
Output is correct |
15 |
Correct |
123 ms |
1184 KB |
Output is correct |
16 |
Correct |
130 ms |
1184 KB |
Output is correct |
17 |
Correct |
132 ms |
1184 KB |
Output is correct |
18 |
Correct |
135 ms |
1184 KB |
Output is correct |
19 |
Correct |
136 ms |
1184 KB |
Output is correct |
20 |
Correct |
128 ms |
1184 KB |
Output is correct |
21 |
Correct |
123 ms |
1184 KB |
Output is correct |
22 |
Correct |
127 ms |
1184 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4016 ms |
39872 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
186 ms |
39872 KB |
Output is correct |
2 |
Correct |
320 ms |
39872 KB |
Output is correct |
3 |
Correct |
628 ms |
39972 KB |
Output is correct |
4 |
Correct |
662 ms |
39996 KB |
Output is correct |
5 |
Correct |
657 ms |
39996 KB |
Output is correct |
6 |
Correct |
637 ms |
39996 KB |
Output is correct |
7 |
Correct |
614 ms |
39996 KB |
Output is correct |
8 |
Correct |
597 ms |
39996 KB |
Output is correct |
9 |
Correct |
613 ms |
39996 KB |
Output is correct |
10 |
Correct |
636 ms |
39996 KB |
Output is correct |
11 |
Correct |
669 ms |
39996 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
39996 KB |
Output is correct |
2 |
Correct |
26 ms |
39996 KB |
Output is correct |
3 |
Correct |
40 ms |
39996 KB |
Output is correct |
4 |
Correct |
144 ms |
39996 KB |
Output is correct |
5 |
Correct |
1264 ms |
39996 KB |
Output is correct |
6 |
Execution timed out |
4035 ms |
40236 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
500 KB |
Output is correct |
3 |
Correct |
5 ms |
720 KB |
Output is correct |
4 |
Correct |
6 ms |
740 KB |
Output is correct |
5 |
Correct |
5 ms |
740 KB |
Output is correct |
6 |
Correct |
5 ms |
740 KB |
Output is correct |
7 |
Correct |
5 ms |
740 KB |
Output is correct |
8 |
Correct |
5 ms |
768 KB |
Output is correct |
9 |
Correct |
5 ms |
768 KB |
Output is correct |
10 |
Correct |
6 ms |
768 KB |
Output is correct |
11 |
Correct |
7 ms |
768 KB |
Output is correct |
12 |
Correct |
9 ms |
768 KB |
Output is correct |
13 |
Correct |
132 ms |
1084 KB |
Output is correct |
14 |
Correct |
125 ms |
1084 KB |
Output is correct |
15 |
Correct |
123 ms |
1184 KB |
Output is correct |
16 |
Correct |
130 ms |
1184 KB |
Output is correct |
17 |
Correct |
132 ms |
1184 KB |
Output is correct |
18 |
Correct |
135 ms |
1184 KB |
Output is correct |
19 |
Correct |
136 ms |
1184 KB |
Output is correct |
20 |
Correct |
128 ms |
1184 KB |
Output is correct |
21 |
Correct |
123 ms |
1184 KB |
Output is correct |
22 |
Correct |
127 ms |
1184 KB |
Output is correct |
23 |
Execution timed out |
4016 ms |
39872 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |