Submission #1027773

#TimeUsernameProblemLanguageResultExecution timeMemory
1027773IssaTiles (BOI24_tiles)C++17
0 / 100
27 ms6800 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define ent "\n" const int maxn = 1e6 + 100; const ll INF = (ll)1e18 + 100; const int inf = 1e9 + 100; const int MOD = 1e9 + 123; const int maxl = 26; const int P = 31; int n, m; int a[maxn]; int b[maxn]; void test(){ cin >> n >> m; for(int i = 1; i <= n; i++){ cin >> a[i] >> b[i]; } int ans = 0; for(int i = 2; i <= n; i++){ int j = i; while(j + 1 <= n && b[j+1] == b[j]) j++; if(j > i && (b[i] & 1)) break; if((a[j] - a[i]) & 1){ ans = a[j] - 1; break; } ans = a[j]; i = j; } cout << ans; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; t = 1; while(t--) test(); cout << ent; }
#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...