제출 #206361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
206361		batmend	Seats (IOI18_seats)	C++14	20 / 100	2198 ms	68484 KiB

seats

#include "seats.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 1000005;

int r, c, k;
int posx[N], posy[N];
int num[N];
int minTree[2100000], numMinTree[2100000], lazyTree[2100000];						// initial values are 0, thus, minTree is 0 for every val;
int a[5];

void buildNumMinTree(int id, int l, int r);
int getNum(int x, int y);
void supd(int id, int l, int r, int ll, int rr, int val);
void updBox(int x, int y, int v);
void change(int x, int y, int v);

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	r = H;
	c = W;
	k = H * W;
	buildNumMinTree(1, 0, k - 1);    			// initially every val is 0;
	for (int i = 0; i < k ; i++) {
		posy[i] = R[i];
		posx[i] = C[i];
		num[posy[i] * c + posx[i]] = i;
	}
	for (int i = 0; i <= r; i++) {
		for (int j = 0; j <= c; j++) {
			updBox(i, j, 1);
		}
	}
}

int swap_seats(int a, int b) {
	change(posx[a], posy[a], b);
	change(posx[b], posy[b], a);
	swap(posx[a], posx[b]);
	swap(posy[a], posy[b]);
	return numMinTree[1];
}

void change(int x, int y, int v) {
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			updBox(x+i, y+j, -1);
		}
	}
	num[y * c + x] = v;
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			updBox(x+i, y+j, 1);
		}
	}
}

void buildNumMinTree(int id, int l, int r) {
	numMinTree[id] = r - l + 1;
	if (r == l) return;
	int mid = (l + r) / 2;
	buildNumMinTree(2 * id, l, mid);
	buildNumMinTree(2 * id + 1, mid + 1, r);
}

int getNum(int x, int y) {
	if (x < 0 || x >= c || y < 0 || y >= r) return k;
	return num[y * c + x];
}

void supd(int id, int l, int r, int ll, int rr, int v) {
	if (l > rr || r < ll) return;
	if (ll <= l && r <= rr) {
		lazyTree[id] += v;
		minTree[id] += v;
		return;
	}
	int mid = (l + r) / 2;
	supd(2*id, l, mid, ll, rr, v);
	supd(2*id + 1, mid + 1, r, ll, rr, v);
	if (minTree[2*id] > minTree[2*id+1]) {
		minTree[id] = minTree[2*id+1];
		numMinTree[id] = numMinTree[2*id+1];
	}
	if (minTree[2*id] < minTree[2*id+1]) {
		minTree[id] = minTree[2*id];
		numMinTree[id] = numMinTree[2*id];
	}
	if (minTree[2*id] == minTree[2*id + 1]) {
		minTree[id] = minTree[2*id];
		numMinTree[id] = numMinTree[2*id] + numMinTree[2*id + 1];
	}
	minTree[id] += lazyTree[id];
}

void updBox(int x, int y, int v) {
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			a[2 * i + j] = getNum(x - i, y - j);
		}
	}
	sort (a, a + 4);
	if (a[0] < a[1]) supd(1, 0, k - 1, a[0], a[1] - 1, v);
	if (a[2] < a[3]) supd(1, 0, k - 1, a[2], a[3] - 1, v);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 20 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30