| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 865266 | Trisanu_Das | Lightning Rod (NOI18_lightningrod) | C++17 | 1161 ms | 231464 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;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin >> n;
vector<pair<int,int> > v;
bool isSub1=true;
for(int i = 0 ; i < n ; i++) {
int x, y; cin >> x >> y;
if(y!=1)isSub1=false;
v.push_back({x,y});
}
if(isSub1) cout << n << '\n';
else 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';
}
}| # | 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... | ||||
