제출 #1041972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041972		ALeonidou	벽 (IOI14_wall)	C++17	8 / 100	3052 ms	13904 KiB

wall

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

#define ll int
#define F first
#define S second
#define sz(x) (ll)x.size()
#define endl "\n"
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

void buildWall(ll n, ll k, ll op[], ll left[], ll right[], ll height[], ll finalHeight[]){
	for (ll i =0; i<n; i++){
		finalHeight[i] = 0;
	}
	for (ll i =0; i<k ; i++){
		for (ll j = left[i]; j<=right[i]; j++){
			if (op[i] == 1){	//add
				finalHeight[j] = max(finalHeight[j], height[i]);
			}
			else{	//remove
				finalHeight[j] = min(finalHeight[j], height[i]);
			}
		}
	}
	return;
}

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