oj.uz

Submission #963193

# Submission time Handle Problem Language Result Execution time Memory
963193 2024-04-14T17:04:40 Z PoPularPlusPlus Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 860 KB 
#include <bits/stdc++.h>
#include "messy.h"
 
using namespace std;
#define pb(x) push_back(x)
 
vector<int> ans;
int n;
 
void put(int l , int r){
	if(l == r - 1)return;
	int m = (l + r)/2;
	string s = "";
	for(int i = 0; i < n; i++){
		s += '1';
	}
	for(int i = l; i < r; i++){
		s[i] = '0';
	}
	for(int i = l; i < m; i++){
		s[i] = '1';
		//cout << s << '\n';
		add_element(s);
		s[i] = '0';
	}
	add_element(s);
	put(l , m);
	put(m , r);
}
 
void solve(vector<int>& v , int l , int r){
	//cout << l << ' ' << r << ' ' << v.size() << endl;
	if(l == r - 1){
		ans[v[0]] = l;
		return;
	}
	int m = (l + r)/2;
	string s = "";
	for(int i = 0; i < n; i++)s += '1';
  	//for(int i = l; i < r; i++)s[i] = '0';
	for(int i = 0; i < v.size(); i++){
		s[v[i]] = '0';
	}
	vector<int> a , b;
	for(int i = 0; i < v.size(); i++){
		s[v[i]] = '1';
		//cout << s << ' ' << check_element(s) << '\n';
		if(check_element(s)){
			//cout << v[i] << ' ';
			a.pb(v[i]);
		}
		else b.pb(v[i]);
		s[v[i]] = '0';
	}
	//cout << '\n';
	//assert(a.size() == b.size());
	solve(a , l , m);
	solve(b,m,r);
}
 
vector<int> restore_permutation(int nn, int w, int r){
	n = nn;
	ans.resize(n);
	put(0 , n);
    compile_set();
    vector<int> cur;
    for(int i = 0; i < n; i++){
    	cur.pb(i);
    }
    solve(cur , 0 , n);
    //cout << "came" << endl;
    /*for(int i = 0; i < n; i++){
    	cout << ans[i] << endl;
    }*/
    return ans;
}

Compilation message

messy.cpp: In function 'void solve(std::vector<int>&, int, int)':
messy.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i = 0; i < v.size(); i++){
      |                 ~~^~~~~~~~~~
messy.cpp:45:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i = 0; i < v.size(); i++){
      |                 ~~^~~~~~~~~~

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 600 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 0 ms 348 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 1 ms 348 KB n = 8
8 Correct 1 ms 348 KB n = 8
9 Correct 1 ms 344 KB n = 8
10 Correct 1 ms 344 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 436 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 344 KB n = 8
15 Correct 0 ms 344 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 1 ms 436 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 1 ms 348 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 1 ms 500 KB n = 32
7 Correct 1 ms 432 KB n = 32
8 Correct 1 ms 348 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 352 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 376 KB n = 32
3 Correct 0 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 1 ms 596 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 1 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 1 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 600 KB n = 128
2 Correct 2 ms 600 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 2 ms 604 KB n = 128
6 Correct 1 ms 600 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 688 KB n = 128
9 Correct 2 ms 604 KB n = 128
10 Correct 1 ms 600 KB n = 128
11 Correct 2 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 2 ms 604 KB n = 128
15 Correct 1 ms 604 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 600 KB n = 128
4 Correct 2 ms 472 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 2 ms 604 KB n = 128
7 Correct 2 ms 604 KB n = 128
8 Correct 1 ms 600 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 860 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 600 KB n = 128
15 Correct 2 ms 604 KB n = 128