oj.uz

Submission #152991

# Submission time Handle Problem Language Result Execution time Memory
152991 2019-09-11T05:12:10 Z junodeveloper Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 556 KB 
#include <vector>
#include <string>
 
#include "messy.h"
 
using namespace std;
typedef vector<int> VI;
 
int N;
int p[128];
 
string Init() {
	string r="";
	int i;
	for(i=0;i<N;i++) r+="0";
	return r;
}
 
void Add(int l,int r) {
	if(l==r) return;
	int mid=(l+r)/2;
	Add(l,mid);
	Add(mid+1,r);
	int i;
	string s=Init();
	for(i=l;i<=r;i++) s[i]='1';
	for(i=l;i<=mid;i++) {
		s[i]='0';
		add_element(s);
		s[i]='1';
	}
}
 
void Solve(string a,int l,int r) {
	int i;
	if(l==r) {
		for(i=0;i<N;i++)
			if(a[i]=='1') {
				p[i]=l;
				break;
			}
		return;
	}
	string b=Init();
	for(i=0;i<N;i++) {
		if(a[i]=='1') {
			a[i]='0';
			if(check_element(a)) b[i]='1';
			a[i]='1';
		}
	}
	int mid=(l+r)/2;
	Solve(b,l,mid);
	for(i=0;i<N;i++) {
		if(a[i]=='1') b[i]=b[i]=='1'?'0':'1';
	}
	Solve(b,mid+1,r);
}
 
std::vector<int> restore_permutation(int n, int w, int r) {
	N=n;
	int i;
	Add(0,N-1);
	compile_set();
	string a=Init();
	for(i=0;i<N;i++) a[i]='1';
	Solve(a,0,N-1);
	vector<int> ret;
	for(i=0;i<N;i++) ret.push_back(p[i]);
	return ret;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB n = 8
2 Correct 2 ms 256 KB n = 8
3 Correct 2 ms 256 KB n = 8
4 Correct 2 ms 376 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 256 KB n = 8
7 Correct 2 ms 376 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 300 KB n = 8
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 252 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 424 KB n = 8
14 Correct 2 ms 256 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 3 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 3 ms 376 KB n = 32
9 Correct 2 ms 376 KB n = 32
10 Correct 2 ms 376 KB n = 32
11 Correct 3 ms 376 KB n = 32
12 Correct 2 ms 376 KB n = 32
13 Correct 3 ms 276 KB n = 32
14 Correct 3 ms 376 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 376 KB n = 32
5 Correct 2 ms 376 KB n = 32
6 Correct 3 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 376 KB n = 32
14 Correct 2 ms 376 KB n = 32
15 Correct 3 ms 376 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB n = 128
2 Correct 4 ms 504 KB n = 128
3 Correct 4 ms 504 KB n = 128
4 Correct 4 ms 504 KB n = 128
5 Correct 4 ms 556 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 476 KB n = 128
11 Correct 4 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 476 KB n = 128
15 Correct 4 ms 504 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 552 KB n = 128
2 Correct 4 ms 508 KB n = 128
3 Correct 4 ms 504 KB n = 128
4 Correct 4 ms 504 KB n = 128
5 Correct 4 ms 504 KB n = 128
6 Correct 5 ms 504 KB n = 128
7 Correct 5 ms 504 KB n = 128
8 Correct 4 ms 508 KB n = 128
9 Correct 4 ms 504 KB n = 128
10 Correct 4 ms 504 KB n = 128
11 Correct 4 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 504 KB n = 128