# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332410 | pggp | Seats (IOI18_seats) | C++14 | 4098 ms | 27372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <seats.h>
using namespace std;
int H, W;
vector < int > R, C;
void give_initial_chart(int H_1, int W_1, vector < int > R_1, vector < int > C_1){
H = H_1;
W = W_1;
R = R_1;
C = C_1;
}
int swap_seats(int a, int b){
int r_a, c_a;
r_a = R[a];
c_a = C[a];
R[a] = R[b];
C[a] = C[b];
R[b] = r_a;
C[b] = c_a;
int ans = 0;
//cout << "A" << endl;
// teraz obliczamy liczbę prostokątów
int min_y = R[a];
int max_y = R[a];
int min_x = C[a];
int max_x = C[a];
for (int i = 1; i < R.size(); ++i)
{
if((max_x - min_x + 1) * (max_y - min_y + 1) == i){
ans++;
/// cout << "i: " << i << endl;
}
max_x = max(max_x, C[i]);
max_y = max(max_y, R[i]);
min_x = min(min_x, C[i]);
min_y= min(min_y, R[i]);
}
return ans + 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |