제출 #794363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794363		AkramElOmrani	벽 (IOI14_wall)	C++17	100 / 100	485 ms	99312 KiB

wall

#pragma once

#include <bits/stdc++.h>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);

struct Node {
	int mn = 1e9, mx = 0;
};
vector<Node> tree;

void upd(int node, int l, int r, int low, int high, int op, int v) {
	v = max(v, tree[node].mx);
	v = min(v, tree[node].mn);
	if(r < low || high < l) return;
	if(low <= l && r <= high) {
		if(op == 1) {
			// dbg(v)
			tree[node].mx = v;
		} else if(op == 2) {
			tree[node].mn = v;
		} else assert(false);
		return;
	}
	int mid = (l + r) / 2;
	upd(node * 2, l, mid, low, high, op, v);
	upd(node * 2 + 1, mid + 1, r, low, high, op, v);
}


void build(int node, int l, int r, int finalHeight[], int ans) {
	ans = max(ans, tree[node].mx);
	ans = min(ans, tree[node].mn);
	if(l == r) {
		finalHeight[l] = ans;
		return;
	}
	int mid = (l + r) / 2;
	build(node * 2, l, mid, finalHeight, ans);
	build(node * 2 + 1, mid + 1, r, finalHeight, ans);
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
	tree.resize(n * 4);

	for(int i = k - 1; i >= 0; --i) {
		upd(1, 0, n - 1, left[i], right[i], op[i], height[i]);
	}

	build(1, 0, n - 1, finalHeight, 0);
}

컴파일 시 표준 에러 (stderr) 메시지

wall.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 8 / 8
• Subtask 2: 24 / 24
• Subtask 3: 29 / 29
• Subtask 4: 39 / 39