제출 #1043305

#제출 시각아이디문제언어결과실행 시간메모리
1043305nisanduuWall (IOI14_wall)C++14
8 / 100
3060 ms18004 KiB
#include "wall.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; 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++){ int o = op[i]; for(int j=left[i];j<=right[i];j++){ if(finalHeight[j]<height[i] && o==1) finalHeight[j] = height[i]; if(finalHeight[j]>height[i] && o==2) finalHeight[j] = height[i]; } } 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...