Submission #222012

#	Time	Username	Problem	Language	Result	Execution time	Memory
222012		rqi	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	10 ms	512 KiB

messy

#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

int N;
void send(vi q){
	vi a(N+1, 0);
	string Q;
	for(auto u: q){
		a[u] = 1;
	}
	for(int i = 1; i <= N; i++){
		Q+=char('0'+a[i]);
	}
	//ps("add_element", Q);
	add_element(Q);
	//ps("Q", Q);
}

void sendElements(int L, int R, vi lock){
	//ps(L, R, lock);
	int M = (L+R)/2;
	
	for(int i = L; i <= M; i++){
		vi q = lock;
		q.pb(i);
		send(q);
	}
	

	if(L+1 == R) return;
	vi s1 = lock;
	vi s2 = lock;
	for(int i = L; i <= M; i++){
		s1.pb(i);
	}
	for(int i = M+1; i <= R; i++){
		s2.pb(i);
	}
	sendElements(L, M, s2);
	sendElements(M+1, R, s1);
}

int ans[129];

int check(vi q){
	vi a(N+1, 0);
	string Q;
	for(auto u: q){
		a[u] = 1;
	}
	for(int i = 1; i <= N; i++){
		Q+=char('0'+a[i]);
	}



	bool res = check_element(Q);
	//ps("check", Q, res);
	if(res == false) return 0;
	else return 1;
}

void checkElements(int L, int R, vi npos){ // what we know it doesn't map to (map of elements outside L-R)
	//ps("chk", L, R, npos);

	if(L == R){
		vi c(N+1, 0);
		for(auto u: npos){
			c[u] = 1;
		}		
		for(int i = 1; i <= N; i++){
			if(c[i] == 0){
				ans[L] = i;
				break;
			}
		}
		return;
	}
	int M = (L+R)/2;

	vi in(N+1, 0); //-1 don't consider. 1 = permutes from the [L, M]. 0 = permutes from [M+1], R

	for(auto u: npos){
		in[u] = -1;
	}

	for(int i = 1; i <= N; i++){
		if(in[i] != -1){
			vi q = npos;
			q.pb(i);
			in[i] = check(q);
		}
	}

	//ps("in", in);
	
	vi pos1 = npos; //-1 and 1
	vi pos2 = npos; //-1 and 0

	for(int i = 1; i <= N; i++){
		if(in[i] == 0){
			pos2.pb(i);
		}
		else if(in[i] == 1) pos1.pb(i);
	}
	//ps("pos1, pos2", pos1, pos2);
	checkElements(L, M, pos2);
	checkElements(M+1, R, pos1);
}

vector<int> restore_permutation(int n, int w, int r) {
	N = n;
	
	sendElements(1, N, {});

    compile_set();
    
    checkElements(1, N, {});

    vi fans(N, 0);
    for(int i = 1; i <= N; i++){
    	fans[(ans[i]-1)] = i-1;
    }

    return fans;
}

Compilation message (stderr)

messy.cpp: In function 'void setIn(std::__cxx11::string)':
messy.cpp:124:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
messy.cpp: In function 'void setOut(std::__cxx11::string)':
messy.cpp:125:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30