Submission #40518

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
40518	2018-02-03T15:03:16 Z	Pajaraja	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	7 ms	560 KB

messy

#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
int pe[130],pi[130];
std::vector<int> restore_permutation(int n, int w, int r)
{
    string sn;
    for(int i=0;i<n;i++) sn+='0';
    int logn=0;
    while((1<<logn)!=n) logn++;
    for(int i=logn-1;i>=0;i--)
    {
    	for(int j=0;j<n;j++) if(((1<<i)|j)==j)
    	{
    		string s=sn;
    		for(int x=0;x<n;x++)
    		{
    			if(x==j) 
				{
				    s[x]++;
				    continue;
				}
				for(int k=i+1;k<logn;k++) if(((1<<k)&x)!=((1<<k)&j))
				{
					s[x]++;
					break;
				}
			}
			add_element(s);
		}
	}
    compile_set();
	for(int i=logn-1;i>=0;i--)
    {
    	for(int j=0;j<n;j++)
    	{
    		string s=sn;
    		for(int x=0;x<n;x++)
    		{
    			if(x==j) 
				{
				    s[x]++;
				    continue;
				}
				for(int k=i+1;k<logn;k++) if(((1<<k)&pi[x])!=((1<<k)&pi[j]))
				{
					s[x]++;
					break;
				}
			}
		    if(check_element(s)) pi[j]+=(1<<i);
		}
	}
	vector<int> sol;
	for(int i=0;i<n;i++) sol.push_back(pi[i]);
    return sol;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	n = 8
2	Correct	2 ms	256 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	384 KB	n = 8
9	Correct	5 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	256 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	360 KB	n = 32
2	Correct	2 ms	384 KB	n = 32
3	Correct	2 ms	384 KB	n = 32
4	Correct	2 ms	384 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	3 ms	256 KB	n = 32
9	Correct	2 ms	256 KB	n = 32
10	Correct	2 ms	384 KB	n = 32
11	Correct	2 ms	384 KB	n = 32
12	Correct	2 ms	384 KB	n = 32
13	Correct	7 ms	384 KB	n = 32
14	Correct	2 ms	384 KB	n = 32
15	Correct	3 ms	384 KB	n = 32

Subtask #3

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	n = 32
2	Correct	2 ms	384 KB	n = 32
3	Correct	2 ms	384 KB	n = 32
4	Correct	2 ms	384 KB	n = 32
5	Correct	2 ms	384 KB	n = 32
6	Correct	3 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	384 KB	n = 32
12	Correct	2 ms	384 KB	n = 32
13	Correct	2 ms	384 KB	n = 32
14	Correct	2 ms	256 KB	n = 32
15	Correct	2 ms	384 KB	n = 32

Subtask #4

21.0 / 21.0

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

Subtask #5

30.0 / 30.0

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