oj.uz

답안 #1093854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093854 2024-09-27T17:17:09 Z Nonoze 자동 인형 (IOI18_doll) C++17
86.6719 / 100
 99 ms 17288 KB 
/*
*	Author: Nonoze
*	Created: Sunday 11/08/2024
*/
#include <bits/stdc++.h>
#include "doll.h"

using namespace std;

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

// #define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;

int m, n, base=0;
map<int, int> unused;
vector<int> a, ans, x, y, state;
vector<pair<int, int>> par;

void build(int prec, bool left, int mx, int nb) {
	if (nb==0) {
		bool todo=0;
		if (!unused.count(mx)) {
			unused[mx]=-sz(x)-1, x.pb(base), y.pb(base), par.pb({prec, left});
			todo=1;
		}
		if (prec<=0) ans[-prec]=unused[mx];
		else if (left) x[prec-1]=unused[mx];
		else y[prec-1]=unused[mx];
		if (todo && mx>2) {
			int s=-unused[mx];
			build(s, 1, mx/2, 0);
			build(s, 0, mx/2, 0);
		}
		return;
	}
	if (mx==2) {
		if (nb==1) {
			if (prec<=0) ans[-prec]=-sz(x)-1;
			else if (left) x[prec-1]=-sz(x)-1;
			else y[prec-1]=-sz(x)-1;
			x.pb(base), y.pb(-inf), par.pb({prec, left});
			return;
		}
		if (prec<=0) ans[-prec]=-sz(x)-1;
		else if (left) x[prec-1]=-sz(x)-1;
		else y[prec-1]=-sz(x)-1;
		x.pb(-inf), y.pb(-inf), par.pb({prec, left});
		return;
	}
	if (prec<=0) ans[-prec]=-sz(x)-1;
	else if (left) x[prec-1]=-sz(x)-1;
	else y[prec-1]=-sz(x)-1;
	if (base==0) base=-sz(x)-1;
	x.pb(inf), y.pb(inf), par.pb({prec, left});
	int s=sz(x);
	build(s, 1, mx/2, max(0, nb-mx/2));
	build(s, 0, mx/2, min(nb, mx/2));
}


void simulate(int empl, int val) {
	int nxt=(state[empl]?y[empl]:x[empl]);
	if (nxt==-inf) {
		if (state[empl]) y[empl]=val;
		else x[empl]=val;
		state[empl]^=1;
		return;
	}
	nxt=-nxt-1;
	state[empl]^=1;
	simulate(nxt, val);
}

void create_circuit(int MM, vector<int> AA) { m=MM, a=AA, n=sz(a); ans.resize(m+1, inf); ans[0]=a[0];
	state.resize(2*n);
	vector<vector<int>> nxts(m+1);
	vector<bool> done(m+1, 0);
	for (int i=0; i<n; i++) nxts[a[i]].pb((i<n-1?a[i+1]:0));
	vector<int> nxt;
	int first=0;
	for (int i=1; i<n; i++) {
		if (sz(nxts[a[i-1]])>4) nxt.pb(a[i]), first=a[i-1];
	}
	if (sz(nxts[a.back()])>4) nxt.pb(0), first=a.back();
	for (int i=1; i<=m; i++) if (sz(nxts[i])<=4) {
		if (sz(nxts[i])<=1) {
			if (sz(nxts[i])==1) ans[i]=nxts[i][0];
			else ans[i]=0;
			continue;
		}
		unused.clear(), base=0;
		int mx=1;
		while (mx<sz(nxts[i])) mx*=2;
		build(-i, 1, mx, sz(nxts[i]));
		for (auto u: nxts[i]) simulate(-ans[i]-1, u);
	}
	if (sz(nxt)>=2) {
		unused.clear(), base=0;
		int mx=1;
		while (mx<sz(nxt)) mx*=2;
		build(-first, 1, mx, sz(nxt));
		for (auto u: nxt) simulate(-ans[first]-1, u);
	}
	for (auto &u: ans) if (u==inf) u=ans[first];
	// for (int i=0; i<=m; i++) {
	// 	cout << i << ' ' << ans[i] << endl;
	// }
	// for (int i=0; i<sz(x); i++) {
	// 	cout << -i-1 << ' ' << x[i] << ' ' << y[i] << endl;
	// }
	answer(ans, x, y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 18 ms 7260 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 23 ms 9052 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 18 ms 7260 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 23 ms 9052 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 30 ms 9296 KB Output is correct
9 Correct 32 ms 10444 KB Output is correct
10 Correct 47 ms 14020 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 18 ms 7260 KB Output is correct
3 Correct 16 ms 5976 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 23 ms 9052 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 30 ms 9296 KB Output is correct
9 Correct 32 ms 10444 KB Output is correct
10 Correct 47 ms 14020 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 65 ms 17288 KB Output is correct
15 Correct 32 ms 9128 KB Output is correct
16 Correct 48 ms 14080 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 56 ms 15668 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
14.7580402392 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Correct 51 ms 8144 KB Output is correct
3 Partially correct 68 ms 8132 KB Output is partially correct
4 Partially correct 85 ms 11972 KB Output is partially correct

Subtask #6
45.9139029664 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Correct 51 ms 8144 KB Output is correct
3 Partially correct 68 ms 8132 KB Output is partially correct
4 Partially correct 85 ms 11972 KB Output is partially correct
5 Partially correct 99 ms 15224 KB Output is partially correct
6 Partially correct 99 ms 14616 KB Output is partially correct
7 Partially correct 96 ms 14984 KB Output is partially correct
8 Partially correct 99 ms 14352 KB Output is partially correct
9 Partially correct 70 ms 8048 KB Output is partially correct
10 Partially correct 87 ms 13044 KB Output is partially correct
11 Partially correct 86 ms 13864 KB Output is partially correct
12 Partially correct 68 ms 9128 KB Output is partially correct
13 Correct 60 ms 9680 KB Output is correct
14 Partially correct 73 ms 9840 KB Output is partially correct
15 Partially correct 76 ms 9936 KB Output is partially correct
16 Partially correct 2 ms 600 KB Output is partially correct
17 Correct 53 ms 9020 KB Output is correct
18 Correct 50 ms 9160 KB Output is correct
19 Partially correct 67 ms 9044 KB Output is partially correct
20 Partially correct 89 ms 13640 KB Output is partially correct
21 Partially correct 85 ms 13360 KB Output is partially correct
22 Partially correct 85 ms 13148 KB Output is partially correct