oj.uz

답안 #207760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207760 2020-03-08T20:53:01 Z bash Xoractive (IZhO19_xoractive) C++17
100 / 100
 12 ms 664 KB 
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include "interactive.h"
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}


set <int> num[8];
map<int,int> pos;
                  
multiset<int> query(vector<int> v){
	vector<int> v2 = get_pairwise_xor(v);
	multiset<int> res(v2.begin(), v2.end());
	return res;
}

vector<int> guess(int n) {
	if (n <= 15) {
		vector<int> ans;
		for (int i = 1; i<= n; i++) {
			ans.pb(ask(i));
		}
		return ans;
	} 
	int first_element = ask(1);
	num[0].insert(first_element);
	for (int i = 0; i < 7; i++) {
		vector<int> v;
		for (int j = 2; j <= n; j++) {
			if ((j >> i) & 1) {
				v.pb(j);
			}
		}
		multiset<int>m1 = query(v);
    	v.pb(1);
    	multiset<int>m2 = query(v);
    	m2.erase(m2.find(0));
    	for(int val : m1) {
    		m2.erase(m2.find(val));
    	}
    	for(int val : m2){
      		num[i].insert((first_element ^ val));
    	}
	}
	for (int i = 0; i < 7; i++) {
		for (int j : num[i]) {
			pos[j] |= (1 << i);
		}
	}	
	vector<pair<int,int> > res;
	for (auto i : pos) {
		res.pb({i.S, i.F});	
	}
	sort(res.begin(), res.end());
	vector<int> ans;
	for (auto i : res) {
		ans.pb(i.S);
	}
	return ans;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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