oj.uz

답안 #59231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59231 2018-07-21T09:38:20 Z tmwilliamlin168 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

string s;
int n;
vector<int> ans;

void rec1(int l, int r) {
	if(l==r)
		return;
	int m=(l+r)/2;
	for(int i=0; i<l; ++i)
		s[i]='1';
	for(int i=l; i<=r; ++i)
		s[i]='0';
	for(int i=r+1; i<n; ++i)
		s[i]='1';
	for(int i=l; i<=m; ++i) {
		s[i]='1';
		add_element(s);
		s[i]='0';
	}
	rec1(l, m);
	rec1(m+1, r);
}

void rec2(int l, int r, vector<int> &v) {
	if(l==r) {
		ans[v[0]]=l;
		return;
	}
	int m=(l+r)/2;
	for(int i=0; i<n; ++i)
		s[i]='1';
	for(int i : v)
		s[i]='0';
	vector<int> vl, vr;
	for(int i : v) {
		s[i]='1';
		if(check_element(s))
			vl.push_back(i);
		else
			vr.push_back(i);
		s[i]='0';
	}
	rec2(l, m, vl);
	rec2(m+1, r, vr);
}

vector<int> restore_permutation(int n2, int w, int r) {
	n=n2;
	s="";
	for(int i=0; i<n; ++i)
		s+='0';
	rec1(0, n-1);
	compile_set();
	vector<int> v;
	for(int i=0; i<n; ++i)
		v.push_back(i);
	ans=vector<int>(n);
	rec2(0, n-1, v);
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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