oj.uz

Submission #161431

# Submission time Handle Problem Language Result Execution time Memory
161431 2019-11-02T13:26:22 Z Berted Lightning Rod (NOI18_lightningrod) C++14
76 / 100
 2000 ms 99904 KB 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define fst first
#define snd second
#define getchar_unlocked getchar
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
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1750 ms 99904 KB Output is correct
2 Execution timed out 2052 ms 83600 KB Time limit exceeded
3 Halted 0 ms 0 KB -

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 376 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 376 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 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 380 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 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 380 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

# 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 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 380 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 54 ms 3924 KB Output is correct
15 Correct 53 ms 3708 KB Output is correct
16 Correct 48 ms 3680 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1521 ms 58940 KB Output is correct
2 Correct 1526 ms 58544 KB Output is correct
3 Correct 1494 ms 55544 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1750 ms 99904 KB Output is correct
2 Execution timed out 2052 ms 83600 KB Time limit exceeded
3 Halted 0 ms 0 KB -