oj.uz

Submission #934462

# Submission time Handle Problem Language Result Execution time Memory
934462 2024-02-27T10:55:32 Z zhasyn Wall (IOI14_wall) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include <wall.h>
using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[],
int h[], int ans[]){
	for(int i = 0; i < n; i++){
		h[i] = 0;
	}
	for(int i = 0; i < k; i++){
		for(int j = left[i]; j <= right[i]; j++){
			if(op[i] == 1) ans[j] = max(h[i], ans[j]);
			else ans[j] = min(ans[j], h[i]);
		}
	}
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

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