oj.uz

Submission #290256

# Submission time Handle Problem Language Result Execution time Memory
290256 2020-09-03T14:48:25 Z AaronNaidu Wall (IOI14_wall) C++14
0 / 100
 1 ms 384 KB 
#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]);
            }
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -