oj.uz

Submission #123109

# Submission time Handle Problem Language Result Execution time Memory
123109 2019-06-30T08:51:23 Z mechfrog88 Lightning Rod (NOI18_lightningrod) C++14
80 / 100
 2000 ms 116908 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;	

void fastscan(int &x)
    {
        bool neg=false;
        register int c;
        x =0;
        c=getchar();
        if(c=='-')
        {
            neg = true;
            c=getchar();
        }
        for(;(c>47 && c<58);c=getchar())
            x = (x<<1) + (x<<3) +c -48;
        if(neg)
            x *=-1;
    }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	fastscan(n);
	int arrx[n];
	int arry[n];
	for (int z=0;z<n;z++){
		fastscan(arrx[z]);
		fastscan(arry[z]);
	}
	stack <int> s;
	for (int z=0;z<n;z++){
		int a = arrx[z]-arry[z];
		int b = arrx[z]+arry[z];
		if (s.empty()){
			s.emplace(z);
		}
		int c = arrx[s.top()]-arry[s.top()];
		int d = arrx[s.top()]+arry[s.top()];
		if (c <= a && b <= d) continue;
		else{
			while (a <= c && d <= b){
				s.pop();
				if (s.size() == 0) break;
				c = arrx[s.top()]-arry[s.top()];
				d = arrx[s.top()]+arry[s.top()];
			}
			s.emplace(z);
		}
	}
	printf("%d",int(s.size()));
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1764 ms 116908 KB Output is correct
2 Correct 1765 ms 116244 KB Output is correct
3 Correct 1708 ms 113396 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 376 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 376 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 376 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 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 376 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 376 KB Output is correct
10 Correct 2 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 2 ms 376 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 376 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 376 KB Output is correct
10 Correct 2 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 2 ms 376 KB Output is correct
14 Correct 55 ms 2168 KB Output is correct
15 Correct 53 ms 2296 KB Output is correct
16 Correct 48 ms 2556 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1565 ms 104792 KB Output is correct
2 Correct 1559 ms 104444 KB Output is correct
3 Correct 1521 ms 102316 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1764 ms 116908 KB Output is correct
2 Correct 1765 ms 116244 KB Output is correct
3 Correct 1708 ms 113396 KB Output is correct
4 Correct 2 ms 376 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 376 KB Output is correct
10 Correct 2 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 2 ms 376 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 376 KB Output is correct
17 Correct 55 ms 2168 KB Output is correct
18 Correct 53 ms 2296 KB Output is correct
19 Correct 48 ms 2556 KB Output is correct
20 Correct 1565 ms 104792 KB Output is correct
21 Correct 1559 ms 104444 KB Output is correct
22 Correct 1521 ms 102316 KB Output is correct
23 Execution timed out 2049 ms 55460 KB Time limit exceeded
24 Halted 0 ms 0 KB -