답안 #1082969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082969	2024-09-02T09:08:18 Z	n1k	벽 (IOI14_wall)	C++17	0 / 100	3000 ms	23932 KB

wall

#include "wall.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	vector<array<int, 3>> v;
	for(int i=0; i<k; i++){
		v.push_back({left[i], i, 0});
		v.push_back({right[i]+1, i, 1});
	}
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());

	vector<int> hu(k, -1), ho(k, -1);
	for(int i=0; i<n; i++){
		while(v.back()[0]<=i){
			auto [b, id, tp]=v.back();
			v.pop_back();
			if(tp==0){
				if(op[id]==1){
					hu[id]=height[id];
				}else{
					ho[id]=height[id];
				}
			}else{
				if(op[id]==1){
					hu[id]=-1;
				}else{
					ho[id]=-1;
				} 
			}
		}
		int o = 1e9, u = -1;
		bool bd = 1;
		for(int j=k-1; j>=0; j--){
			if(hu[j]!=-1){
				u = max(u, hu[j]);
			}if(ho[j]!=-1){
				o = min(o, ho[j]);
			}
			// >= ?
			if(u>o){
				if(u==hu[j]){
					finalHeight[i]=o;
					bd=0;
					break;
				}else if(o==ho[j]){
					finalHeight[i]=u;
					bd=0;
					break;
				}else{
					while(1);
				}
			}
		}
		if(bd){
			finalHeight[i]=max(0, u);
		}
	}
	return;
}

Subtask #1

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	2 ms	604 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	5 ms	800 KB	Output is correct
5	Correct	36 ms	800 KB	Output is correct
6	Runtime error	36 ms	1064 KB	Execution killed with signal 11
7	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	171 ms	23716 KB	Output is correct
3	Correct	1169 ms	10020 KB	Output is correct
4	Execution timed out	3043 ms	23932 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	2 ms	604 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	3 ms	796 KB	Output is correct
5	Correct	38 ms	800 KB	Output is correct
6	Runtime error	35 ms	1044 KB	Execution killed with signal 11
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	604 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	3 ms	800 KB	Output is correct
5	Correct	47 ms	800 KB	Output is correct
6	Runtime error	36 ms	1044 KB	Execution killed with signal 11
7	Halted	0 ms	0 KB	-