답안 #138935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138935	2019-07-31T01:27:30 Z	thebes	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2000 ms	71272 KB

lightningrod

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native")
#include <bits/stdc++.h>
using namespace std;

int n, i, x, y, f, a, b, sz=-1;
pair<int,int> st[10000005];

int main(){
    for(scanf("%d",&n),i=1;i<=n;i++){
        scanf("%d%d",&x,&y); f=0;
        while(sz!=-1){
            a = st[sz].first, b = st[sz].second;
            if(x-a<=b-y) break;
            else if(y-b>=x-a) sz--;
            else{f=1; break;}
        }
        if(sz==-1||f) st[++sz]={x,y};
    }
    printf("%d\n",sz+1);
    return 0;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d",&n),i=1;i<=n;i++){
         ~~~~~~~~~~~~~~^~~~
lightningrod.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y); f=0;
         ~~~~~^~~~~~~~~~~~~~

Subtask #1

0 / 4.0

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

Subtask #2

7.0 / 7.0

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

Subtask #3

12.0 / 12.0

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

Subtask #4

21.0 / 21.0

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

Subtask #5

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	380 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	404 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	3 ms	380 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	71 ms	376 KB	Output is correct
15	Correct	64 ms	376 KB	Output is correct
16	Correct	56 ms	1016 KB	Output is correct

Subtask #6

0 / 10.0

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

Subtask #7

0 / 20.0

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