oj.uz

답안 #229460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229460 2020-05-04T14:47:20 Z _7_7_ Xoractive (IZhO19_xoractive) C++14
90 / 100
 10 ms 640 KB 
#include "interactive.h"
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 111;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;




int G[10];
set < int > Q[10];
multiset < int > q;
unordered_map < int, int > was, d;

int Ask (int x) {
	if (was.count(x))
		return was[x];
	return was[x] = ask(x);
}



vi guess(int n) {
	int p = 1;				
	while (p*2 <= n)
		p *= 2;
	--p;
	
	for (int i = 0; i <= 6; ++i) {
		if ((1 << i) > n)
			break;
		int x = p;
		if (!(p & (1 << i))) { 
			for (int j = 1; j <= n; ++j)
				if (j & (1 << i))
					x = j;
		}

		int y = Ask(x); 
		vi cur, cur1;
		for (int j = 1; j <= n; ++j)
			if (j & (1 << i)) {
				cur.pb(j); 
				if (j != x)
					cur1.pb(j);
			}
		
		if (sz(cur) == 1) {
			Q[i].insert(y);
			break;
		}

		q.clear();				
		cur = get_pairwise_xor(cur);
		cur1 = get_pairwise_xor(cur1);
				

		for (auto j : cur)
			q.insert(j);

		for (auto j : cur1)
			q.erase(q.find(j));

		for (auto j : q)
			Q[i].insert(j ^ y);		
	}

/*	for (int i = 0; i < 7; ++i) {
		for (auto j : Q[i]) 
			cerr << j << ' ';
		cerr << "hello\n";
		cerr << endl;	
	}*/

	vi res;
	res.resize(n);	
	
	set < int > QQ;
	for (int i = 0; i < 7; ++i)
		for (auto j : Q[i])
			QQ.insert(j);

	for (auto i : QQ) {
		int jj = 0;
		for (int j = 0; j < 7; ++j) {			
			if (Q[j].count(i))
				jj |= (1 << j);
		} 
		res[jj - 1] = i;
	}

	
	return res;		
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct

Subtask #2
84.0 / 94.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 8 ms 512 KB Output is partially correct
2 Partially correct 9 ms 512 KB Output is partially correct
3 Partially correct 8 ms 512 KB Output is partially correct
4 Partially correct 8 ms 512 KB Output is partially correct
5 Partially correct 9 ms 512 KB Output is partially correct
6 Partially correct 8 ms 512 KB Output is partially correct
7 Partially correct 9 ms 512 KB Output is partially correct
8 Partially correct 10 ms 512 KB Output is partially correct
9 Partially correct 8 ms 512 KB Output is partially correct
10 Partially correct 9 ms 512 KB Output is partially correct
11 Partially correct 8 ms 512 KB Output is partially correct
12 Partially correct 8 ms 512 KB Output is partially correct
13 Partially correct 8 ms 512 KB Output is partially correct
14 Partially correct 8 ms 512 KB Output is partially correct
15 Partially correct 8 ms 512 KB Output is partially correct
16 Partially correct 9 ms 512 KB Output is partially correct
17 Partially correct 9 ms 512 KB Output is partially correct
18 Partially correct 8 ms 512 KB Output is partially correct
19 Partially correct 8 ms 512 KB Output is partially correct
20 Partially correct 9 ms 512 KB Output is partially correct
21 Partially correct 9 ms 512 KB Output is partially correct
22 Partially correct 9 ms 512 KB Output is partially correct
23 Partially correct 10 ms 512 KB Output is partially correct
24 Partially correct 9 ms 512 KB Output is partially correct
25 Partially correct 8 ms 512 KB Output is partially correct
26 Partially correct 8 ms 512 KB Output is partially correct
27 Partially correct 8 ms 512 KB Output is partially correct
28 Partially correct 9 ms 512 KB Output is partially correct
29 Partially correct 9 ms 512 KB Output is partially correct
30 Partially correct 8 ms 512 KB Output is partially correct
31 Partially correct 8 ms 512 KB Output is partially correct
32 Partially correct 8 ms 512 KB Output is partially correct
33 Partially correct 9 ms 512 KB Output is partially correct
34 Partially correct 9 ms 512 KB Output is partially correct
35 Partially correct 9 ms 512 KB Output is partially correct
36 Partially correct 9 ms 512 KB Output is partially correct
37 Partially correct 8 ms 512 KB Output is partially correct
38 Partially correct 9 ms 512 KB Output is partially correct
39 Partially correct 10 ms 512 KB Output is partially correct
40 Partially correct 9 ms 512 KB Output is partially correct
41 Partially correct 8 ms 384 KB Output is partially correct
42 Partially correct 9 ms 512 KB Output is partially correct
43 Partially correct 8 ms 512 KB Output is partially correct
44 Partially correct 8 ms 512 KB Output is partially correct
45 Partially correct 9 ms 512 KB Output is partially correct
46 Partially correct 9 ms 512 KB Output is partially correct
47 Partially correct 9 ms 512 KB Output is partially correct
48 Partially correct 8 ms 512 KB Output is partially correct
49 Partially correct 9 ms 512 KB Output is partially correct
50 Partially correct 9 ms 512 KB Output is partially correct
51 Partially correct 9 ms 512 KB Output is partially correct
52 Partially correct 9 ms 512 KB Output is partially correct
53 Partially correct 9 ms 512 KB Output is partially correct
54 Partially correct 9 ms 512 KB Output is partially correct
55 Partially correct 8 ms 512 KB Output is partially correct
56 Partially correct 9 ms 512 KB Output is partially correct
57 Partially correct 10 ms 512 KB Output is partially correct
58 Partially correct 9 ms 512 KB Output is partially correct
59 Partially correct 9 ms 512 KB Output is partially correct
60 Partially correct 9 ms 512 KB Output is partially correct
61 Partially correct 9 ms 512 KB Output is partially correct
62 Partially correct 9 ms 512 KB Output is partially correct
63 Partially correct 8 ms 512 KB Output is partially correct
64 Partially correct 8 ms 512 KB Output is partially correct
65 Partially correct 9 ms 512 KB Output is partially correct
66 Partially correct 8 ms 512 KB Output is partially correct
67 Partially correct 8 ms 512 KB Output is partially correct
68 Partially correct 9 ms 512 KB Output is partially correct
69 Partially correct 9 ms 512 KB Output is partially correct
70 Partially correct 9 ms 512 KB Output is partially correct
71 Partially correct 8 ms 512 KB Output is partially correct
72 Partially correct 9 ms 512 KB Output is partially correct
73 Partially correct 9 ms 512 KB Output is partially correct
74 Partially correct 8 ms 512 KB Output is partially correct
75 Partially correct 9 ms 512 KB Output is partially correct
76 Partially correct 9 ms 512 KB Output is partially correct
77 Partially correct 9 ms 512 KB Output is partially correct
78 Partially correct 10 ms 512 KB Output is partially correct
79 Partially correct 8 ms 512 KB Output is partially correct
80 Partially correct 9 ms 512 KB Output is partially correct
81 Partially correct 9 ms 512 KB Output is partially correct
82 Partially correct 8 ms 512 KB Output is partially correct
83 Partially correct 8 ms 512 KB Output is partially correct
84 Partially correct 10 ms 512 KB Output is partially correct
85 Partially correct 9 ms 512 KB Output is partially correct
86 Partially correct 9 ms 512 KB Output is partially correct
87 Partially correct 9 ms 512 KB Output is partially correct
88 Partially correct 9 ms 512 KB Output is partially correct
89 Partially correct 9 ms 512 KB Output is partially correct
90 Partially correct 8 ms 512 KB Output is partially correct
91 Partially correct 8 ms 512 KB Output is partially correct
92 Partially correct 9 ms 512 KB Output is partially correct
93 Partially correct 9 ms 512 KB Output is partially correct
94 Partially correct 9 ms 512 KB Output is partially correct
95 Partially correct 8 ms 512 KB Output is partially correct
96 Partially correct 9 ms 640 KB Output is partially correct
97 Partially correct 9 ms 512 KB Output is partially correct
98 Partially correct 9 ms 512 KB Output is partially correct
99 Partially correct 9 ms 520 KB Output is partially correct
100 Partially correct 9 ms 512 KB Output is partially correct