oj.uz

답안 #256607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256607 2020-08-03T00:16:54 Z niyu Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#include "messy.h"

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

vi tr[512];

void add(int n, int l, int r) {
	if (l == r) return;
	string s = "";
	F0R(i, n) {
		if (i < l || i > r) s += "1";
		else s += "0";
	}
	FOR(i, l, (l + r)/2 + 1) {
		s[i] = '1';
		add_element(s);
		s[i] = '0';
	}
	add(n, l, (l + r)/2);
	add(n, (l + r) / 2 + 1, r);
}

void query(int n, int pos) {
	string s = "";
	F0R(i, n) s += "0";
	int j = pos;
	while (j) {
		for (int i : tr[j ^ 1]) s[i] = '1';
		j /= 2;
	}
	F0R(i, n) {
		if (s[i] == '1') continue;
		s[i] = '1';
		if (check_element(s)) tr[pos * 2].pb(i);
		else tr[pos * 2 + 1].pb(i);
		s[i] = '0';
	}
}

vi restore_permutation(int n, int w, int r) {
	//string s = "";
	add(n, 0, n - 1);
	compile_set();
	FOR(i, 1, n) query(n, i);
	vi res;
	F0R(i, n) {
		res.pb(0);
	}
	FOR(i, n, 2 * n) {
		res[tr[i][0]] = i - n;
	}
    return res;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB n = 8
2 Correct 0 ms 384 KB n = 8
3 Correct 0 ms 384 KB n = 8
4 Correct 1 ms 384 KB n = 8
5 Correct 1 ms 384 KB n = 8
6 Correct 0 ms 384 KB n = 8
7 Correct 0 ms 384 KB n = 8
8 Correct 0 ms 384 KB n = 8
9 Correct 0 ms 384 KB n = 8
10 Correct 0 ms 384 KB n = 8
11 Correct 0 ms 384 KB n = 8
12 Correct 0 ms 384 KB n = 8
13 Correct 0 ms 384 KB n = 8
14 Correct 0 ms 384 KB n = 8
15 Correct 0 ms 384 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB n = 32
2 Correct 1 ms 384 KB n = 32
3 Correct 0 ms 384 KB n = 32
4 Correct 0 ms 384 KB n = 32
5 Correct 1 ms 384 KB n = 32
6 Correct 1 ms 384 KB n = 32
7 Correct 0 ms 384 KB n = 32
8 Correct 0 ms 384 KB n = 32
9 Correct 1 ms 384 KB n = 32
10 Correct 1 ms 384 KB n = 32
11 Correct 0 ms 384 KB n = 32
12 Correct 0 ms 384 KB n = 32
13 Correct 1 ms 384 KB n = 32
14 Correct 1 ms 384 KB n = 32
15 Correct 0 ms 384 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB n = 32
2 Correct 0 ms 384 KB n = 32
3 Correct 1 ms 384 KB n = 32
4 Correct 1 ms 384 KB n = 32
5 Correct 0 ms 384 KB n = 32
6 Correct 0 ms 384 KB n = 32
7 Correct 1 ms 384 KB n = 32
8 Correct 0 ms 384 KB n = 32
9 Correct 0 ms 384 KB n = 32
10 Correct 0 ms 384 KB n = 32
11 Correct 1 ms 384 KB n = 32
12 Correct 0 ms 384 KB n = 32
13 Correct 0 ms 384 KB n = 32
14 Correct 0 ms 384 KB n = 32
15 Correct 1 ms 384 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB n = 128
2 Correct 2 ms 512 KB n = 128
3 Correct 2 ms 512 KB n = 128
4 Correct 2 ms 512 KB n = 128
5 Correct 2 ms 512 KB n = 128
6 Correct 2 ms 512 KB n = 128
7 Correct 2 ms 512 KB n = 128
8 Correct 2 ms 512 KB n = 128
9 Correct 2 ms 512 KB n = 128
10 Correct 2 ms 512 KB n = 128
11 Correct 2 ms 512 KB n = 128
12 Correct 2 ms 512 KB n = 128
13 Correct 2 ms 512 KB n = 128
14 Correct 2 ms 512 KB n = 128
15 Correct 2 ms 512 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB n = 128
2 Correct 2 ms 512 KB n = 128
3 Correct 2 ms 512 KB n = 128
4 Correct 2 ms 512 KB n = 128
5 Correct 2 ms 512 KB n = 128
6 Correct 2 ms 512 KB n = 128
7 Correct 2 ms 512 KB n = 128
8 Correct 2 ms 512 KB n = 128
9 Correct 2 ms 512 KB n = 128
10 Correct 2 ms 512 KB n = 128
11 Correct 2 ms 512 KB n = 128
12 Correct 2 ms 512 KB n = 128
13 Correct 2 ms 512 KB n = 128
14 Correct 2 ms 512 KB n = 128
15 Correct 2 ms 512 KB n = 128