oj.uz

Submission #191330

# Submission time Handle Problem Language Result Execution time Memory
191330 2020-01-14T16:47:45 Z mrtsima22 Lightning Rod (NOI18_lightningrod) C++17
80 / 100
 2000 ms 192436 KB 
#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define two pair<int,int>
#define pb push_front
#define f first
#define s second
#define sz(container) (int)(container.size())
inline int bin(){
	int x=0;char ch=getchar();
	while (ch<'0'||ch>'9') ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return x;
}
int n;
deque<two>st;
int main(){
n=bin();
while(n--){
	int x=bin();
	int y=bin();
	bool ok=1;
	while(!st.empty()){
		int a=st.front().f;
		int b=st.front().s;
		if(x-a<=b-y){
			ok=0;
			break;
		}
		if(x-a<=y-b){
			st.pop_front();
		}else{
			break;
		}
	}
	if(ok){
		st.pb({x,y});
	}
}
printf("%d\n",sz(st));

	// you should actually read the stuff at the bottom
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), slow multiset operations
	* do smth instead of nothing and stay organized
	* unordered_map, hash_map, scanf, calculate answer instead of ans*K
*/
/*


                   *         *
                  * *       * *
                 *   *     *   *
                *     *   *     *
                 *   *   * *   *
                  *   *   *   *
                   *   * *   *
                     *  *   *
					   *  *


*/

Compilation message

lightningrod.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1799 ms 192436 KB Output is correct
2 Correct 1798 ms 191788 KB Output is correct
3 Correct 1736 ms 186668 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 0 ms 128 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 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 7 ms 504 KB Output is correct
2 Correct 0 ms 128 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 56 ms 3924 KB Output is correct
15 Correct 54 ms 3708 KB Output is correct
16 Correct 44 ms 3704 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1544 ms 147664 KB Output is correct
2 Correct 1558 ms 147484 KB Output is correct
3 Correct 1526 ms 143932 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1799 ms 192436 KB Output is correct
2 Correct 1798 ms 191788 KB Output is correct
3 Correct 1736 ms 186668 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 0 ms 128 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 56 ms 3924 KB Output is correct
18 Correct 54 ms 3708 KB Output is correct
19 Correct 44 ms 3704 KB Output is correct
20 Correct 1544 ms 147664 KB Output is correct
21 Correct 1558 ms 147484 KB Output is correct
22 Correct 1526 ms 143932 KB Output is correct
23 Execution timed out 2048 ms 137192 KB Time limit exceeded
24 Halted 0 ms 0 KB -