Submission #211921

#	Time	Username	Problem	Language	Result	Execution time	Memory
211921		Benq	Chameleon's Love (JOI20_chameleon)	C++14	100 / 100	76 ms	580 KiB

chameleon

#include "chameleon.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...); }

#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)

// 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()); 

namespace {

int variable_example = 1;

}  // namespace

bool bad(vi v, int x) {
	v.pb(x);
	return Query(v) != sz(v);
}

void Solve(int N) {
	vi cand[2*N+1]; vi other(2*N+1), nex(2*N+1), pre(2*N+1);
	/*FOR(i,1,2*N+1) {
		vi v; FOR(j,1,2*N+1) if (j != i) v.pb(j);
		while (bad(v,i)) {
			int lo = 1, hi = sz(v);
			while (lo < hi) {
				int mid = (lo+hi)/2;
				if (bad(vi(begin(v),begin(v)+mid),i)) hi = mid;
				else lo = mid+1;
			}
			cand[i].pb(v[lo-1]);
			v = vi(begin(v)+lo,end(v));
		}
	}*/
	FOR(i,1,2*N+1) {
		vi col(i);
		function<void(int,int)> dfs = [&](int a, int b)  {
			if (col[a]) return;
			col[a] = b;
			trav(t,cand[a]) dfs(t,b^3);
		};
		vi tri[2];
		FOR(j,1,i) {
			if (!col[j]) dfs(j,1);
			tri[col[j]-1].pb(j);
		}
		F0R(j,2) {
			vi v = tri[j];
			while (bad(v,i)) {
				int lo = 1, hi = sz(v);
				while (lo < hi) {
					int mid = (lo+hi)/2;
					if (bad(vi(begin(v),begin(v)+mid),i)) hi = mid;
					else lo = mid+1;
				}
				int x = v[lo-1]; cand[i].pb(x), cand[x].pb(i);
				v = vi(begin(v)+lo,end(v));
			}
		}
	}
	FOR(i,1,2*N+1) {
		// dbg(i,cand[i]);
		assert(sz(cand[i]) == 1 || sz(cand[i]) == 3);
		if (sz(cand[i]) == 1) other[i] = cand[i][0];
		else {
			while (Query({i,cand[i][0],cand[i][1]}) != 1) 
				rotate(begin(cand[i]),begin(cand[i])+1,end(cand[i]));
			nex[i] = cand[i][2]; pre[cand[i][2]] = i;
		}
	}
	FOR(i,1,2*N+1) {
		if (!other[i]) 
			other[i] = cand[i][0]+cand[i][1]+cand[i][2]-nex[i]-pre[i];
		if (i < other[i]) Answer(i,other[i]);
	}

}

Compilation message (stderr)

chameleon.cpp: In function 'void setIn(std::__cxx11::string)':
chameleon.cpp:121: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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
chameleon.cpp: In function 'void setOut(std::__cxx11::string)':
chameleon.cpp:122: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); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
chameleon.cpp: At global scope:
chameleon.cpp:136:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
 int variable_example = 1;
     ^~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36