Submission #843150

#TimeUsernameProblemLanguageResultExecution timeMemory
843150Mr_PhWall (IOI14_wall)C++14
8 / 100
3040 ms18484 KiB
#include "wall.h" #include<bits/stdc++.h> //#include "grader.cpp" using namespace std; void buildWall(int n, int k, int x[], int l[], int r[], int h[], int ans[]){ for(int i=0;i<k;i++) { if(x[i]==1) { for(int j=l[i];j<=r[i];j++) ans[j]=max(ans[j],h[i]); } else { for(int j=l[i];j<=r[i];j++) ans[j]=min(ans[j],h[i]); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...