Submission #246212

#TimeUsernameProblemLanguageResultExecution timeMemory
246212SamAndLightning Rod (NOI18_lightningrod)C++17
80 / 100
2074 ms147388 KiB
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 10000007; struct ban { int x, y; ban(){} ban(int x, int y) { this->x = x; this->y = y; } }; int ka() { int x = 0; while (1) { char y = getchar(); if ('0' <= y && y <= '9') x = (x * 10) + (y - '0'); else return x; } } int n; void solv() { n = ka(); stack<ban> s; for (int i = 1; i <= n; ++i) { int x, y; x = ka(); y = ka(); if (s.empty()) { s.push(ban(x, y)); continue; } if (x - s.top().x <= y - s.top().y) { while (!s.empty() && x - s.top().x <= y - s.top().y) s.pop(); s.push(ban(x, y)); } else { if (!(x - s.top().x <= s.top().y - y)) s.push(ban(x, y)); } } printf("%d\n", sz(s)); } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
#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...