Submission #290258

#TimeUsernameProblemLanguageResultExecution timeMemory
290258AaronNaidu벽 (IOI14_wall)C++14
8 / 100
3080 ms18312 KiB
#include <bits/stdc++.h> using namespace std; void buildWall(int n, int k, int op[],int left[],int right[],int heights[],int finalHeight[]) { for (int i = 0; i < n; i++) { finalHeight[i] = 0; } for (int i = 0; i < k; i++) { if (op[i] == 1) { for (int j = left[i]; j <= right[i]; j++) { finalHeight[j] = max(finalHeight[j], heights[i]); } } else { for (int j = left[i]; j <= right[i]; j++) { finalHeight[j] = min(finalHeight[j], heights[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...