Submission #1207165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207165		santialt2	벽 (IOI14_wall)	C++20	8 / 100	3095 ms	8592 KiB

wall

#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
#define ll int
#define vl vector<ll>
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
ll MOD = 1e9+7;

void buildWall(int n, int k, ll op[], ll left[], ll right[], ll height[], ll finalHeight[]){
	ff(i, 0, k){
		if(op[i] == 1){
			ff(j, left[i], right[i]+1){
				//cout << j << " ";
				finalHeight[j] = max(finalHeight[j], height[i]);
			}
		}
		else{
			ff(j, left[i], right[i]+1){
				//cout << j << " ";
				finalHeight[j] = min(finalHeight[j], height[i]);
			}
		}
		/*cout << ed;
		ff(j, 0, n){
			cout << finalHeight[j] << " ";
		}
		cout << ed;*/
	}
}
/*
int main(){
	ll n, k;
	cin >> n >> k;
	vl a(k), b(k), c(k), d(k);
	ff(i, 0, k){
		cin >> a[i] >> b[i] >> c[i] >> d[i];
	}
	vl ex;
	buildWall(n, k, a, b, c, d, ex);
	
	return 0;
}
*/

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