oj.uz

Submission #172047

# Submission time Handle Problem Language Result Execution time Memory
172047 2019-12-30T22:07:18 Z davitmarg Xoractive (IZhO19_xoractive) C++17
100 / 100
 7 ms 632 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 105;

#ifndef death
#include "interactive.h";
#endif

#ifdef death

int nn, aa[102], Q;

vector<int> get_pairwise_xor(vector<int> pos)
{
    Q++;
    vector<int> res;

    cout << "? ";
    for (int i = 0; i < pos.size(); i++)
        cout << pos[i] << " ";
    cout << endl;

    for (int i = 0; i < pos.size(); i++)
        for (int j = 0; j < pos.size(); j++)
            res.PB(aa[pos[i]] ^ aa[pos[j]]);
    sort(all(res));

    cout << "| ";
    for (int i = 0; i < res.size(); i++)
        cout << res[i] << " ";
    cout << endl;
    cout << endl;

    return res;
}

int ask(int pos)
{
    Q++;
    cout << "? " << pos << endl;
    cout << "| " << aa[pos] << endl;
    cout << endl;
    return aa[pos];
}

#endif

int x, n, pos[N], val[N];
map<int, vector<int>> bits;

vector<int> get(vector<int> a)
{
    sort(all(a));
    reverse(all(a));
    bool wasin = 0;
    if (a.back() != 1)
        a.PB(1);
    else
        wasin = 1;

    vector<int> b = get_pairwise_xor(a);
    a.pop_back();

    multiset<int> s;
    for (int i = 0; i < b.size(); i++)
        s.insert(b[i]);
    b = get_pairwise_xor(a);
    s.erase(s.find(0));
    for (int i = 0; i < b.size(); i++)
        s.erase(s.find(b[i]));
    set<int> S;
    for (auto it = s.begin(); it != s.end(); ++it)
        S.insert((*it));
    b.clear();

    for (auto it = S.begin(); it != S.end(); ++it)
        b.PB((*it) ^ x);
    if (wasin)
        b.PB(1);
    // for (int i = 0; i < b.size(); i++)
    //     cout << b[i] << " : ";
    // cout << endl;
    return b;
}

vector<int> guess(int N)
{
    n = N;
    x = ask(1);
    bits[x] = vector<int>(0);
    int p = 0;
    for (int k = 0; (1 << k) < n; k++)
    {
        p++;
        vector<int> a;
        for (int i = 0; i < n; i++)
            if (((1 << k) & i) != 0)
                a.PB(i + 1);

        a = get(a);
        for (int i = 0; i < a.size(); i++)
        {
            while (bits[a[i]].size() < k + 1)
                bits[a[i]].PB(0);
            bits[a[i]].back() = 1;
        }
    }
    //cout << p << "!!!!!!!!!!!!!!!" << Q << endl;
    for (auto it = bits.begin(); it != bits.end(); ++it)
    {
        int val = it->first;
        int p = 0;
        vector<int> a = bits[val];
        //reverse(all(a));
        for (int j = 0; j < a.size(); j++)
            p += (1 << j) * a[j];
        pos[p + 1] = val;
    }
    vector<int> ans;
    for (int i = 1; i <= n; i++)
        ans.PB(pos[i]);
    return ans;
}

#ifdef death

int main()
{
    cin >> nn;
    for (int i = 1; i <= nn; i++)
        aa[i] = i;
    vector<int> res = guess(nn);
    cout << "! " << Q << endl;
    for (int i = 0; i < res.size(); i++)
        cout << res[i] << " ";
    cout << endl;
    return 0;
}

#endif

/*
 
 
 
*/

Compilation message

Xoractive.cpp:29:25: warning: extra tokens at end of #include directive
 #include "interactive.h";
                         ^
Xoractive.cpp: In function 'std::vector<int> get(std::vector<int>)':
Xoractive.cpp:88:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < b.size(); i++)
                     ~~^~~~~~~~~~
Xoractive.cpp:92:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < b.size(); i++)
                     ~~^~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:124:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a.size(); i++)
                         ~~^~~~~~~~~~
Xoractive.cpp:126:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while (bits[a[i]].size() < k + 1)
                    ~~~~~~~~~~~~~~~~~~^~~~~~~
Xoractive.cpp:138:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < a.size(); j++)
                         ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 128 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct

Subtask #2
94.0 / 94.0

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