Submission #520972

#TimeUsernameProblemLanguageResultExecution timeMemory
520972szekelymilan벽 (IOI14_wall)C++14
8 / 100
3082 ms8532 KiB
#include <iostream> #include "wall.h" 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++) finalHeight[j] = (op[i] == 1 ? std::max(finalHeight[j], height[i]) : std::min(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...