Submission #904847

# Submission time Handle Problem Language Result Execution time Memory
904847 2024-01-12T10:28:20 Z Trisanu_Das Seats (IOI18_seats) C++17
11 / 100
4000 ms 40776 KB
#include "seats.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> r, c;
int h, w;

void give_initial_chart(int H, int W, vector<int>R, vector<int>C) {
    h = H; w = W; r = R; c = C;
}

int swap_seats(int a, int b) {
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    int minr = h+1, maxr = -1, minw = w + 1, maxw = -1, ans = 0;
    for(int i = 0; i < h * w; i++) {
        minr = min(minr, r[i]);
        maxr = max(maxr, r[i]);
        minw = min(minw, c[i]);
        maxw = max(maxw, c[i]);
        if((maxr - minr + 1) * (maxw  - minw + 1) == i + 1) ans++;
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 416 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 416 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 121 ms 600 KB Output is correct
14 Correct 124 ms 860 KB Output is correct
15 Correct 120 ms 1032 KB Output is correct
16 Correct 121 ms 864 KB Output is correct
17 Correct 120 ms 864 KB Output is correct
18 Correct 131 ms 860 KB Output is correct
19 Correct 125 ms 864 KB Output is correct
20 Correct 138 ms 860 KB Output is correct
21 Correct 133 ms 880 KB Output is correct
22 Correct 120 ms 872 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 4008 ms 23872 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 129 ms 600 KB Output is correct
2 Correct 1080 ms 3676 KB Output is correct
3 Execution timed out 4097 ms 39764 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 17 ms 1420 KB Output is correct
2 Correct 13 ms 1496 KB Output is correct
3 Correct 25 ms 1472 KB Output is correct
4 Correct 143 ms 1484 KB Output is correct
5 Correct 1192 ms 2388 KB Output is correct
6 Execution timed out 4042 ms 40776 KB Time limit exceeded
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 416 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 121 ms 600 KB Output is correct
14 Correct 124 ms 860 KB Output is correct
15 Correct 120 ms 1032 KB Output is correct
16 Correct 121 ms 864 KB Output is correct
17 Correct 120 ms 864 KB Output is correct
18 Correct 131 ms 860 KB Output is correct
19 Correct 125 ms 864 KB Output is correct
20 Correct 138 ms 860 KB Output is correct
21 Correct 133 ms 880 KB Output is correct
22 Correct 120 ms 872 KB Output is correct
23 Execution timed out 4008 ms 23872 KB Time limit exceeded
24 Halted 0 ms 0 KB -