Submission #212716

#	Time	Username	Problem	Language	Result	Execution time	Memory
212716		MarcoMeijer	Seats (IOI18_seats)	C++14	17 / 100	4083 ms	67320 KiB

seats

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

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int h, w, n;
vi r, c;
vii pos;
int tot=0;
vi minR, maxR, minC, maxC;
vi added;

void give_initial_chart(int H, int W, vi R, vi C) {
	h=H, w=W, r=R, c=C;
	n = h*w;

	pos.resize(n);
	RE(i,n) pos[i] = {r[i], c[i]};

	minR .assign(n,  INF);
	maxR .assign(n, -INF);
	minC .assign(n,  INF);
	maxC .assign(n, -INF);
	added.assign(n, 0);

	RE(i,n) {
		minR[i] = pos[i].fi;
		maxR[i] = pos[i].fi;
		minC[i] = pos[i].se;
		maxC[i] = pos[i].se;
		if(i != 0) {
			minR[i] = min(minR[i], minR[i-1]);
			maxR[i] = max(maxR[i], maxR[i-1]);
			minC[i] = min(minC[i], minC[i-1]);
			maxC[i] = max(maxC[i], maxC[i-1]);
		}
		if((maxR[i]-minR[i]+1)*(maxC[i]-minC[i]+1) == i+1) {
			tot++;
			added[i] = 1;
		}
	}
}

int swap_seats(int a, int b) {
	if(b < a) swap(a,b);
	swap(pos[a], pos[b]);
	REP(i,a,b+1) {
		tot     -= added[i];
		added[i] = 0;
		minR [i] = pos[i].fi;
		maxR [i] = pos[i].fi;
		minC [i] = pos[i].se;
		maxC [i] = pos[i].se;
		if(i != 0) {
			minR[i] = min(minR[i], minR[i-1]);
			maxR[i] = max(maxR[i], maxR[i-1]);
			minC[i] = min(minC[i], minC[i-1]);
			maxC[i] = max(maxC[i], maxC[i-1]);
		}
		if((maxR[i]-minR[i]+1)*(maxC[i]-minC[i]+1) == i+1) {
			tot++;
			added[i] = 1;
		}
	}
	return tot;
}

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