oj.uz

답안 #1093809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093809 2024-09-27T14:58:09 Z Nonoze 자동 인형 (IOI18_doll) C++17
65.6728 / 100
 74 ms 17384 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;
map<int, int> unused;
vector<int> a, ans, x, y, state, 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);
			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) {
			if (mx==2) return;
			int s=-unused[mx]-1;
			build(s, 0, 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);
			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);
		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);
	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, a[0]);
	vector<vector<int>> nxt(m+1); nxt[0].pb(a[0]);
	for (int i=0; i<n; i++) nxt[a[i]].pb((i<n-1?a[i+1]:0));
	state.resize(2*n);
	for (int i=0; i<=m; i++) {
		if (sz(nxt[i])<2) { ans[i]=(sz(nxt[i])?nxt[i][0]:0); continue; }
		unused.clear(), base=0;
		int mx=1;
		while (mx<sz(nxt[i])) mx*=2;
		build(-i, 1, mx, sz(nxt[i]));
		for (auto u: nxt[i]) simulate(-ans[i]-1, u);
	}
	answer(ans, x, y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 19 ms 7736 KB Output is correct
3 Correct 16 ms 6492 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 24 ms 9560 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 19 ms 7736 KB Output is correct
3 Correct 16 ms 6492 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 24 ms 9560 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 31 ms 9688 KB Output is correct
9 Correct 30 ms 11092 KB Output is correct
10 Correct 48 ms 14968 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 19 ms 7736 KB Output is correct
3 Correct 16 ms 6492 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 24 ms 9560 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 31 ms 9688 KB Output is correct
9 Correct 30 ms 11092 KB Output is correct
10 Correct 48 ms 14968 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 70 ms 15420 KB Output is correct
15 Correct 29 ms 8532 KB Output is correct
16 Correct 50 ms 12764 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 51 ms 14964 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 448 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
14.7580402392 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Output is partially correct
2 Correct 45 ms 8064 KB Output is correct
3 Partially correct 52 ms 8704 KB Output is partially correct
4 Partially correct 74 ms 11884 KB Output is partially correct

Subtask #6
34.914797876 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Output is partially correct
2 Correct 45 ms 8064 KB Output is correct
3 Partially correct 52 ms 8704 KB Output is partially correct
4 Partially correct 74 ms 11884 KB Output is partially correct
5 Partially correct 65 ms 16868 KB Output is partially correct
6 Partially correct 63 ms 17384 KB Output is partially correct
7 Partially correct 63 ms 16780 KB Output is partially correct
8 Partially correct 54 ms 15876 KB Output is partially correct
9 Partially correct 45 ms 8228 KB Output is partially correct
10 Partially correct 67 ms 13632 KB Output is partially correct
11 Partially correct 44 ms 13380 KB Output is partially correct
12 Partially correct 31 ms 9088 KB Output is partially correct
13 Partially correct 43 ms 11224 KB Output is partially correct
14 Partially correct 41 ms 11140 KB Output is partially correct
15 Partially correct 42 ms 11260 KB Output is partially correct
16 Partially correct 2 ms 600 KB Output is partially correct
17 Partially correct 31 ms 8968 KB Output is partially correct
18 Partially correct 29 ms 8712 KB Output is partially correct
19 Partially correct 30 ms 8704 KB Output is partially correct
20 Partially correct 44 ms 13396 KB Output is partially correct
21 Partially correct 52 ms 13060 KB Output is partially correct
22 Partially correct 42 ms 12772 KB Output is partially correct