oj.uz

Submission #121942

# Submission time Handle Problem Language Result Execution time Memory
121942 2019-06-27T08:56:17 Z SOIVIEONE Wall (IOI14_wall) C++14
100 / 100
 664 ms 69400 KB 
#include <bits/stdc++.h>
#include "wall.h"
//#include <ext/pb_ds/assoc_container.hpp>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 2222222

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}

//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
int *arr, nn;
pii t[N << 2];

void push(int v, int op, int val)
{
	if(op == 1)
		umax(t[v].F, val), umax(t[v].S, val);
	else
		umin(t[v].F, val), umin(t[v].S, val);
	return;
}

void up(int foo, int hoo, int op, int val, int v = 1, int l = 1, int r = nn)
{
	if(l > hoo || r < foo)
		return;
	if(l >= foo && r <= hoo)
	{
		push(v, op, val);
		return;
	}
	push(v << 1, 1, t[v].F);
	push(v << 1 | 1, 1, t[v].F);
	push(v << 1, 2, t[v].S);
	push(v << 1 | 1, 2, t[v].S);	
	t[v].F = 0; t[v].S = 1e5;
	int m = (l + r) >> 1;
	up(foo, hoo, op, val, v << 1, l, m);
	up(foo, hoo, op, val, v << 1 | 1, m + 1, r);
}
int *a;
void build(int v = 1, int l = 1, int r = nn)
{
	if(l == r)
	{
		a[l-1] = t[v].F;
		return;
	}
	push(v << 1, 1, t[v].F);
	push(v << 1 | 1, 1, t[v].F);
	push(v << 1, 2, t[v].S);
	push(v << 1 | 1, 2, t[v].S);	
	t[v].F = 0; t[v].S = 1e5;
	int m = (l + r) >> 1;
	build(v << 1, l, m);
	build(v << 1 | 1, m + 1, r);
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
	nn = n;
	a = finalHeight;
	for(int i = 0; i <= n; i ++)
		t[i] = M(0, 1e5);
	for(int i = 0; i < k; i ++)
		up(left[i] + 1, right[i] + 1, op[i], height[i]);
	build();
}

Subtask #1
8.0 / 8.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 149 ms 14056 KB Output is correct
3 Correct 198 ms 8056 KB Output is correct
4 Correct 598 ms 20472 KB Output is correct
5 Correct 301 ms 21624 KB Output is correct
6 Correct 287 ms 20032 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 9 ms 896 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 149 ms 14008 KB Output is correct
9 Correct 201 ms 8056 KB Output is correct
10 Correct 590 ms 20600 KB Output is correct
11 Correct 294 ms 21496 KB Output is correct
12 Correct 285 ms 20088 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 156 ms 13944 KB Output is correct
15 Correct 40 ms 2040 KB Output is correct
16 Correct 654 ms 20796 KB Output is correct
17 Correct 299 ms 20092 KB Output is correct
18 Correct 295 ms 20216 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 7 ms 896 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 149 ms 14072 KB Output is correct
9 Correct 199 ms 8056 KB Output is correct
10 Correct 591 ms 20556 KB Output is correct
11 Correct 297 ms 21624 KB Output is correct
12 Correct 283 ms 19960 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 156 ms 14072 KB Output is correct
15 Correct 39 ms 2040 KB Output is correct
16 Correct 654 ms 20900 KB Output is correct
17 Correct 294 ms 20304 KB Output is correct
18 Correct 293 ms 20188 KB Output is correct
19 Correct 664 ms 69400 KB Output is correct
20 Correct 646 ms 62864 KB Output is correct
21 Correct 652 ms 69368 KB Output is correct
22 Correct 654 ms 62840 KB Output is correct
23 Correct 641 ms 62772 KB Output is correct
24 Correct 641 ms 62728 KB Output is correct
25 Correct 660 ms 62756 KB Output is correct
26 Correct 656 ms 69368 KB Output is correct
27 Correct 652 ms 69368 KB Output is correct
28 Correct 648 ms 62840 KB Output is correct
29 Correct 647 ms 62876 KB Output is correct
30 Correct 648 ms 62976 KB Output is correct