Submission #700890

#TimeUsernameProblemLanguageResultExecution timeMemory
700890mychecksedadSeats (IOI18_seats)C++17
11 / 100
4100 ms44680 KiB
#include <bits/stdc++.h> using namespace std; int n, m; vector<vector<int>> grid; vector<array<int, 2>> pos; int calc(){ int ans = 0; int u = n, d = 0, l = m, r = 0; for(int i = 0; i < n*m; ++i){ u = min(u, pos[i][0]); d = max(d, pos[i][0]); l = min(l, pos[i][1]); r = max(r, pos[i][1]); if((r - l + 1) * (d - u + 1) == i + 1){ ans++; } } return ans; } void give_initial_chart(int H, int W, vector<int> R, vector<int> C){ n = H, m = W; grid.resize(n, vector<int> (m, 0)); pos.resize(n*m); for(int i = 0; i < n*m; ++i) grid[R[i]][C[i]] = i, pos[i] = {R[i], C[i]}; } int swap_seats(int a, int b){ swap(pos[a], pos[b]); grid[pos[a][0]][pos[a][1]] = a; grid[pos[b][0]][pos[b][1]] = b; return calc(); }
#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...