# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227646 | Autoratch | Lightning Rod (NOI18_lightningrod) | C++14 | 2092 ms | 72476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,x,y;
stack<pair<int,int> > a;
int main()
{
scanf("%d",&n);
for(int i = 0;i < n;i++)
{
scanf("%d%d",&x,&y);
while(!a.empty() and abs(a.top().first-x)<=y-a.top().second) a.pop();
if(a.empty() or abs(a.top().first-x)>a.top().second-y) a.push({x,y});
}
printf("%d",(int)a.size());
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |