oj.uz

답안 #1074534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1074534 2024-08-25T11:01:37 Z Nonoze 자동 인형 (IOI18_doll) C++17
53 / 100
 109 ms 17060 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;
vector<int> a;

void subtask1() {
	a.insert(a.begin(), 0); a.pb(0); n+=2;
	vector<int> ans(m+1);
	for (int i=1; i<n; i++) ans[a[i-1]]=a[i];
	answer(ans, {}, {});
}


vector<int> ans, x, y;

void build(int prec, bool left, vector<int>& nxt) {
	assert(sz(nxt));
	if (sz(nxt)==1) {
		if (nxt[0]==inf) nxt[0]=-prec;
		if (prec<=0) ans[-prec]=nxt[0];
		else if (left) x[prec-1]=nxt[0];
		else y[prec-1]=nxt[0];
		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);
	vector<int> nxt1, nxt2;
	int s=sz(x);
	if (sz(nxt)%2) nxt.insert(nxt.begin(), -s);
	for (int i=0; i<sz(nxt); i++) {
		if (i%2==0) nxt1.pb(nxt[i]);
		else nxt2.pb(nxt[i]);
	}
	build(s, 1, nxt1);
	build(s, 0, nxt2);
}


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));
	for (int i=0; i<=m; i++) {
		if (sz(nxt[i])<2) { ans[i]=(sz(nxt[i])?nxt[i][0]:0); continue; }
		build(-i, 1, nxt[i]);
	}
	answer(ans, x, y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 25 ms 7256 KB Output is correct
3 Correct 14 ms 5980 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 22 ms 8796 KB Output is correct
7 Correct 1 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 25 ms 7256 KB Output is correct
3 Correct 14 ms 5980 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 22 ms 8796 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 51 ms 8668 KB Output is correct
9 Correct 36 ms 10200 KB Output is correct
10 Correct 54 ms 13220 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 436 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 25 ms 7256 KB Output is correct
3 Correct 14 ms 5980 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 3932 KB Output is correct
6 Correct 22 ms 8796 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 51 ms 8668 KB Output is correct
9 Correct 36 ms 10200 KB Output is correct
10 Correct 54 ms 13220 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 436 KB Output is correct
14 Correct 65 ms 13252 KB Output is correct
15 Correct 48 ms 7200 KB Output is correct
16 Correct 81 ms 10944 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 12988 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 42 ms 7212 KB Output is correct
3 Partially correct 62 ms 11168 KB Output is partially correct
4 Partially correct 98 ms 12948 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 42 ms 7212 KB Output is correct
3 Partially correct 62 ms 11168 KB Output is partially correct
4 Partially correct 98 ms 12948 KB Output is partially correct
5 Partially correct 80 ms 14548 KB Output is partially correct
6 Partially correct 94 ms 15744 KB Output is partially correct
7 Partially correct 109 ms 15456 KB Output is partially correct
8 Partially correct 87 ms 16484 KB Output is partially correct
9 Partially correct 62 ms 11468 KB Output is partially correct
10 Partially correct 91 ms 16016 KB Output is partially correct
11 Partially correct 92 ms 17060 KB Output is partially correct
12 Partially correct 75 ms 11124 KB Output is partially correct
13 Partially correct 60 ms 10272 KB Output is partially correct
14 Partially correct 54 ms 10164 KB Output is partially correct
15 Partially correct 53 ms 9492 KB Output is partially correct
16 Partially correct 2 ms 600 KB Output is partially correct
17 Partially correct 52 ms 9116 KB Output is partially correct
18 Partially correct 60 ms 9220 KB Output is partially correct
19 Partially correct 56 ms 9748 KB Output is partially correct
20 Partially correct 70 ms 12652 KB Output is partially correct
21 Partially correct 81 ms 14740 KB Output is partially correct
22 Partially correct 64 ms 11752 KB Output is partially correct