Submission #954383

#TimeUsernameProblemLanguageResultExecution timeMemory
954383KakarotWall (IOI14_wall)C++98
8 / 100
3044 ms18244 KiB
#include "wall.h" #include <bits/stdc++.h> using namespace std; int max(int a, int b) { if(a > b) return a; return b; } int min(int a, int b) { if(a < b) return a; return b; } void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) { for(int i = 0; i < k; i++) { for(int j = left[i]; j <= right[i]; j++) { if(op[i] == 1) finalHeight[j] = max(finalHeight[j], height[i]); else finalHeight[j] = min(finalHeight[j], height[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...