# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416265 | 2021-06-02T09:08:17 Z | strawberry2005 | Lightning Rod (NOI18_lightningrod) | C++17 | 436 ms | 79720 KB |
#include<bits/stdc++.h> using namespace std; //#define int long long #define pb push_back #define F first #define S second #define mp make_pair #define nl '\n' const int mod = 1e9+7; #define deb(x) cout<<#x<<": "<<x<<endl int iceil(int a, int b) { return (a + b - 1) / b; } int mod_fun(int a, int mod){ while(a < 0) a += mod; return a % mod; } int readInt() { int x = 0; char ch = getchar_unlocked(); 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; } signed main(){ #ifdef strawberryshaker2005 freopen("input.txt", "r", stdin); #endif //ios_base::sync_with_stdio(false); //cin.tie(NULL); //cout.tie(NULL); int n=readInt(); stack<pair<int,int>> s; for(int i=0;i<n;i++){ int x=readInt(),y=readInt(); while(!s.empty()&&abs(x-s.top().F)<=y-s.top().S){ s.pop(); } if(s.empty()||abs(x-s.top().F)>y-s.top().S) s.push({x,y}); } printf("%d",s.size()); return(0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 436 ms | 79720 KB | Output is correct |
2 | Correct | 408 ms | 79460 KB | Output is correct |
3 | Correct | 394 ms | 77328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 398 ms | 61428 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 436 ms | 79720 KB | Output is correct |
2 | Correct | 408 ms | 79460 KB | Output is correct |
3 | Correct | 394 ms | 77328 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Incorrect | 0 ms | 204 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |