제출 #406165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406165		Antekb	Seats (IOI18_seats)	C++14	11 / 100	2222 ms	53992 KiB

seats

#include "seats.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> R, C;
int h, w;
const int N=1e5+5;
vector<int> x1(N), x2(N);
vector<int> Y1(N), y2(N);
int ans=1;
void give_initial_chart(int H, int W, std::vector<int> R2, std::vector<int> C2) {
	R=R2;
	C=C2;
	h=H;
	w=W;
	x1[0]=R[0];
	x2[0]=R[0];
	Y1[0]=C[0];
	y2[0]=C[0];
	for(int i=1; i<h*w; i++){
		x1[i]=min(x1[i-1], R[i]);
		x2[i]=max(x2[i-1], R[i]);
		Y1[i]=min(Y1[i-1], C[i]);
		y2[i]=max(y2[i-1], C[i]);
		if(i==(x2[i]-x1[i]+1)*(y2[i]-Y1[i]+1)-1)ans++;
	}
}

int swap_seats(int a, int b) {
	swap(R[a], R[b]);
	swap(C[a], C[b]);
	x1[0]=R[0], x2[0]=R[0], Y1[0]=C[0], y2[0]=C[0];
	for(int i=max(1, min(a, b)); i<=max(a, b); i++){
		if(i==(x2[i]-x1[i]+1)*(y2[i]-Y1[i]+1)-1)ans--;
	}
	for(int i=max(1, min(a, b)); i<=max(a, b); i++){
		x1[i]=min(x1[i-1], R[i]);
		x2[i]=max(x2[i-1], R[i]);
		Y1[i]=min(Y1[i-1], C[i]);
		y2[i]=max(y2[i-1], C[i]);
		if(i==(x2[i]-x1[i]+1)*(y2[i]-Y1[i]+1)-1)ans++;
	}
	return ans;
}

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