oj.uz

Submission #945213

# Submission time Handle Problem Language Result Execution time Memory
945213 2024-03-13T14:22:12 Z PenguinsAreCute Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 636 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
void preDnc(int n, int l, int r) {
	string x; for(int i=0;i<n;i++) x+=char((i<l||i>=r)|48);
	int m = l+r>>1;
	for(int i=l;i<m;i++) {
		x[i]='1';
		add_element(x);
		x[i]='0';
	}
	if(r-l>2) {
		preDnc(n,l,m);
		preDnc(n,m,r);
	}
}
void postDnc(int n, int l, int r, vector<int> &perm) {
	vector<int> v(begin(perm)+l,begin(perm)+r);
	string x; for(int i=0;i<n;i++) x+='1'; for(auto i:v) x[i]='0';
	int m = l+r>>1;
	int cur = l, cur2 = m;
	for(auto i: v) {
		x[i] = '1';
		if(check_element(x)) perm[cur++]=i;
		else perm[cur2++]=i;
		x[i] = '0';
	}
	if(r-l>2) {
		postDnc(n,l,m,perm);
		postDnc(n,m,r,perm);
	}
}
std::vector<int> restore_permutation(int n, int w, int r) {
	preDnc(n,0,n);
	compile_set();
	vector<int> perm(n);
	iota(perm.begin(),perm.end(),0);
	postDnc(n,0,n,perm);
	vector<int> perm_inv(n);
	for(int i=0;i<n;i++) perm_inv[perm[i]]=i;
	return perm_inv;
}

Compilation message

messy.cpp: In function 'void preDnc(int, int, int)':
messy.cpp:6:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    6 |  int m = l+r>>1;
      |          ~^~
messy.cpp: In function 'void postDnc(int, int, int, std::vector<int>&)':
messy.cpp:20:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |  int m = l+r>>1;
      |          ~^~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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