oj.uz

Submission #131223

# Submission time Handle Problem Language Result Execution time Memory
131223 2019-07-16T19:52:25 Z mahmoudbadawy Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 508 KB 
#include <vector>

#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

int ans[200];
int n;

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

void solve(int l,int r,vector<int> ind)
{
	/*cout << l << " " << r << " : ";
	for(int i:ind) cout << i << " ";
	cout << endl;*/
	if(l==r)
	{
		ans[ind[0]]=l;
		return;
	}
	vector<int> ll,rr;
	string s=string(n,'1');
	for(int i:ind) s[i]='0';
	for(int i:ind)
	{
		s[i]='1';
		//cout << s << endl;
		if(check_element(s))
			ll.push_back(i);
		else
			rr.push_back(i);
		s[i]='0';
	}
	int mid=(l+r)/2;
	solve(l,mid,ll);
	solve(mid+1,r,rr);
}

std::vector<int> restore_permutation(int nn, int w, int r) {
    /*add_element("0");
    compile_set();
    check_element("0");
    return std::vector<int>();*/
    n=nn;
    //cout << "OK" << endl;
    build(0,n-1);
    //cout << "OK" << endl;
    compile_set();
    //cout << "OK" << endl;
    vector<int> v;
    for(int i=0;i<n;i++) v.push_back(i);
    solve(0,n-1,v);
	vector<int> ret;
	for(int i=0;i<n;i++) ret.push_back(ans[i]);
	//for(int i:ret) cout << i << " "; cout << endl;
	return ret;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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