제출 #413693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413693		LastRonin	자리 배치 (IOI18_seats)	C++14	5 / 100	4098 ms	40556 KiB

seats

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "seats.h"
#define ll long long
#define pb push_back
#define si short int
#define f first
#define s second
#define mp make_pair
using namespace std;
const ll N = 1e6 + 3;
const ll big = 1e9;
 
int n;
int h, w;
int ans = 0;
vector<int> R, C;
 
struct seg {
	si t[4 * N][2];
	void upd(int p, si z, int v = 1, int tl = 1, int tr = n) {
		if(tl == tr) {
			t[v][0] = z;
			t[v][1] = z;
			return;
		}
		int m = (tl + tr) >> 1ll;
		if(p <= m)
			upd(p, z, v * 2, tl, m);
		else	
			upd(p, z, v * 2 + 1, m + 1, tr);
		t[v][0] = min(t[v * 2][0], t[v * 2 + 1][0]);
		t[v][1] = max(t[v * 2][1], t[v * 2 + 1][1]);
	}
	pair<si, si> get(int l, int r, int v = 1, int tl = 1, int tr = n) {
		if(l > tr || tl > r) 
			return mp(30000, -30000);
		if(l <= tl && tr <= r)
			return mp(t[v][0], t[v][1]);
		int m = (tl + tr) >> 1ll;
		pair<si, si> v1 = get(l, r, v * 2, tl, m);
		pair<si, si> v2 = get(l, r, v * 2 + 1, m + 1, tr);
		return mp(min(v1.f, v2.f), max(v1.s, v2.s));			
	}
} rt[2]; 
 
void give_initial_chart(int H, int W, vector<int> r, vector<int> c) {
	R = r, C = c;
	n = H*W;
	for(int i = 1; i <= n; i++) {
		rt[0].upd(i, r[i - 1]);
		rt[1].upd(i, c[i - 1]);
	}
}
 
int swap_seats(int a, int b) {
	
	swap(R[a], R[b]), swap(C[a], C[b]);
	rt[0].upd(a + 1, R[a]), rt[0].upd(b + 1, R[b]);
	rt[1].upd(a + 1, C[a]), rt[1].upd(b + 1, C[b]);
	int ans = 0;
	for(int i = 1; i <= n;) {
		pair<si, si> x = rt[0].get(1, i);
		pair<si, si> y = rt[1].get(1, i);
		int k = (x.s - x.f + 1) * (y.s - y.f + 1) - i;
		if(k == 0)
			ans++, k = min(x.s - x.f + 1, y.s - y.f + 1);
		i += k;				
	}
	return ans;
}
/*
 
int main() {
	int n, m, q;
	cin >> n >> m >> q;
	vector<int> rr, cc;
	for(int i = 1, a, b; i <= n*m; i++)
		cin >> a >> b, rr.pb(a), cc.pb(b);
	give_initial_chart(n, m, rr, cc);
	while(q--) {
		ll a, b;
		cin >> a >> b;
		cout << swap_seats(a, b) << "\n";
	}
}
    */

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