Submission #1192637

#TimeUsernameProblemLanguageResultExecution timeMemory
1192637GoBananas69Wall (IOI14_wall)C++20
8 / 100
3096 ms8520 KiB
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;

void buildWall(int n, int k, int op[], int l_[], int r_[], int h_[], int res[]) {
    for (int idx = 0; idx<k; ++idx) {
        int q = op[idx];
        int l = l_[idx], r = r_[idx], h = h_[idx];
        for (int i = l; i<=r; ++i) {
            if (q == 1 && res[i] < h) {
                res[i] = h;
            } else if (q == 2 && res[i] > h) {
                res[i] = h;
            }
        }
    }
    // for (int i = 0; i<n; ++i) {
    //     cout << res[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...