| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1207162 | santialt2 | 벽 (IOI14_wall) | C++20 | 0 ms | 0 KiB |
#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, vl op, vl left, vl right, vl height, vl finalHeight){
finalHeight = vl(n, 0);
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;
}
*/