# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078998 | anton | Tiles (BOI24_tiles) | C++17 | 99 ms | 7352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |