제출 #960826

#제출 시각아이디문제언어결과실행 시간메모리
960826IUA_Hasin벽 (IOI14_wall)C++17
8 / 100
3038 ms18088 KiB
#include "wall.h" #include <bits/stdc++.h> #define endl "\n" #define yeap cout<<"YES"<<endl #define nope cout<<"NO"<<endl #define ll long long using namespace std; void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){ for(int i=0; i<k; i++){ ll a = op[i]; ll b = left[i]; ll c = right[i]; ll d = height[i]; if(a==1){ for(int j=b; j<=c; j++){ if(finalHeight[j]<d){ finalHeight[j] = d; } } } else { for(int j=b; j<=c; j++){ if(finalHeight[j]>d){ finalHeight[j] = d; } } } } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...