oj.uz

Submission #599231

# Submission time Handle Problem Language Result Execution time Memory
599231 2022-07-19T11:48:52 Z 8e7 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 468 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second

void genstring(int n, int l, int r) { //[l, r)
	if (r - l == 1) return;
	string a(n, '0');
	for (int i = 0;i < n;i++) {
		if (i < l || i >= r) a[i] = '1';
	}
	int m = (l + r) / 2;
	for (int i = l;i < m;i++) {
		string b = a;
		b[i] = '1';
		debug("add", b);
		add_element(b);
	}
	genstring(n, l, m), genstring(n, m, r);	
}
void solve(int n, int l, int r, vector<int> cand, vector<int> &ans) {
	debug("solve", l, r);
	pary(cand.begin(), cand.end());
	if (r - l == 1) {
		ans[cand[0]] = l;
		return;
	}
	int m = (l + r) / 2;
	string a(n, '1');
	for (int i:cand) a[i] = '0';
	vector<int> lef, rig;	
	for (int i:cand) {
		string b = a;
		b[i] = '1';
		if (check_element(b)) {
			lef.push_back(i);
		} else {
			rig.push_back(i);
		}
	}	
	solve(n, l, m, lef, ans);
	solve(n, m, r, rig, ans);
}
vector<int> restore_permutation(int n, int W, int R) {
	genstring(n, 0, n);
    compile_set();
	vector<int> ini(n), ans(n);
	for (int i = 0;i < n;i++) ini[i] = i;
	solve(n, 0, n, ini, ans);
	//pary(ans.begin(), ans.end());
    return ans;
}
/*
2 1 3 0
add 1000 
add 0100 
add 1011 
add 1110 

0001
0100
1011
1101
*/

Compilation message

messy.cpp: In function 'void genstring(int, int, int)':
messy.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
messy.cpp:32:3: note: in expansion of macro 'debug'
   32 |   debug("add", b);
      |   ^~~~~
messy.cpp: In function 'void solve(int, int, int, std::vector<int>, std::vector<int>&)':
messy.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
messy.cpp:38:2: note: in expansion of macro 'debug'
   38 |  debug("solve", l, r);
      |  ^~~~~
messy.cpp:14:19: warning: statement has no effect [-Wunused-value]
   14 | #define pary(...) 0
      |                   ^
messy.cpp:39:2: note: in expansion of macro 'pary'
   39 |  pary(cand.begin(), cand.end());
      |  ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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