Submission #519513

#TimeUsernameProblemLanguageResultExecution timeMemory
519513sumit_kk10Lightning Rod (NOI18_lightningrod)C++17
11 / 100
1303 ms79568 KiB
#include <bits/stdc++.h> #define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL) #define pb push_back #define ll long long #define F first #define S second using namespace std; const int N = 1e7 + 5, MOD = 1e9 + 7; inline int readInt() { int x = 0; char ch = getchar(); while (ch < '0' || ch > '9') ch = getchar_unlocked(); while (ch >= '0' && ch <= '9'){ x = (x << 3) + (x << 1) + ch - '0'; ch = getchar_unlocked(); } return x; } void solve(){ int n = readInt(); pair<int, int> a[n]; for(int i = 0; i < n; ++i){ a[i].S = readInt(); a[i].F = readInt(); } sort(a, a + n, greater<pair<int, int> >()); int pre = 0, ans = 1, i = 1; while(i < n){ if(a[pre].F - a[i].F < abs(a[i].S - a[pre].S)){ ++ans; pre = i; } ++i; } cout << ans << '\n'; } int main(){ fast; int t = 1; // cin >> t; while(t--) solve(); }
#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...