oj.uz

답안 #221536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221536 2020-04-10T12:57:10 Z staniewzki 벽 (IOI14_wall) C++14
100 / 100
 1410 ms 108668 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#include<bits/stdc++.h>
using namespace std;

#include "wall.h"

#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define ST first
#define ND second
 
ostream& operator<<(ostream &out, string str) {
	for(char c : str) out << c;
	return out;
}
 
template<class L, class R> ostream& operator<<(ostream &out, pair<L, R> p) {
	return out << "(" << p.ST << ", " << p.ND << ")";
}
 
template<class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
	out << "{";
	for(auto it = a.begin(); it != a.end(); it = next(it))
		out << (it != a.begin() ? ", " : "") << *it;
	return out << "}";
}
 
void dump() { cerr << "\n"; }
template<class T, class... Ts> void dump(T a, Ts... x) {
	cerr << a << ", ";
	dump(x...);
}
 
#ifdef DEBUG
#  define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#  define debug(...) false
#endif
 
template<class T> int size(T && a) { return (int) a.size(); }
 
using LL = long long;
using PII = pair<int, int>;

struct Node {
	int low = 0, high = 1e5;
	int lazy_low = 0, lazy_high = 1e5;
	int sz = 1;
};

struct Tree {
	vector<Node> tree;
	int sz = 1;

	Tree(int n) {
		while(sz < n)
			sz *= 2;
		tree.resize(sz * 2);
		for(int i = sz - 1; i >= 1; i--)
			tree[i].sz = tree[i * 2].sz * 2;
	}

	void apply(int v, int low, int high) {
		auto adjust = [&](int &x) {
			if(x < low) x = low;
			if(high < x) x = high;
		};

		adjust(tree[v].low);
		adjust(tree[v].high);
		adjust(tree[v].lazy_low);
		adjust(tree[v].lazy_high);
	}

	void propagate(int v) {
		REP(i, 2) 
			apply(v * 2 + i, tree[v].lazy_low, tree[v].lazy_high);
		tree[v].lazy_low = 0, tree[v].lazy_high = 1e5;
	}

	void update(int l, int r, int val_l, int val_r, int v = 1) {
		if(l == 0 && r == tree[v].sz - 1) {
			apply(v, val_l, val_r);
			return;
		}

		propagate(v);

		int m = tree[v].sz / 2;
		if(r < m) update(l, r, val_l, val_r, v * 2);
		else if(m <= l) update(l - m, r - m, val_l, val_r, v * 2 + 1);
		else {
			update(l, m - 1, val_l, val_r, v * 2),
			update(0, r - m, val_l, val_r, v * 2 + 1);
		}
	}

	void prop_all(int v = 1) {
		if(tree[v].sz == 1) return;
		propagate(v);
		REP(i, 2) 
			prop_all(v * 2 + i);
	}

	int get(int v) {
		return tree[v + sz].low;
	}
};

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	Tree tree(n);

	REP(i, k) {
		int val_l = (op[i] == 1 ? height[i] : 0);
		int val_r = (op[i] == 2 ? height[i] : 1e5);
		tree.update(left[i], right[i], val_l, val_r);
	}

	tree.prop_all();
	REP(i, n) finalHeight[i] = tree.get(i);
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 16 ms 1152 KB Output is correct
5 Correct 13 ms 1152 KB Output is correct
6 Correct 14 ms 1152 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 181 ms 9208 KB Output is correct
3 Correct 377 ms 5752 KB Output is correct
4 Correct 1079 ms 14712 KB Output is correct
5 Correct 554 ms 14584 KB Output is correct
6 Correct 554 ms 14648 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 20 ms 1152 KB Output is correct
5 Correct 13 ms 1152 KB Output is correct
6 Correct 16 ms 1280 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 180 ms 9080 KB Output is correct
9 Correct 376 ms 5868 KB Output is correct
10 Correct 1084 ms 14864 KB Output is correct
11 Correct 551 ms 14584 KB Output is correct
12 Correct 548 ms 14840 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 191 ms 9080 KB Output is correct
15 Correct 75 ms 2688 KB Output is correct
16 Correct 1196 ms 14688 KB Output is correct
17 Correct 566 ms 14712 KB Output is correct
18 Correct 584 ms 14584 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 16 ms 1152 KB Output is correct
5 Correct 13 ms 1152 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 179 ms 9080 KB Output is correct
9 Correct 376 ms 5752 KB Output is correct
10 Correct 1087 ms 14712 KB Output is correct
11 Correct 560 ms 14712 KB Output is correct
12 Correct 541 ms 14584 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 194 ms 9080 KB Output is correct
15 Correct 68 ms 2688 KB Output is correct
16 Correct 1194 ms 14716 KB Output is correct
17 Correct 570 ms 14632 KB Output is correct
18 Correct 562 ms 14712 KB Output is correct
19 Correct 1365 ms 99004 KB Output is correct
20 Correct 1380 ms 108664 KB Output is correct
21 Correct 1388 ms 108536 KB Output is correct
22 Correct 1385 ms 108664 KB Output is correct
23 Correct 1385 ms 108664 KB Output is correct
24 Correct 1370 ms 108576 KB Output is correct
25 Correct 1410 ms 108436 KB Output is correct
26 Correct 1405 ms 108636 KB Output is correct
27 Correct 1380 ms 108632 KB Output is correct
28 Correct 1381 ms 108668 KB Output is correct
29 Correct 1393 ms 108556 KB Output is correct
30 Correct 1394 ms 108668 KB Output is correct