Submission #41826

#	Time	Username	Problem	Language	Result	Execution time	Memory
41826		fest	Amusement Park (JOI17_amusement_park)	C++14	100 / 100	49 ms	16344 KiB

Joi

#include "Joi.h"
// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

static const int N = 200500, inf = 1e9 * 2, MOD = (int)1e9 + 7;

static char CH[N];

static const ll INF = 1e18;

static const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
static const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

static int in[N], timer, bit[N], out[N], up[N], a[N];

static bool was[N];

static vector<int> g[N];

static void dfs(int v) {
	was[v] = 1;
	in[v] = ++timer;
	a[in[v]] = v;
	for (auto u : g[v]) {
		if (was[u]) continue;
		dfs(u);
		up[u] = v;      
	}
	out[v] = timer;
}

void Joi(int n, int m, int A[], int B[], long long x, int T) {
	for (int i = 0; i < m; i++) {
		g[A[i]].pb(B[i]);
		g[B[i]].pb(A[i]);
	} 
	dfs(0);
	for (int l = 1; l <= n;) {
		int r = out[a[l]];
		if (r - l + 1 >= 60) {
			r = l + 59;
			for (int i = l; i <= r; i++) bit[a[i]] = i - l;
		}
		else {
			int b = bit[up[a[l]]];
			if (b > r - l + 1) {
				int sz = r - l + 1;
				for (int i = l, is = 60 - sz; i <= r; i++, is++) bit[a[i]] = is;
			}
			else {
				int i = l;
				int put = 0;
				while (put < b) bit[a[i++]] = put++;
				put = 60 - ((r - l + 1) - b);
				while (put < 60) bit[a[i++]] = put++;
			}
		} 	
		l = r + 1;		
	} 
	for (int i = 0; i < n; i++) {
		if ((1ll << bit[i]) & x) MessageBoard(i, 1);
		else MessageBoard(i, 0);
	}
}

Ioi

#include "Ioi.h"
// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

static const int N = 200500, inf = 1e9 * 2, MOD = (int)1e9 + 7;

static char CH[N];

static const ll INF = 1e18;

static const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
static const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

static int ok[N], a[N], in[N], timer, up[N], out[N], ans[N], bit[N], dont;

static bool was[N];

static vector<int> g[N];                             

static void dfs(int v) {
	was[v] = 1;
	in[v] = ++timer;
	a[in[v]] = v;
	for (auto u : g[v]) {
		if (was[u]) continue;
		dfs(u);
		up[u] = v;      
	}
	out[v] = timer;
}

static void dfs1(int v, int met) {
	if (!dont) return;
	was[v] = 1;
	for (auto u : g[v]) {
		if (was[u]) continue;
		if (met != ok[u]) continue; 
		if (in[u] > in[v]) {
			if (ans[bit[u]] == -1) dont--;
			else continue;
			ans[bit[u]] = Move(u);
			dfs1(u, met);
			if (!dont) return;
			Move(v);
		}
	}
	assert(v > 0);
	if (was[up[v]]) return;
	if (ans[bit[up[v]]] == -1) dont--;
	ans[bit[up[v]]] = Move(up[v]);
	if (!dont) return;	
	if (ok[up[v]] != met && met > 0) assert(0);
	dfs1(up[v], ok[up[v]]);
}

long long Ioi(int n, int m, int A[], int B[], int start, int msg, int T) {
	for (int i = 0; i < m; i++) g[A[i]].pb(B[i]), g[B[i]].pb(A[i]);
	dfs(0);
	int ctc = 1;
	for (int l = 1; l <= n;) {
		int r = out[a[l]];
		if (r - l + 1 >= 60) {
			r = l + 59;
			for (int i = l; i <= r; i++) ok[a[i]] = ctc, bit[a[i]] = i - l;
			ctc++;
		}
		else {
			int b = bit[up[a[l]]];
			if (b > r - l + 1) {
				int sz = r - l + 1;
				for (int i = l, is = 60 - sz; i <= r; i++, is++) bit[a[i]] = is;
			}
			else {
				int i = l;
				int put = 0;
				while (put < b) bit[a[i++]] = put++;
				put = 60 - ((r - l + 1) - b);
				while (put < 60) bit[a[i++]] = put++;
			}
		} 	
		l = r + 1;		
	}
	for (int i = 0; i < 60; i++) ans[i] = -1;
	dont = 60;
	ans[bit[start]] = msg;
	dont--;
	memset(was, 0, sizeof(was));
	dfs1(start, ok[start]);
	ll ret = 0;
	for (int i = 0; i < 60; i++) ret |= ((ans[i] * 1ll) << i);
	return ret;
}

Compilation message (stderr)

Joi.cpp:25:13: warning: 'CH' defined but not used [-Wunused-variable]
 static char CH[N];
             ^

Ioi.cpp:25:13: warning: 'CH' defined but not used [-Wunused-variable]
 static char CH[N];
             ^

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 55 / 55
• Subtask 5: 17 / 17