oj.uz

Submission #455238

# Submission time Handle Problem Language Result Execution time Memory
455238 2021-08-05T17:52:26 Z PedroBigMan Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 464 KB 
#include "messy.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

ll N,B;

string BIT(vector<ll> pos)
{
	string ans = ""; REP(i,0,N) {ans+='0';}
	REP(i,0,pos.size()) {ans[pos[i]]='1';}
	return ans;
}

string REV(string s)
{
	REP(i,0,N) {if(s[i]=='0') {s[i]='1';} else {s[i]='0';}}
	return s;
}

vector<int> restore_permutation(int n, int w, int r) 
{
    N=(ll) n; B=(ll)log2(N); 
	REP(i,0,B) {add_element(REV(BIT({1<<i})));}
	vector<ll> pos={}; 
	REP(i,0,B) {pos.pb(1<<i); add_element(BIT(pos));}
	REP(i,0,B)
	{
		REP(j,0,N)
		{
			if((j&(1<<i))!=0LL && j!=(1<<i)) {add_element(BIT({1<<i,j}));}
		}
	}
	compile_set();
	vector<ll> rep,rep_or;
	REP(i,0,N)
	{
		if(check_element(REV(BIT({i})))) {rep.pb(i);}
	}
	vector<bool> visited; REP(i,0,B) {visited.pb(false);}
	string s=BIT({});
	REP(i,0,B-1)
	{
		REP(j,0,B)
		{
			if(visited[j]) {continue;}
			s[rep[j]]='1'; 
			if(check_element(s)) {rep_or.pb(rep[j]); visited[j]=true; break;}
			s[rep[j]]='0';
		}
	}
	REP(i,0,B) {if(!visited[i]) {rep_or.pb(rep[i]); break;}}
	rep=rep_or; 
	vector<ll> p; REP(i,0,N) {p.pb(0);} 
	visited.clear(); REP(i,0,N) {visited.pb(false);} REP(i,0,B) {visited[rep[i]]=true;}
	ll OC;
	REP(i,0,B)
	{
		vector<ll> asked; vector<ll> ones;
		REP(j,0,1LL<<i) {asked.pb(0); ones.pb(0);}
		OC = N/(1LL<<i);
		REP(j,0,B)
		{
			if(j!=i) {asked[p[rep[j]]]++;}
		}
		asked[p[rep[i]]]++; ones[p[rep[i]]]++; p[rep[i]]=1<<i;
		REP(j,0,N)
		{
			if(visited[j]) {continue;}
			if(asked[p[j]]==OC-1) 
			{
				asked[p[j]]=OC;
				if(ones[p[j]]<OC/2) {ones[p[j]]++; p[j]+=(1<<i);}
			}
			else
			{
				if(check_element(BIT({rep[i],j}))) {asked[p[j]]++; ones[p[j]]++; p[j]+=(1<<i);}
				else {asked[p[j]]++;}
			}
		}
	}
	return p;
}

Compilation message

messy.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
messy.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      |

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 1 ms 204 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 0 ms 204 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 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 292 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 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 1 ms 204 KB n = 32
3 Correct 1 ms 288 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 288 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 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 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 3 ms 460 KB n = 128
2 Correct 3 ms 428 KB n = 128
3 Correct 3 ms 460 KB n = 128
4 Correct 3 ms 460 KB n = 128
5 Correct 3 ms 460 KB n = 128
6 Correct 3 ms 460 KB n = 128
7 Correct 3 ms 460 KB n = 128
8 Correct 3 ms 460 KB n = 128
9 Correct 3 ms 460 KB n = 128
10 Correct 3 ms 460 KB n = 128
11 Correct 3 ms 460 KB n = 128
12 Correct 3 ms 460 KB n = 128
13 Correct 3 ms 460 KB n = 128
14 Correct 3 ms 460 KB n = 128
15 Correct 3 ms 460 KB n = 128

Subtask #5
30.0 / 30.0

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