# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
416263 | 2021-06-02T09:06:32 Z | strawberry2005 | Lightning Rod (NOI18_lightningrod) | C++17 | 2000 ms | 79808 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; } signed main(){ #ifdef strawberryshaker2005 freopen("input.txt", "r", stdin); #endif //ios_base::sync_with_stdio(false); //cin.tie(NULL); //cout.tie(NULL); int n; scanf("%d",&n); stack<pair<int,int>> s; for(int i=0;i<n;i++){ int x,y,add=1; scanf("%d %d",&x,&y); 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1952 ms | 79808 KB | Output is correct |
2 | Correct | 1994 ms | 79556 KB | Output is correct |
3 | Correct | 1915 ms | 77320 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2015 ms | 61604 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1952 ms | 79808 KB | Output is correct |
2 | Correct | 1994 ms | 79556 KB | Output is correct |
3 | Correct | 1915 ms | 77320 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Incorrect | 0 ms | 204 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |