oj.uz

답안 #172045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172045 2019-12-30T21:28:03 Z davitmarg Xoractive (IZhO19_xoractive) C++17
90 / 100
 6 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;

    return res;
}

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

#endif

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

vector<int> get(vector<int> a)
{
    a.PB(n + 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);

    // for (int i = 0; i < b.size(); i++)
    //     cout << b[i] << " : ";
    // cout << endl;

    return b;
}

vector<int> guess(int N)
{
    n = N;
    x = ask(n);
    pos[n] = x;
    n--;
    bits[ask(1)] = 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 + 1; 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:79:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < b.size(); i++)
                     ~~^~~~~~~~~~
Xoractive.cpp:83: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:117:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < a.size(); i++)
                         ~~^~~~~~~~~~
Xoractive.cpp:119:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while (bits[a[i]].size() < k + 1)
                    ~~~~~~~~~~~~~~~~~~^~~~~~~
Xoractive.cpp:131: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

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

Subtask #2
84.0 / 94.0

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