제출 #928614

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928614		VMaksimoski008	벽 (IOI14_wall)	C++14	8 / 100	3043 ms	18116 KiB

wall

#include <bits/stdc++.h>
#include "wall.h"

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
    for(int i=0; i<n; i++) finalHeight[i] = 0;

    for(int i=0; i<k; i++) {
        for(int j=left[i]; j<=right[i]; j++) {
            if(op[i] == 1) finalHeight[j] = max(finalHeight[j], height[i]);
            else finalHeight[j] = min(finalHeight[j], height[i]);
        }
    }

    //for(int i=0; i<n; i++) cout << finalHeight[i] << " ";
}

// int32_t main() {
//     int n, k;
//     cin >> n >> k;

//     int op[n], left[n], right[n], height[n], finalHeight[n];

//     for(int i=0; i<k; i++)
//         cin >> op[i] >> left[i] >> right[i] >> height[i];

//     buildWall(n, k, op, left, right, height, finalHeight);
//     return 0;
// }

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