Submission #227490

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
227490	2020-04-27T14:50:26 Z	rqi	Library (JOI18_library)	C++14	100 / 100	617 ms	404 KB

library

#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;
#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;
int neighb[1005][2];

int query(vi a){
	vi res(N, 0);
	for(auto u: a){
		res[u-1] = 1;
	}
	return Query(res);
}

void search(vi poses, int typ, int ind){ //typ == 0: first neighbor in set typ == 1: second neighbor in set typ == 2: both neighbors in set
	//ps(poses, typ, ind);
	if(sz(poses) == 0) return;
	if(sz(poses) == 1){
		//ps(ind, typ, poses[0]);
		neighb[ind][typ] = poses[0];
		return;
	}

	int M = (0+sz(poses)-1)/2;
	vi q;
	
	for(int i = 0; i <= M; i++){
		q.pb(poses[i]);
	}
	int num1 = query(q);
	q.pb(ind);
	int num2 = query(q);

	vi s1, s2;
	for(int i = 0; i <= M; i++){
		s1.pb(poses[i]);
	}
	for(int i = M+1; i < sz(poses); i++){
		s2.pb(poses[i]);
	}
	if(num1-1 == num2){
		search(s1, 2, ind);
	}
	else if(num1 == num2){
		if(typ == 2){
			search(s1, 0, ind);
			search(s2, 1, ind);
		}
		else{
			search(s1, typ, ind);
		}
	}
	else if(num1+1 == num2){
		search(s2, typ, ind);
	}
}

void Solve(int _N)
{
	N = _N;
	if(N == 1){
		Answer({1});
		return;
	}

	vi pans;

	for(int i = 1; i <= N; i++){
		vi poses;
		for(int j = 1; j <= N; j++){
			if(i == j) continue;
			poses.pb(j);
		}
		if(query(poses) == 1){
			pans.pb(i);
			break;
			//search(poses, 0, i);
		}
	}

	while(sz(pans) < N){
		vi cando(N+1, 1);
		for(auto u: pans){
			cando[u] = 0;
		}
		vi poses;
		for(int i = 1; i <= N; i++){
			if(cando[i] == 1){
				poses.pb(i);
			}
		}
		search(poses, 0, pans.bk);
		pans.pb(neighb[pans.bk][0]);
	}
	Answer(pans);
	/*vi ans(N, 0);
	int st;
	for(int i = 1; i <= N; i++){
		if(neighb[i][1] == 0){
			st = i;
			break;
		}
	}
	ans[0] = st; 
	for(int i = 0; i < N-1; i++){
		int poten = neighb[ans[i]][0];
		if(i > 0 && poten == ans[i-1]) poten = neighb[ans[i]][1];
		ans[i+1] = poten;
	}*/
	//ps(ans);
	//Answer(ans);
}

Compilation message

library.cpp: In function 'void setIn(std::__cxx11::string)':
library.cpp:127: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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
library.cpp: In function 'void setOut(std::__cxx11::string)':
library.cpp:128: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

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	384 KB	# of queries: 2387
2	Correct	52 ms	404 KB	# of queries: 2433
3	Correct	51 ms	384 KB	# of queries: 2638
4	Correct	44 ms	384 KB	# of queries: 2593
5	Correct	60 ms	384 KB	# of queries: 2504
6	Correct	36 ms	392 KB	# of queries: 2553
7	Correct	51 ms	384 KB	# of queries: 2568
8	Correct	48 ms	384 KB	# of queries: 2402
9	Correct	45 ms	384 KB	# of queries: 2512
10	Correct	39 ms	384 KB	# of queries: 1478
11	Correct	5 ms	256 KB	# of queries: 0
12	Correct	5 ms	256 KB	# of queries: 1
13	Correct	5 ms	256 KB	# of queries: 4
14	Correct	5 ms	256 KB	# of queries: 7
15	Correct	7 ms	384 KB	# of queries: 73
16	Correct	7 ms	384 KB	# of queries: 187

Subtask #2

81.0 / 81.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	51 ms	384 KB	# of queries: 2387
2	Correct	52 ms	404 KB	# of queries: 2433
3	Correct	51 ms	384 KB	# of queries: 2638
4	Correct	44 ms	384 KB	# of queries: 2593
5	Correct	60 ms	384 KB	# of queries: 2504
6	Correct	36 ms	392 KB	# of queries: 2553
7	Correct	51 ms	384 KB	# of queries: 2568
8	Correct	48 ms	384 KB	# of queries: 2402
9	Correct	45 ms	384 KB	# of queries: 2512
10	Correct	39 ms	384 KB	# of queries: 1478
11	Correct	5 ms	256 KB	# of queries: 0
12	Correct	5 ms	256 KB	# of queries: 1
13	Correct	5 ms	256 KB	# of queries: 4
14	Correct	5 ms	256 KB	# of queries: 7
15	Correct	7 ms	384 KB	# of queries: 73
16	Correct	7 ms	384 KB	# of queries: 187
17	Correct	617 ms	384 KB	# of queries: 18008
18	Correct	566 ms	392 KB	# of queries: 17231
19	Correct	501 ms	384 KB	# of queries: 17451
20	Correct	495 ms	384 KB	# of queries: 16277
21	Correct	426 ms	384 KB	# of queries: 15362
22	Correct	478 ms	384 KB	# of queries: 17617
23	Correct	550 ms	384 KB	# of queries: 17170
24	Correct	158 ms	388 KB	# of queries: 7885
25	Correct	467 ms	384 KB	# of queries: 17118
26	Correct	422 ms	384 KB	# of queries: 15989
27	Correct	201 ms	384 KB	# of queries: 7994
28	Correct	488 ms	384 KB	# of queries: 17935
29	Correct	573 ms	384 KB	# of queries: 17915
30	Correct	471 ms	384 KB	# of queries: 17935