oj.uz

Submission #161430

# Submission time Handle Problem Language Result Execution time Memory
161430 2019-11-02T13:25:38 Z Berted Lightning Rod (NOI18_lightningrod) C++14
100 / 100
 564 ms 191124 KB 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define fst first
#define snd second
using namespace std;
stack<pii> s;
int n,a,b;
inline int readInt() {
    int x = 0;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}
int main()
{
	n = readInt();
	for (int i=0;i<n;i++)
	{
		a = readInt();
		b = readInt();
		if (s.empty()) {s.push({a,b});}
		else 
		{
			if (a - s.top().fst > s.top().snd - b)
			{
				while (s.size())
				{
					if (a - s.top().fst <= b - s.top().snd) {s.pop();}
					else {break;}
				}
				s.push({a,b});
			}
		}
		//cout<<i<<" "<<s.size()<<"\n";
	}
	printf("%d\n",(int)s.size());
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 93452 KB Output is correct
2 Correct 457 ms 191124 KB Output is correct
3 Correct 564 ms 185596 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 372 KB Output is correct
14 Correct 13 ms 3960 KB Output is correct
15 Correct 12 ms 3704 KB Output is correct
16 Correct 13 ms 3712 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 69656 KB Output is correct
2 Correct 424 ms 146620 KB Output is correct
3 Correct 418 ms 142936 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 433 ms 93452 KB Output is correct
2 Correct 457 ms 191124 KB Output is correct
3 Correct 564 ms 185596 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 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 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 372 KB Output is correct
17 Correct 13 ms 3960 KB Output is correct
18 Correct 12 ms 3704 KB Output is correct
19 Correct 13 ms 3712 KB Output is correct
20 Correct 424 ms 69656 KB Output is correct
21 Correct 424 ms 146620 KB Output is correct
22 Correct 418 ms 142936 KB Output is correct
23 Correct 522 ms 174288 KB Output is correct
24 Correct 465 ms 156292 KB Output is correct
25 Correct 454 ms 139080 KB Output is correct