oj.uz

답안 #224934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224934 2020-04-19T06:35:19 Z maximath_1 Lightning Rod (NOI18_lightningrod) C++17
80 / 100
 2000 ms 222108 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gc getchar//_unlocked
#define pc putchar//_unlocked
int in(){
	char c=gc(); bool neg=false;
	for(; c<'0'||'9'<c; c=gc())
		if(c=='-') neg=true;
	int rs=c-'0'; c=gc();
	for(; '0'<=c && c<='9'; c=gc())
		rs=(rs<<1)+(rs<<3)+(c-'0');
	if(neg) rs=-rs;
	return rs;
}
void out(int _n){
	int N=_n, rev, count=0;
	rev=N;
	if(N==0) {pc('0'); return;}
	while((rev%10)==0) {count++; rev/=10;}
	rev=0;
	while(N!=0) {rev=(rev<<3)+(rev<<1)+N%10; N/=10;}
	while(rev!=0) {pc(rev%10+'0'); rev/=10;}
	while(count--) pc('0');
}
int pref[10000005], suff[10000005];
int n, x, y;
int main(){
	n=in();
	for(int i=0; i<n; i++){
		x=in(), y=in();
		pref[i]=x+y;
		suff[i]=y-x;
		if(i>0) pref[i]=max(pref[i], pref[i-1]);
	}
	int ans=0;
	for(int i=n-1; i>=0; i--){
		if((i==0||pref[i]>pref[i-1])
		 &&(i==n-1||suff[i]>suff[i+1]))
			ans++;
		if(i<n-1) suff[i]=max(suff[i], suff[i+1]);
	}
	out(ans); pc('\n'); return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1507 ms 189192 KB Output is correct
2 Correct 1501 ms 188516 KB Output is correct
3 Correct 1440 ms 183320 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 51 ms 5368 KB Output is correct
15 Correct 52 ms 5240 KB Output is correct
16 Correct 45 ms 4600 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1398 ms 174680 KB Output is correct
2 Correct 1418 ms 174620 KB Output is correct
3 Correct 1361 ms 170440 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1507 ms 189192 KB Output is correct
2 Correct 1501 ms 188516 KB Output is correct
3 Correct 1440 ms 183320 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 51 ms 5368 KB Output is correct
18 Correct 52 ms 5240 KB Output is correct
19 Correct 45 ms 4600 KB Output is correct
20 Correct 1398 ms 174680 KB Output is correct
21 Correct 1418 ms 174620 KB Output is correct
22 Correct 1361 ms 170440 KB Output is correct
23 Execution timed out 2089 ms 222108 KB Time limit exceeded
24 Halted 0 ms 0 KB -