oj.uz

Submission #172499

# Submission time Handle Problem Language Result Execution time Memory
172499 2020-01-01T18:50:03 Z emil_physmath Xoractive (IZhO19_xoractive) C++17
41 / 100
 13 ms 632 KB 
#include <algorithm>
#include "interactive.h"
#include <vector>
#include <map>
#include <iostream>
using namespace std;
typedef long long llong;

int ans[101];
map<int, bool> isInQ;

inline vector<int> Range(int l, int r)
{
    vector<int> a;
    for (int i = l; i <= r; ++i)
        a.push_back(i);
    return a;
}
inline vector<int> LeftHalf(pair<int, int> range)
{
    return Range(range.first, (range.first + range.second) / 2);
}
void Get(vector<int> ind)
{
    // cerr << "get({";
    // for (int i: ind) cerr << i << ", ";
    // cerr << "})``````";
    isInQ.clear();
    if (ind.size() == 1)
    {
        isInQ[ask(ind[0])] = true;
        return;
    }
    auto it = find(ind.begin(), ind.end(), 1);
    if (it != ind.end())
        ind.erase(it);
    vector<int> a = get_pairwise_xor(ind);
    ind.push_back(1);
    vector<int> b = get_pairwise_xor(ind);
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> res;
    for (int i = (int)b.size() - 1; i >= 0; --i)
        if (!a.empty() && b[i] == a.back())
            a.pop_back();
        else if (b[i])
            isInQ[b[i] ^ ans[1]] = true;
    // for (auto x: isInQ)
        // cerr << x.first << ' ';
    // cerr << endl;
}
vector<int> guess(int n)
{
    ans[1] = ask(1);
    Get(Range(2, n));

    {
        int i = 2;
        for (auto x: isInQ)
            ans[i++] = x.first;
    }
    // cerr << "p\n";
    // for (int i = 1; i <= n; ++i)
        // cerr << ans[i] << ' ';
    // cerr << "p\n";
    vector<pair<int, int>> lr;
    if (2 != n) lr.push_back({2, n});
    while (lr.size())
    {
        vector<int> q;
        for (int i = 0; i < lr.size(); ++i)
            if (lr[i].second > lr[i].first + 1)
            {
                auto temp = LeftHalf(lr[i]);
                q.insert(q.end(), temp.begin(), temp.end());
            }
        if (q.size())
            Get(q);
        vector<pair<int, int>> newLr;
        for (int i = 0; i < lr.size(); ++i)
        {
            // cerr << "{" << lr[i].first << ", " << lr[i].second << "}, ";
            if (lr[i].first + 1 == lr[i].second)
            {
                if (ans[lr[i].first] != ask(lr[i].first))
                    swap(ans[lr[i].first], ans[lr[i].second]);
            }
            else
            {
                sort(ans + lr[i].first, ans + lr[i].second + 1, [](int a, int b) {
                    return isInQ[a] > isInQ[b];
                });
                int m = (lr[i].first + lr[i].second) / 2;
                if (lr[i].first != m) newLr.push_back({lr[i].first, m});
                if (m + 1 != lr[i].second) newLr.push_back({m + 1, lr[i].second});
            }
        }
        lr.swap(newLr);
    }
    return vector<int>(ans + 1, ans + n + 1);
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:71:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < lr.size(); ++i)
                         ~~^~~~~~~~~~~
Xoractive.cpp:80:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < lr.size(); ++i)
                         ~~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
35.0 / 94.0

# Verdict Execution time Memory Grader output
1 Partially correct 7 ms 504 KB Output is partially correct
2 Partially correct 6 ms 376 KB Output is partially correct
3 Partially correct 6 ms 376 KB Output is partially correct
4 Partially correct 7 ms 376 KB Output is partially correct
5 Partially correct 13 ms 504 KB Output is partially correct
6 Partially correct 7 ms 632 KB Output is partially correct
7 Partially correct 6 ms 504 KB Output is partially correct
8 Partially correct 6 ms 376 KB Output is partially correct
9 Partially correct 7 ms 376 KB Output is partially correct
10 Partially correct 7 ms 424 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 376 KB Output is partially correct
14 Partially correct 7 ms 376 KB Output is partially correct
15 Partially correct 6 ms 504 KB Output is partially correct
16 Partially correct 7 ms 376 KB Output is partially correct
17 Partially correct 7 ms 376 KB Output is partially correct
18 Partially correct 6 ms 376 KB Output is partially correct
19 Partially correct 6 ms 376 KB Output is partially correct
20 Partially correct 7 ms 508 KB Output is partially correct
21 Partially correct 7 ms 376 KB Output is partially correct
22 Partially correct 7 ms 504 KB Output is partially correct
23 Partially correct 6 ms 376 KB Output is partially correct
24 Partially correct 7 ms 504 KB Output is partially correct
25 Partially correct 6 ms 504 KB Output is partially correct
26 Partially correct 6 ms 376 KB Output is partially correct
27 Partially correct 6 ms 504 KB Output is partially correct
28 Partially correct 6 ms 504 KB Output is partially correct
29 Partially correct 7 ms 380 KB Output is partially correct
30 Partially correct 6 ms 376 KB Output is partially correct
31 Partially correct 6 ms 376 KB Output is partially correct
32 Partially correct 6 ms 376 KB Output is partially correct
33 Partially correct 6 ms 376 KB Output is partially correct
34 Partially correct 6 ms 376 KB Output is partially correct
35 Partially correct 6 ms 504 KB Output is partially correct
36 Partially correct 7 ms 508 KB Output is partially correct
37 Partially correct 6 ms 504 KB Output is partially correct
38 Partially correct 7 ms 376 KB Output is partially correct
39 Partially correct 6 ms 504 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 7 ms 504 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 376 KB Output is partially correct
50 Partially correct 6 ms 376 KB Output is partially correct
51 Partially correct 6 ms 504 KB Output is partially correct
52 Partially correct 6 ms 504 KB Output is partially correct
53 Partially correct 6 ms 376 KB Output is partially correct
54 Partially correct 7 ms 376 KB Output is partially correct
55 Partially correct 6 ms 504 KB Output is partially correct
56 Partially correct 7 ms 376 KB Output is partially correct
57 Partially correct 7 ms 504 KB Output is partially correct
58 Partially correct 6 ms 508 KB Output is partially correct
59 Partially correct 6 ms 504 KB Output is partially correct
60 Partially correct 7 ms 504 KB Output is partially correct
61 Partially correct 6 ms 504 KB Output is partially correct
62 Partially correct 7 ms 376 KB Output is partially correct
63 Partially correct 6 ms 504 KB Output is partially correct
64 Partially correct 6 ms 376 KB Output is partially correct
65 Partially correct 7 ms 376 KB Output is partially correct
66 Partially correct 6 ms 376 KB Output is partially correct
67 Partially correct 6 ms 376 KB Output is partially correct
68 Partially correct 6 ms 376 KB Output is partially correct
69 Partially correct 6 ms 376 KB Output is partially correct
70 Partially correct 7 ms 508 KB Output is partially correct
71 Partially correct 6 ms 376 KB Output is partially correct
72 Partially correct 6 ms 504 KB Output is partially correct
73 Partially correct 7 ms 504 KB Output is partially correct
74 Partially correct 6 ms 504 KB Output is partially correct
75 Partially correct 6 ms 376 KB Output is partially correct
76 Partially correct 7 ms 376 KB Output is partially correct
77 Partially correct 6 ms 468 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 7 ms 376 KB Output is partially correct
82 Partially correct 5 ms 504 KB Output is partially correct
83 Partially correct 6 ms 504 KB Output is partially correct
84 Partially correct 7 ms 376 KB Output is partially correct
85 Partially correct 7 ms 504 KB Output is partially correct
86 Partially correct 7 ms 376 KB Output is partially correct
87 Partially correct 6 ms 376 KB Output is partially correct
88 Partially correct 7 ms 424 KB Output is partially correct
89 Partially correct 6 ms 376 KB Output is partially correct
90 Partially correct 6 ms 424 KB Output is partially correct
91 Partially correct 6 ms 504 KB Output is partially correct
92 Partially correct 6 ms 504 KB Output is partially correct
93 Partially correct 7 ms 504 KB Output is partially correct
94 Partially correct 6 ms 376 KB Output is partially correct
95 Partially correct 6 ms 376 KB Output is partially correct
96 Partially correct 6 ms 380 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 7 ms 424 KB Output is partially correct