# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328399 | egas | Lightning Rod (NOI18_lightningrod) | C++14 | 0 ms | 0 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;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<pair<long long,long long> > v;
set<long long> ss;
for(long long i = 0 ; i < n ; i++) {
long long x;
cin >> x;
long long y;
cin >> y;
v.push_back({x,y});
ss.insert(y);
if(i>=1e6 and s.size()==1 and (*ss.begin())==1 ) {
cout << n << '\n';
return 0;
}
}
if(s.size()==1 and (*ss.begin())==1 ) {
cout << n << '\n';
return 0;
}
if(n==2) {
if(abs(v[1].second-v[0].second)>=abs(v[1].first-v[0].first)) {
cout << 1 << '\n';
} else {
cout << 2 << '\n';
}
} else {
}
return 0;
}