oj.uz

Submission #369857

# Submission time Handle Problem Language Result Execution time Memory
369857 2021-02-22T16:12:20 Z Jasiekstrz Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 492 KB 
#include<bits/stdc++.h>
#include "messy.h"
#define fi first
#define se second
using namespace std;
string s;
vector<int> ans;
inline void swp(int x)
{
	s[x]=(s[x]=='0' ? '1':'0');
	return;
}
void add(int r,int m,int n)
{
	if(m==n)
		return;
	int i;
	for(i=r+m;i<n;i+=2*m)
	{
		swp(i);
		add_element(s);
		swp(i);
	}
	for(i=r+m;i<n;i+=2*m)
		swp(i);
	add(r,2*m,n);
	for(i=r;i<n;i+=m)
		swp(i);
	add(r+m,2*m,n);
	for(i=r;i<n;i+=2*m)
		swp(i);
	return;
}
void check(vector<int> av,int w,int p)
{
	if(av.size()==1)
	{
		ans[av[0]]=w;
		return;
	}
	vector<int> tmp[2];
	for(auto v:av)
	{
		swp(v);
		tmp[check_element(s)].push_back(v);
		swp(v);
	}
	for(auto v:tmp[1])
		swp(v);
	check(tmp[0],w,2*p);
	for(auto v:av)
		swp(v);
	check(tmp[1],w+p,2*p);
	for(auto v:tmp[0])
		swp(v);
	return;
}
vector<int> restore_permutation(int n,int w,int r)
{
	s=string(n,'0');
	ans.resize(n);
	add(0,1,n);
	compile_set();
	vector<int> tmp(n);
	for(int i=0;i<n;i++)
		tmp[i]=i;
	check(tmp,0,1);
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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