Submission #75745

#TimeUsernameProblemLanguageResultExecution timeMemory
75745arockSeats (IOI18_seats)C++14
17 / 100
4035 ms40236 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...