Submission #1203521

#TimeUsernameProblemLanguageResultExecution timeMemory
1203521QuentolosseWall (IOI14_wall)C++20
8 / 100
3094 ms9028 KiB
#include "wall.h" #include <bits/stdc++.h> #define int long long using namespace std; void buildWall(signed n, signed k, signed op[], signed left[], signed right[], signed height[], signed finalHeight[]){ vector<int> mur(n, 0); for (int i = 0; i < k; i++) { for (int j = left[i]; j < right[i]+1; j++) { if (op[i] == 1) { mur[j] = max(mur[j], (int)height[i]); } else { mur[j] = min(mur[j], (int)height[i]); } } } for (int i = 0; i < n; i++) { finalHeight[i] = mur[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...