oj.uz

Submission #115107

# Submission time Handle Problem Language Result Execution time Memory
115107 2019-06-05T10:12:34 Z E869120 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 512 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

int N; vector<int>ans;

void dfs(int cl, int cr) {
	if (cr - cl == 1) return;
	
	string str = ""; for (int i = 0; i < N; i++) str += "1";
	for (int i = cl; i < cr; i++) str[i] = '0';
	
	for (int i = cl; i < (cl + cr) / 2; i++) {
		string str2 = str; str2[i] = '1';
		add_element(str2);
	}
	dfs(cl, (cl + cr) / 2);
	dfs((cl + cr) / 2, cr);
}

void dfs2(int cl, int cr, vector<int>vec1, vector<int>vec2) {
	if (cr - cl == 1) { ans[vec1[0]] = cl; return; }
	
	vector<int>E1, E2;
	for (int i = 0; i < vec1.size(); i++) {
		string str = ""; for (int k = 0; k < N; k++) str += "0";
		for (int j = 0; j < vec2.size(); j++) str[vec2[j]] = '1';
		str[vec1[i]] = '1';
		
		if (check_element(str) == true) E1.push_back(vec1[i]);
		else E2.push_back(vec1[i]);
	}
	
	vector<int> G1 = vec2; for (int i = 0; i < E1.size(); i++) G1.push_back(E1[i]);
	vector<int> G2 = vec2; for (int i = 0; i < E2.size(); i++) G2.push_back(E2[i]);
	
	dfs2(cl, (cl + cr) / 2, E1, G2);
	dfs2((cl + cr) / 2, cr, E2, G1);
}

vector<int> restore_permutation(int n, int w, int r) {
	N = n; ans.resize(n, 0);
	dfs(0, n);
	compile_set();
	vector<int> alls; for (int i = 0; i < n; i++) alls.push_back(i);
	dfs2(0, n, alls, vector<int>{});
    return ans;
}

Compilation message

messy.cpp: In function 'void dfs2(int, int, std::vector<int>, std::vector<int>)':
messy.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vec1.size(); i++) {
                  ~~^~~~~~~~~~~~~
messy.cpp:27:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < vec2.size(); j++) str[vec2[j]] = '1';
                   ~~^~~~~~~~~~~~~
messy.cpp:34:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  vector<int> G1 = vec2; for (int i = 0; i < E1.size(); i++) G1.push_back(E1[i]);
                                         ~~^~~~~~~~~~~
messy.cpp:35:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  vector<int> G2 = vec2; for (int i = 0; i < E2.size(); i++) G2.push_back(E2[i]);
                                         ~~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

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