Submission #1114637

#TimeUsernameProblemLanguageResultExecution timeMemory
1114637expert007Lightning Rod (NOI18_lightningrod)C++14
7 / 100
1392 ms204636 KiB
#include "bits/stdc++.h" using namespace std; #define ull unsigned long long #define int long long const int MOD = 1e9 + 7; void setIO() { cin.tie(0)->sync_with_stdio(0); } void solve() { int n; cin >> n; vector<pair<int, int>> a(n); for (int i = 0; i < n; i++) { cin >> a[i].first >> a[i].second; } sort(a.begin(), a.end()); int ct = 0; for(int i = 0; i<n-1;i++){ if(a[i].second < a[i+1].second){ if(abs(a[i+1].first - a[i].first) <= abs(a[i+1].second - a[i].second)){ ct += 1; i++; } else{ ct += 2; i++; } } else if(a[i].second > a[i+1].second){ if(abs(a[i].first - a[i+1].first) <= abs(a[i].second - a[i+1].second)){ ct += 1; i++; } else{ct += 2; i++;} } else{ ct += 2; i++; } } cout << ct << endl; } int32_t main() { setIO(); solve(); return 0; }
#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...