Submission #585534

#TimeUsernameProblemLanguageResultExecution timeMemory
585534SeDunionWall (IOI14_wall)C++17
8 / 100
3088 ms11224 KiB
#include "wall.h" #include<iostream> using namespace std; const int N = 2e6 + 123; int n; int a[N]; void buildWall(int n_, int k, int op[], int left[], int right[], int height[], int finalHeight[]){ n = n_; for (int i = 0 ; i < k ; ++ i) { for (int j = left[i] ; j <= right[i] ; ++ j) { if (op[i] == 1) a[j] = max(a[j], height[i]); else a[j] = min(a[j], height[i]); } } for (int i = 0 ; i < n ; ++ i) { finalHeight[i] = a[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...