Submission #585680

#	Time	Username	Problem	Language	Result	Execution time	Memory
585680		LastRonin	Wall (IOI14_wall)	C++14	0 / 100	647 ms	143420 KiB

wall

#include "wall.h"  
#include <bits/stdc++.h>
using namespace std;
#define pb push_back

const int N = 3e6;

vector<int> g[N];


void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	for(int i = 0; i < n; i++)
		finalHeight[i] = 0;
	int per = 0;
	for(int i = 0; i < k; i++) {
		if(op[i] == 2)break;
		per = i;
	}
	multiset<int> q;
	for(int j = 0; j <= n; j++)g[j].clear();
	q.clear();	
	for(int i = 0; i <= per; i++) {
		assert(op[i] == 1);
		g[left[i]].pb(height[i]);
		g[right[i] + 1].pb(-height[i]);						
	}
	for(int j = 0; j < n; j++) {
		for(auto u : g[j]) {
			if(u < 0) 
				q.erase(q.find(-u));
			else
				q.insert(u);	
		}
		if(q.size()) finalHeight[j] = *q.rbegin(); 
	}
	for(int j = 0; j <= n; j++)g[j].clear();
	q.clear();
	for(int i = per + 1; i < k; i++) {
		assert(op[i] == 2);
		g[left[i]].pb(height[i]);
		g[right[i] + 1].pb(-height[i]);						
	}
	for(int j = 0; j < n; j++) {
		for(auto u : g[j]) {
			if(u < 0)
				q.erase(q.find(-u));
			else
				q.insert(u);
		}
		if(q.size())finalHeight[j] = min(finalHeight[j], *q.begin());
	}
	return;
}

/*
int main()
{
  int n;
  int k;

  int i, j;  
  int status = 0;

  status = scanf("%d%d", &n, &k);
  assert(status == 2);

  int* op = (int*)calloc(sizeof(int), k);
  int* left = (int*)calloc(sizeof(int), k);
  int* right = (int*)calloc(sizeof(int), k);
  int* height = (int*)calloc(sizeof(int), k);
  int* finalHeight = (int*)calloc(sizeof(int), n);

  for (i = 0; i < k; i++){
    status = scanf("%d%d%d%d", &op[i], &left[i], &right[i], &height[i]);
    assert(status == 4);
  }

  buildWall(n, k, op, left, right, height, finalHeight);

  for (j = 0; j < n; j++)
    printf("%d\n", finalHeight[j]);
  
  return 0;
}
/*
10 3
1 3 4 91220
1 5 9 48623
2 3 5 39412
*/

Compilation message (stderr)

wall.cpp:85:1: warning: "/*" within comment [-Wcomment]
   85 | /*
      |

• Subtask 1: 0 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 29
• Subtask 4: 0 / 39