제출 #1004951

#제출 시각아이디문제언어결과실행 시간메모리
1004951pavementTiles (BOI24_tiles)C++17
0 / 100
84 ms18984 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back int N, M, min_y = (int)1e9; vector<int> try_x; map<int, vector<int> > vec; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N >> M; for (int i = 1, x, y; i <= N; i++) { cin >> x >> y; if (i != N) { vec[x].pb(y); if (x != 0) { try_x.pb(x - 1); } try_x.pb(x); } } int ans = 0; sort(try_x.begin(), try_x.end()); try_x.erase(unique(try_x.begin(), try_x.end()), try_x.end()); for (auto x : try_x) { int prv = min_y; for (auto y : vec[x]) { min_y = min(min_y, y); } if (prv != min_y) { if (x % 2 == 1 || min_y % 2 == 1) { break; } } //~ cout << x << " " << min_y << '\n'; if (x % 2 == 0 && min_y % 2 == 0) { ans = x; } } cout << ans << '\n'; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...