Submission #1310618

#TimeUsernameProblemLanguageResultExecution timeMemory
1310618harryleeeFire (BOI24_fire)C++20
0 / 100
1 ms572 KiB
#include<bits/stdc++.h> #define int long long using namespace std; const int maxn = 2e5; int n, m; struct point{ int x, y; } a[maxn + 1]; namespace sub1{ int solve(){ int min_y = 1e9, max_y = 0; for (int i = 1; i <= n; ++i){ min_y = min(min_y, a[i].y); max_y = max(max_y, a[i].y); } if ((max_y - min_y) % 2 != 0 || (max_y - min_y) == 0) return 0; if (m % 2 == 0) return m; else return m - 1; } } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; ++i){ cin >> a[i].x >> a[i].y; } if (n == 4){ cout << sub1::solve(); } }
#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...