답안 #104246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104246	2019-04-04T11:51:01 Z	dupreez	Lightning Rod (NOI18_lightningrod)	C++14	66 / 100	2000 ms	79924 KB

lightningrod

#include <iostream>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#define mk make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pos;
const ll MOD = 1000000007,N=10000010;
int dp[N],n,mxv;
stack<int> st;

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) { 
		int v1, v2;
		scanf("%d%d", &v1,&v2);
		if (i == 1) {
			mxv = v1 + v2;
			st.push(v1 - v2);
		}
		else if (mxv < v1 + v2) {
			while (!st.empty() && st.top() >= v1 - v2)st.pop();
			st.push(v1 - v2);
			mxv = v1 + v2;
		}
	}
	cout << st.size() << endl;
	return 0;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
lightningrod.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &v1,&v2);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1

0 / 4.0

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

Subtask #2

7.0 / 7.0

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

Subtask #3

12.0 / 12.0

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

Subtask #4

21.0 / 21.0

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

Subtask #5

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	70 ms	3960 KB	Output is correct
15	Correct	87 ms	3704 KB	Output is correct
16	Correct	56 ms	3448 KB	Output is correct

Subtask #6

0 / 10.0

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

Subtask #7

0 / 20.0

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