oj.uz

Submission #475941

# Submission time Handle Problem Language Result Execution time Memory
475941 2021-09-24T13:58:47 Z AdamGS Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 460 KB 
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>restore_permutation(int n, int w, int r) {
	string s="";
	rep(i, n) s+="0";
	for(int i=1; i<n; i*=2) {
		rep(j, n) if(j&i) {
			if(s[j]=='1') s[j]='0';
			else s[j]='1';
			add_element(s);
			if(s[j]=='1') s[j]='0';
			else s[j]='1';
		}
		s="";
		rep(j, n) {
			if(j&i) s+="1";
			else s+="0";
		}
	}
	compile_set();
	vector<int>ans(n);
	s="";
	rep(i, n) s+="0";
	for(int i=1; i<n; i*=2) {
		string p="";
		rep(j, n) {
			if(s[j]=='1') s[j]='0';
			else s[j]='1';
			if(check_element(s)) {
				ans[j]+=i;
				p+="1";
			} else p+="0";
			if(s[j]=='1') s[j]='0';
			else s[j]='1';
		}
		s=p;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB n = 32
2 Correct 1 ms 216 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 0 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 0 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 288 KB n = 32
12 Correct 1 ms 292 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 332 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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