Submission #954381

# Submission time Handle Problem Language Result Execution time Memory
954381 2024-03-27T18:03:23 Z Kakarot Wall (IOI14_wall) C++
0 / 100
1 ms 600 KB
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
 
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
  for(int i = 0; i < k; i++) {
    for(int j = left[i]-1; j < right[i]; j++) {
      if(op[i] == 1) finalHeight[j] = max(finalHeight[j], height[k]);
      else finalHeight[j] = min(finalHeight[j], height[k]);
    }
  }
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -