oj.uz

Submission #24547

# Submission time Handle Problem Language Result Execution time Memory
24547 2017-06-10T10:39:57 Z Jeyeon Si(#1045) Unscrambling a Messy Bug (IOI16_messy) C++
100 / 100
 4 ms 640 KB 
#include <vector>
#include "messy.h"
#include <algorithm>
#include <string>
#include <stdio.h>

using namespace std;

string tmp;
void dncw(int s, int e) {
	if (s==e) return;
	int m = (s+e)>>1;
	int i;
	for (i=s;i<=m;i++) {
		tmp[i] = '1';
		add_element(tmp);
		tmp[i] = '0';
	}
	for (i=m+1;i<=e;i++) tmp[i] = '1';
	dncw(s,m);
	for (i=s;i<=m;i++) tmp[i] = '1';
	for (i=m+1;i<=e;i++) tmp[i] = '0';
	dncw(m+1,e);
	for (i=s;i<=m;i++) tmp[i] = '0';
}

vector<int> res;
void dncr(int s, int e) {
	if (s==e) return;
	int m = (s+e)>>1;
	int i, p = s;
	for (i=s;i<=e;i++) {
		tmp[res[i]] = '1';
		bool flag = check_element(tmp);
		tmp[res[i]] = '0';
		if (flag) swap(res[p++],res[i]);
	}
	for (i=m+1;i<=e;i++) tmp[res[i]] = '1';
	dncr(s,m);
	for (i=s;i<=m;i++) tmp[res[i]] = '1';
	for (i=m+1;i<=e;i++) tmp[res[i]] = '0';
	dncr(m+1,e);
	for (i=s;i<=m;i++) tmp[res[i]] = '0';
}

vector<int> tres;
vector<int> restore_permutation(int n, int w, int r) {
	int i;
	tmp.assign(n,'0');
	dncw(0,n-1);
	compile_set();
	tmp.assign(n,'0');
	for (i=0;i<n;i++) res.push_back(i);
	tres.resize(n);
	dncr(0,n-1);
	for (i=0;i<n;i++) tres[res[i]] = i;
    return tres;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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

Subtask #5
30.0 / 30.0

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