Submission #1078998

#TimeUsernameProblemLanguageResultExecution timeMemory
1078998antonTiles (BOI24_tiles)C++17
4 / 100
99 ms7352 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pt complex<int> int N, M; vector<pt> points; signed main(){ cin>>N>>M; int min_y = 1e18, max_y= -1e18; for(int i = 0; i<N; i++){ int a, b; cin>>a>>b; points.push_back({a, b}); min_y = min(min_y, b); max_y = max(max_y, b); } if((max_y-min_y)%2!=0){ cout<<0<<endl; } else{ cout<<M-M%2<<endl; } }
#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...