oj.uz

Submission #116690

# Submission time Handle Problem Language Result Execution time Memory
116690 2019-06-13T14:58:02 Z claudy Library (JOI18_library) C++14
0 / 100
 535 ms 644 KB 
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# include "library.h"
//# define int ll
using namespace std;

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

int Query(const std::vector<int>& M);
void Answer(const std::vector<int>& res);

set<int>s;
vector<int>M;
int n;
vector<int>vec;
int k = 0;

void solve(int x,int par)
{
	if(x == -1) return;
	s.erase(x);
	vec.pb(x);
	int l = 0;
	int r = sz(s) - 1;
	while(l < r)
	{
		int mid = l + r >> 1;
		for(int i = 0;i < n;i++)
		{
			M[i] = 0;
		}
		M[par - 1] = 1;
		auto it = s.begin();
		for(int i = 0;i <= mid;i++)
		{
			M[*it - 1] = 1;
			it++;
		}
		int a = Query(M);
		M[x - 1] = 1;
		int b = Query(M);
		if(a != b) r = mid;
		else l = mid + 1;
	}
	if(l > r) {
		solve(-1,x);
		return ;
	}
	auto it = s.begin();
	for(int i = 0;i <= l;i++)
	{
		if(i == l) solve(*it,x);
		it++;
	}
}

void Solve(int N)
{
	n = N;
	M.resize(n);
	M[0] = 1;
	vector<int>adj;
	for(int i = 2;i <= n;i++)
	{
		M[i - 1] = 1;
		if(Query(M) == 1) adj.pb(i);
		M[i - 1] = 0;
	}
	for(int i = 2;i <= n;i++)
	{
		s.insert(i);
	}
	vec.pb(1);
	solve(adj[0],1);
	vector<int>ans;
	for(auto it : vec) ans.pb(it);
	vec.clear();
	if(sz(adj) > 1)
	{
		solve(adj[1],1);
		reverse(vec.begin(),vec.end());
		for(auto it : ans) vec.pb(it);
	}
	else Answer(ans);
}

Compilation message

library.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")
 
library.cpp: In function 'void solve(int, int)':
library.cpp:74:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 384 KB Wrong Answer [7]
2 Incorrect 32 ms 332 KB Wrong Answer [7]
3 Incorrect 37 ms 384 KB Wrong Answer [7]
4 Incorrect 35 ms 456 KB Wrong Answer [7]
5 Incorrect 33 ms 384 KB Wrong Answer [7]
6 Incorrect 36 ms 256 KB Wrong Answer [7]
7 Incorrect 46 ms 384 KB Wrong Answer [7]
8 Incorrect 43 ms 336 KB Wrong Answer [7]
9 Incorrect 33 ms 328 KB Wrong Answer [7]
10 Incorrect 18 ms 256 KB Wrong Answer [7]
11 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Correct 2 ms 256 KB # of queries: 1
13 Incorrect 2 ms 384 KB Wrong Answer [7]
14 Correct 2 ms 256 KB # of queries: 5
15 Correct 3 ms 384 KB # of queries: 78
16 Incorrect 6 ms 384 KB Wrong Answer [7]

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 384 KB Wrong Answer [7]
2 Incorrect 32 ms 332 KB Wrong Answer [7]
3 Incorrect 37 ms 384 KB Wrong Answer [7]
4 Incorrect 35 ms 456 KB Wrong Answer [7]
5 Incorrect 33 ms 384 KB Wrong Answer [7]
6 Incorrect 36 ms 256 KB Wrong Answer [7]
7 Incorrect 46 ms 384 KB Wrong Answer [7]
8 Incorrect 43 ms 336 KB Wrong Answer [7]
9 Incorrect 33 ms 328 KB Wrong Answer [7]
10 Incorrect 18 ms 256 KB Wrong Answer [7]
11 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Correct 2 ms 256 KB # of queries: 1
13 Incorrect 2 ms 384 KB Wrong Answer [7]
14 Correct 2 ms 256 KB # of queries: 5
15 Correct 3 ms 384 KB # of queries: 78
16 Incorrect 6 ms 384 KB Wrong Answer [7]
17 Incorrect 451 ms 548 KB Wrong Answer [7]
18 Incorrect 506 ms 412 KB Wrong Answer [7]
19 Incorrect 531 ms 508 KB Wrong Answer [7]
20 Incorrect 497 ms 504 KB Wrong Answer [7]
21 Incorrect 364 ms 644 KB Wrong Answer [7]
22 Incorrect 535 ms 452 KB Wrong Answer [7]
23 Incorrect 534 ms 384 KB Wrong Answer [7]
24 Incorrect 146 ms 488 KB Wrong Answer [7]
25 Incorrect 505 ms 428 KB Wrong Answer [7]
26 Incorrect 395 ms 532 KB Wrong Answer [7]
27 Incorrect 123 ms 380 KB Wrong Answer [7]
28 Correct 456 ms 532 KB # of queries: 18913
29 Correct 439 ms 512 KB # of queries: 18892
30 Correct 456 ms 496 KB # of queries: 18913