Submission #1264150

#TimeUsernameProblemLanguageResultExecution timeMemory
1264150sohamsen15Lightning Rod (NOI18_lightningrod)C++20
80 / 100
1012 ms156368 KiB
#include <iostream> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, ans = 0, x, y; cin >> n; if (n == 1) { cout << 1; return 0; } int a[n], b[n], maxal[n], minbr[n]; for (int i = 0; i < n; i++) { cin >> x >> y; a[i] = x + y, b[i] = x - y; } maxal[0] = a[0]; for (int i = 1; i < n; i++) maxal[i] = max(maxal[i - 1], a[i]); minbr[n - 1] = b[n - 1]; for (int i = n - 2; i >= 0; i--) minbr[i] = min(minbr[i + 1], b[i]); ans += (b[0] < minbr[1]) + (a[n - 1] > maxal[n - 2]); for (int i = 1; i < n - 1; i++) ans += (b[i] < minbr[i + 1] && a[i] > maxal[i - 1]); cout << ans; }
#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...