답안 #341092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341092	2020-12-29T01:52:07 Z	ommivorous	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2000 ms	29700 KB

lightningrod

#include <bits/stdc++.h>
using namespace std;

stack<pair<int,int> >s;

int main(){
	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

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2095 ms	29700 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct

Subtask #3

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 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	3 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct

Subtask #5

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 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	3 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	154 ms	3948 KB	Output is correct
15	Correct	152 ms	3948 KB	Output is correct
16	Correct	133 ms	3820 KB	Output is correct

Subtask #6

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2091 ms	20492 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2095 ms	29700 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-