oj.uz

답안 #527858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527858 2022-02-18T14:02:42 Z definitelynotmee Xoractive (IZhO19_xoractive) C++17
100 / 100
 3 ms 344 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;
//#include "interactive.h"


int ask(int i);
vector<int> get_pairwise_xor(vector<int> q);
vector<int> guess(int n) {

        int last = ask(n);

        auto getset =[&](vector<int> q)->vector<int>{
          q.push_back(n);
          vector<int> tot = get_pairwise_xor(q);
          q.pop_back();
          vector<int> totminus = get_pairwise_xor(q);

          vector<int> v(q.size());

          int p1 = 0, p2 = 0;
          int ptr = 0;
          while(p1 < tot.size()){
            if(p2 == totminus.size() || totminus[p2] != tot[p1]){
              if(tot[p1] != 0){
                v[ptr] = tot[p1]^last;
                ptr++;
                p1++;
              }

            } else  p2++;
            p1++;
          }

          assert(ptr == q.size());
          return v;
        };

        vector<int> q(n-1);
        iota(all(q),1);

        q.push_back(n);
        matrix<int> group = {q};
        map<int,int> m;
        int timer = 20;
        while(group.size() < n){
          matrix<int> newgroup;
          vector<int> q;
          for(vector<int>& i : group){
            vector<int> g1, g2;
            for(int j = 0; j < i.size()/2; j++)
              q.push_back(i[j]), g1.push_back(i[j]);
            for(int j = i.size()/2; j < i.size(); j++)
              g2.push_back(i[j]);
            if(g1.size())
            newgroup.push_back(g1);
            if(g2.size())
              newgroup.push_back(g2);
          }
          vector<int> r = getset(q);
          for(int i : r)
            m[i] |= (1<<timer);

          swap(group,newgroup);
          timer--;
        }
        vector<int> resp;
        for(pii i : m)
          resp.push_back(i.ff);
        resp.push_back(last);
        sort(all(resp),[&](int a, int b){
          return m[a] > m[b];
        });

        return resp;

}

Compilation message

Xoractive.cpp: In lambda function:
Xoractive.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |           while(p1 < tot.size()){
      |                 ~~~^~~~~~~~~~~~
Xoractive.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             if(p2 == totminus.size() || totminus[p2] != tot[p1]){
      |                ~~~^~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Xoractive.cpp:1:
Xoractive.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |           assert(ptr == q.size());
      |                  ~~~~^~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:63:28: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |         while(group.size() < n){
      |               ~~~~~~~~~~~~~^~~
Xoractive.cpp:68:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j = 0; j < i.size()/2; j++)
      |                            ~~^~~~~~~~~~~~
Xoractive.cpp:70:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for(int j = i.size()/2; j < i.size(); j++)
      |                                     ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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