제출 #370492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370492		casperwang	Xoractive (IZhO19_xoractive)	C++14	6 / 100	12 ms	716 KiB

Xoractive

#include "interactive.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

vector<int> guess(int n) {
	vector <int> G;
  vector <int> ans(n);
  if (n <= 1) {
    for (int i = 1; i <= n; i++)
      ans[i-1] = ask(i);
    return ans;
  }

  for (int i = 2; i <= n; i++)
    G.pb(i);
  vector <int> exp = get_pairwise_xor(G);
  G.pb(1);
  vector <int> all = get_pairwise_xor(G);

  set <int> nums;
  vector <int> arr, pos(n);
  ans[0] = ask(1);
  int j = 0;
  for (int i = 0; i < exp.size(); i++, j++)
    while (all[j] != exp[i])
      nums.insert(all[j++] ^ ans[0]);
  while (j < all.size()) nums.insert(all[j++] ^ ans[0]);
  for (int i : nums) arr.pb(i);
  srand(time(NULL));
  random_shuffle(arr.begin(), arr.end());

  for (int i = 0; (1<<i) < n; i++) {
    G.clear();
    for (int j = 0; j < n; j++)
      if (!(j&(1<<i))) G.pb(j+1);
    pary(G.begin(), G.end());
    vector <int> res = get_pairwise_xor(G);
    vector <int> tmp, nxt;
    for (int j = 0; j < n; j++) tmp.pb(j);
    while (tmp.size() > G.size()) {
      for (int j : tmp) {
        int cnt = 0;
        for (int k : tmp) {
          int val = arr[j] ^ arr[k];
          if (res[res.size()-1] >= val && *lower_bound(res.begin(), res.end(), val) == val)
            cnt++;
        }
        if (cnt >= G.size()) nxt.pb(j);
      }
      if (tmp.size() == nxt.size()) break;
      tmp = nxt;
      nxt.clear();
    }
    vector <int> rand(tmp.size());
    for (int j = 0; j < tmp.size(); j++)
      rand[j] = j;
    while (tmp.size() > G.size()) {
      random_shuffle(rand.begin(), rand.end());
      bool flag = true, tf = false;
      for (int j = 0; j < G.size() && flag; j++) {
        if (arr[tmp[rand[j]]] == ans[0]) tf = true;
        int cnt = 0;
        for (int k = 0; k < G.size(); k++) {
          int val = arr[tmp[rand[j]]] ^ arr[tmp[rand[k]]];
          if (res[res.size()-1] >= val && *lower_bound(res.begin(), res.end(), val) == val)
            cnt++;
        }
        if (cnt < G.size()) flag = false;
      }
      flag &= tf;
      if (flag) {
        tmp.clear();
        for (int j = 0; j < G.size(); j++)
          tmp.pb(rand[j]);
        break;
      }
    }
    for (int j = 0; j < n; j++) pos[j] += (1<<i);
    for (int j : tmp) pos[j] -= (1<<i);
  }
  for (int i = 0; i < n; i++)
    ans[pos[i]] = arr[i];
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:29:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for (int i = 0; i < exp.size(); i++, j++)
      |                   ~~^~~~~~~~~~~~
Xoractive.cpp:32:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   while (j < all.size()) nums.insert(all[j++] ^ ans[0]);
      |          ~~^~~~~~~~~~~~
Xoractive.cpp:53:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         if (cnt >= G.size()) nxt.pb(j);
      |             ~~~~^~~~~~~~~~~
Xoractive.cpp:60:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (int j = 0; j < tmp.size(); j++)
      |                     ~~^~~~~~~~~~~~
Xoractive.cpp:65:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |       for (int j = 0; j < G.size() && flag; j++) {
      |                       ~~^~~~~~~~~~
Xoractive.cpp:68:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for (int k = 0; k < G.size(); k++) {
      |                         ~~^~~~~~~~~~
Xoractive.cpp:73:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         if (cnt < G.size()) flag = false;
      |             ~~~~^~~~~~~~~~
Xoractive.cpp:78:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for (int j = 0; j < G.size(); j++)
      |                         ~~^~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 0 / 94