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 "seats.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> r, c;
int mr, mc, mmc, mmr, h, w;
map<pair<int,int>,bool> st;
bool check(int l){
for(int i = mr; i <= mmr; i++) for(int j = mc; j <= mmc; j++) if(!st[{i,j}]) return false;
return true;
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
r = R; c = C; h = H; w = W;
}
int swap_seats(int a, int b) {
mr = 1e9; mc = 1e9; mmc = 0; mmr = 0;
st.clear();
swap(r[a],r[b]);
swap(c[a],c[b] );
int cnt = 0;
for(int i = 0; i <= h * w - 1; i++) {
mr = min(mr, r[i]);
mmr = max(mmr, r[i]);
mc = min(mc, c[i]);
mmc = max(mmc, c[i]);
st[{r[i],c[i]}] = 1;
if(check(i)) cnt++;
}
return cnt;
}
# | 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... |