oj.uz

Submission #341158

# Submission time Handle Problem Language Result Execution time Memory
341158 2020-12-29T04:40:27 Z ommivorous Lightning Rod (NOI18_lightningrod) C++14
80 / 100
 2000 ms 192352 KB 
#include <bits/stdc++.h>
using namespace std;
 
stack<pair<int,int> >s;
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	int n; cin>>n;
	for(int i=0;i<n;i++){
		int x,y; cin>>x>>y;
		bool add=1;
		while(s.size()){
			int tx=s.top().first,ty=s.top().second;
			if(x-tx<=ty-y){add=0;break;}
			if(x-tx<=y-ty)s.pop();
			else break;
		}
		if(add)s.push(make_pair(x,y));
	}
	printf("%d",(int)s.size());
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1742 ms 80892 KB Output is correct
2 Correct 1783 ms 192352 KB Output is correct
3 Correct 1724 ms 186900 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 44 ms 3968 KB Output is correct
15 Correct 45 ms 3704 KB Output is correct
16 Correct 43 ms 3820 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1804 ms 52208 KB Output is correct
2 Correct 1846 ms 147800 KB Output is correct
3 Correct 1790 ms 144320 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1742 ms 80892 KB Output is correct
2 Correct 1783 ms 192352 KB Output is correct
3 Correct 1724 ms 186900 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 44 ms 3968 KB Output is correct
18 Correct 45 ms 3704 KB Output is correct
19 Correct 43 ms 3820 KB Output is correct
20 Correct 1804 ms 52208 KB Output is correct
21 Correct 1846 ms 147800 KB Output is correct
22 Correct 1790 ms 144320 KB Output is correct
23 Execution timed out 2083 ms 174256 KB Time limit exceeded
24 Halted 0 ms 0 KB -