Submission #246233

#TimeUsernameProblemLanguageResultExecution timeMemory
246233SamAndLightning Rod (NOI18_lightningrod)C++17
66 / 100
1081 ms80076 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; int ka() { int x = 0; while (1) { char y = getchar(); if ('0' <= y && y <= '9') x = (x * 10) + (y - '0'); else return x; } } int m; int xx[N / 2], yy[N / 2]; void solv() { int nn = ka(); int x, y; while (nn--) { x = ka(); y = ka(); while (m && x - xx[m - 1] <= y - yy[m - 1]) m--; if (!m || !(x - xx[m - 1] <= yy[m - 1] - y)) { xx[m] = x; yy[m] = y; m++; } } printf("%d\n", m); } 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...