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;
using ll = long long;
using ii = pair<ll, ll>;
using vi = vector<int>;
using pi = pair<int, pair<int, int>>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
const int oo = 1000 * 1000 * 1000 + 7;
int H, W;
vector<int> R, C;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
::H = H; ::W = W;
for(auto u : R) ::R.push_back(u);
for(auto u : C) ::C.push_back(u);
}
int swap_seats(int A, int B) {
swap(R[A], R[B]); swap(C[A], C[B]);
int res = 0;
int r1 = R[0], r2 = R[0];
int c1 = C[0], c2 = C[0];
for(int l = 0; l < H * W; l++) {
r1 = min(r1, R[l]); r2 = max(r2, R[l]);
c1 = min(c1, C[l]); c2 = max(c2, C[l]);
int cur = (r2 - r1 + 1) * (c2 - c1 + 1);
res += (cur == l + 1);
}
return res;
}
# | 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... |