답안 #619264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619264 2022-08-02T10:49:52 Z juancarlovieri Xoractive (IZhO19_xoractive) C++17
100 / 100
6 ms 464 KB
#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;

int uniq(vector<int> a, vector<int> b) {
	sort(b.begin(), b.end());
	for (auto i : a) {
		if (i == 0) continue;
		if (find(b.begin(), b.end(), i) != b.end()) return i;
	}
	assert(0);
}

vector<int> guess(int n) {
  vector<int> ans(n);
  ans[0] = ask(1);
  map<int, int> tmpans;
  for (int i = 0; i <= 7; ++i) {
    vector<int> tmp;
    for (int j = 2; j <= n; ++j) {
      if (j & (1 << i)) tmp.push_back(j);
    }
    if (tmp.empty()) break;

    tmp.push_back(1);
    // for (auto i : tmp) cout << i << ' ';
      // cout << endl;
    vector<int> res = get_pairwise_xor(tmp);
    multiset<int> all;
    for (auto i : res) all.insert(i);
      tmp.pop_back();
    res = get_pairwise_xor(tmp);
    for (auto i : res) all.erase(all.find(i));

    for (auto j : all) {
      if (j == 0) continue;
      tmpans[j ^ ans[0]]  |= (1 << i);
    }
  }

  for (auto i : tmpans) {
    ans[i.second - 1] = i.first;
  }
  // for (auto i : ans) cout << i << ' ';
  //   cout << endl;
  // int m = 15;
  // vector<bitset<100>> bm(m);
  // vector<pair<int, int>> ambil(n);
  // for (int i = 0; i < n - 1; ++i) {
  //   bool ada = 0;
  //   for (int j = 0; j < m; ++j) {
  //     for (int k = j + 1; k < m; ++k) {
  //       if ((bm[j] & bm[k]).count()) continue;
  //       ada = 1;
  //       ambil[i] = {j, k};
  //       bm[j].set(i);
  //       bm[k].set(i);
  //       break;
  //       // bm[j] |= (1 << i);
  //       // bm[k] |= (1 << i);
  //     }
  //     if (ada) break;
  //   }
  //   assert(ada);
  // }

  // for (int i = 0; i < n - 1; ++i) {

  // }

  // vector<vector<int>> res(m);
  // for (int i = 0; i < m; ++i) {
  // 	vector<int> tmp;
  // 	for (int j = 0; j < n; ++j) {
  // 		if (bm[i][j]) tmp.push_back(j + 1);
  // 	}
  // 	sort(tmp.begin(), tmp.end());
  // 	tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
  // 	// for (auto i : tmp) cout << i << ' ';
  // 	// 	cout << endl;
  // 	res[i] = get_pairwise_xor(tmp);
  // 	// for (auto j : res[i]) cout << j << ' ';
  // 	// cout << endl;
  // }

  // vector<int> ans(n);
  // ans[0] = ask(1);
  // for (int i = 0; i < n; ++i) {
  // 	// cout << ambil[i].first << ' ' << ambil[i].second << endl;
  // 	int tmp = uniq(res[ambil[i].first], res[ambil[i].second]);
  // 	// cout << tmp << endl;
  // 	ans[i + 1] = ans[i] ^ tmp;
  // }
  return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 336 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 4 ms 336 KB Output is correct
4 Correct 5 ms 464 KB Output is correct
5 Correct 5 ms 464 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 464 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 4 ms 464 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 4 ms 464 KB Output is correct
15 Correct 3 ms 464 KB Output is correct
16 Correct 4 ms 336 KB Output is correct
17 Correct 4 ms 464 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 4 ms 336 KB Output is correct
20 Correct 4 ms 336 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 4 ms 336 KB Output is correct
23 Correct 4 ms 464 KB Output is correct
24 Correct 4 ms 336 KB Output is correct
25 Correct 4 ms 336 KB Output is correct
26 Correct 4 ms 456 KB Output is correct
27 Correct 4 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 4 ms 464 KB Output is correct
31 Correct 4 ms 464 KB Output is correct
32 Correct 4 ms 464 KB Output is correct
33 Correct 5 ms 464 KB Output is correct
34 Correct 4 ms 452 KB Output is correct
35 Correct 4 ms 464 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 4 ms 464 KB Output is correct
38 Correct 4 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 4 ms 464 KB Output is correct
41 Correct 4 ms 336 KB Output is correct
42 Correct 4 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 4 ms 336 KB Output is correct
45 Correct 4 ms 336 KB Output is correct
46 Correct 5 ms 464 KB Output is correct
47 Correct 4 ms 336 KB Output is correct
48 Correct 4 ms 464 KB Output is correct
49 Correct 4 ms 336 KB Output is correct
50 Correct 4 ms 336 KB Output is correct
51 Correct 4 ms 460 KB Output is correct
52 Correct 4 ms 464 KB Output is correct
53 Correct 4 ms 336 KB Output is correct
54 Correct 4 ms 464 KB Output is correct
55 Correct 4 ms 336 KB Output is correct
56 Correct 4 ms 336 KB Output is correct
57 Correct 4 ms 464 KB Output is correct
58 Correct 5 ms 336 KB Output is correct
59 Correct 4 ms 336 KB Output is correct
60 Correct 4 ms 336 KB Output is correct
61 Correct 4 ms 464 KB Output is correct
62 Correct 4 ms 336 KB Output is correct
63 Correct 4 ms 336 KB Output is correct
64 Correct 4 ms 464 KB Output is correct
65 Correct 4 ms 348 KB Output is correct
66 Correct 4 ms 452 KB Output is correct
67 Correct 4 ms 336 KB Output is correct
68 Correct 3 ms 464 KB Output is correct
69 Correct 5 ms 336 KB Output is correct
70 Correct 4 ms 336 KB Output is correct
71 Correct 3 ms 464 KB Output is correct
72 Correct 4 ms 336 KB Output is correct
73 Correct 4 ms 464 KB Output is correct
74 Correct 6 ms 336 KB Output is correct
75 Correct 4 ms 464 KB Output is correct
76 Correct 4 ms 460 KB Output is correct
77 Correct 4 ms 336 KB Output is correct
78 Correct 4 ms 336 KB Output is correct
79 Correct 4 ms 336 KB Output is correct
80 Correct 4 ms 456 KB Output is correct
81 Correct 4 ms 464 KB Output is correct
82 Correct 5 ms 336 KB Output is correct
83 Correct 4 ms 336 KB Output is correct
84 Correct 4 ms 336 KB Output is correct
85 Correct 5 ms 452 KB Output is correct
86 Correct 4 ms 464 KB Output is correct
87 Correct 4 ms 464 KB Output is correct
88 Correct 4 ms 464 KB Output is correct
89 Correct 4 ms 464 KB Output is correct
90 Correct 4 ms 336 KB Output is correct
91 Correct 4 ms 404 KB Output is correct
92 Correct 4 ms 336 KB Output is correct
93 Correct 4 ms 464 KB Output is correct
94 Correct 4 ms 336 KB Output is correct
95 Correct 4 ms 336 KB Output is correct
96 Correct 4 ms 452 KB Output is correct
97 Correct 5 ms 336 KB Output is correct
98 Correct 4 ms 336 KB Output is correct
99 Correct 5 ms 464 KB Output is correct
100 Correct 4 ms 464 KB Output is correct