Submission #309230

#	Time	Username	Problem	Language	Result	Execution time	Memory
309230		jainbot27	벽 (IOI14_wall)	C++17	8 / 100	3078 ms	8696 KiB

wall

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

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalheight[]){
    F0R(i, n) finalheight[i] = 0;
    F0R(i, k){
        int l = left[i], r = right[i];
        FOR(j, l, r+1){
            if(op[i]==1){
                ckmax(finalheight[j], height[i]);    
            }
            else{
                ckmin(finalheight[j], height[i]);    
            }
        }
    } 
}

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