제출 #1276032

#제출 시각아이디문제언어결과실행 시간메모리
1276032hiepsimauhong벽 (IOI14_wall)C++20
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h>
#include <wall.h>

using namespace std;

#define int long long
using ll = long long;

#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)

#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 0, L){FOR(KO, 0, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';

#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

const int N = 2e6 + 5;
const int M = 5e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;

int n, q;

/// Input IOI
int op[N], lf[N], rg[N];
int height[N], finalHeight[N];

/// Input
int a[N];

void buildWall(int _n, int _q, int op[], int left[], int right[], int height[], int finalHeight[]){
        n = _n;
        q = _q;

        FOR(i, 1, q){
                cin >> op[i] >> lf[i] >> rg[i] >> height[i];
        }

        FOR(_, 1, q){
                if(op[_] == 1){
                        FOR(i, lf[_], rg[_]){
                                a[i] = max(a[i], height[_]);
                        }
                }
                else{
                        FOR(i, lf[_], rg[_]){
                                a[i] = min(a[i], height[_]);
                        }
                }
        }

        FOR(i, 0, n - 1){
                finalHeight[i] = a[i];
        }
}

컴파일 시 표준 에러 (stderr) 메시지

wall.cpp:2:10: fatal error: wall.h: No such file or directory
    2 | #include <wall.h>
      |          ^~~~~~~~
compilation terminated.