oj.uz

Submission #548958

# Submission time Handle Problem Language Result Execution time Memory
548958 2022-04-14T20:13:02 Z Hanksburger Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 492 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> useless, ans;
bool exist[130];
int N, cnt;
string str;
void recur1(int L, int R)
{
	if (L==R)
		return;
	int mid=(L+R)/2;
	for (int i=L; i<=mid; i++)
	{
		string tmp=str;
		for (int j=0; j<N; j++)
			if (j<L || j>R || j==i)
				tmp[j]='1';
		add_element(tmp);
	}
	recur1(L, mid);
	recur1(mid+1, R);
}
void recur2(vector<int> v)
{
	int sz=v.size();
	if (sz==1)
	{
		ans[v[0]]=cnt;
		cnt++;
		return;
	}
	for (int i=0; i<N; i++)
		exist[i]=0;
	for (int i=0; i<sz; i++)
		exist[v[i]]=1;
	vector<int> vec1, vec2;
	for (int i=0; i<sz; i++)
	{
		string tmp=str;
		for (int j=0; j<N; j++)
			if (!exist[j] || j==v[i])
				tmp[j]='1';
		if (check_element(tmp))
			vec1.push_back(v[i]);
		else
			vec2.push_back(v[i]);
	}
	recur2(vec1);
	recur2(vec2);
}
vector<int> restore_permutation(int NN, int WW, int RR)
{
	N=NN;
	for (int i=0; i<N; i++)
		str.push_back('0');
	recur1(0, N-1);
	compile_set();
	for (int i=0; i<N; i++)
	{
		useless.push_back(i);
		ans.push_back(0);
	}
	recur2(useless);
	return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 412 KB n = 128
2 Correct 2 ms 492 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 468 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 2 ms 468 KB n = 128
15 Correct 2 ms 468 KB n = 128