답안 #171066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171066	2019-12-27T09:45:18 Z	SamAnd	Xoractive (IZhO19_xoractive)	C++17	88 / 100	9 ms	552 KB

Xoractive

#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 102;

int ans[N];

vector<int> gget_pairwise_xor(vector<int> v)
{
    if (v.empty())
        return v;
    vector<int> res = get_pairwise_xor(v);
    reverse(res.begin(), res.end());
    for (int i = 0; i < v.size(); ++i)
        res.pop_back();
    reverse(res.begin(), res.end());
    vector<int> yres;
    for (int i = 0; i < res.size(); i += 2)
        yres.push_back(res[i]);
    return yres;
}

vector<int> han(vector<int> a, vector<int> b)
{
    vector<int> res;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int j = 0;
    for (int i = 0; i < a.size(); ++i)
    {
        if (j < b.size() && a[i] == b[j])
        {
            ++j;
            continue;
        }
        res.push_back(a[i]);
    }
    return res;
}
vector<int> hat(vector<int> a, vector<int> b)
{
    vector<int> res;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int i = 0, j = 0;
    while (1)
    {
        if (i == a.size() || j == b.size())
            return res;
        if (a[i] == b[j])
        {
            res.push_back(a[i]);
            ++i;
            ++j;
            continue;
        }
        if (a[i] < b[j])
            ++i;
        else
            ++j;
    }
}

vector<int> v[8];

vector<int> t;
vector<int> v1, v2;
vector<int> guess(int n)
{
    ans[1] = ask(1);
    for (int i = 0; i < 7; ++i)
    {
        t.clear();
        t.push_back(1);
        for (int x = 2; x <= n; ++x)
        {
            if ((x & (1 << i)))
                t.push_back(x);
        }
        v1 = gget_pairwise_xor(t);
        t.clear();
        for (int x = 2; x <= n; ++x)
        {
            if ((x & (1 << i)))
                t.push_back(x);
        }
        v2 = gget_pairwise_xor(t);
        v[i] = han(v1, v2);
        for (int j = 0; j < v[i].size(); ++j)
            v[i][j] ^= ans[1];
    }
    t.clear();
    t.push_back(1);
    for (int x = 2; x <= n; ++x)
    {
        t.push_back(x);
    }
    v1 = gget_pairwise_xor(t);
    t.clear();
    for (int x = 2; x <= n; ++x)
    {
        t.push_back(x);
    }
    v2 = gget_pairwise_xor(t);
    v[7] = han(v1, v2);
    for (int j = 0; j < v[7].size(); ++j)
        v[7][j] ^= ans[1];
    for (int x = 2; x <= n; ++x)
    {
        t.clear();
        t = v[7];
        for (int i = 0; i < 7; ++i)
        {
            if ((x & (1 << i)))
                t = hat(t, v[i]);
            else
                t = hat(t, han(v[7], v[i]));
        }
        ans[x] = t[0];
    }
    ///////////////////////////9//////////////////////
    vector<int> vans;
    for (int i = 1; i <= n; ++i)
        vans.push_back(ans[i]);
	return vans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> gget_pairwise_xor(std::vector<int>)':
Xoractive.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); ++i)
                     ~~^~~~~~~~~~
Xoractive.cpp:18:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < res.size(); i += 2)
                     ~~^~~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> han(std::vector<int>, std::vector<int>)':
Xoractive.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
Xoractive.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (j < b.size() && a[i] == b[j])
             ~~^~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> hat(std::vector<int>, std::vector<int>)':
Xoractive.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i == a.size() || j == b.size())
             ~~^~~~~~~~~~~
Xoractive.cpp:48:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i == a.size() || j == b.size())
                              ~~^~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:89:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < v[i].size(); ++j)
                         ~~^~~~~~~~~~~~~
Xoractive.cpp:106:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < v[7].size(); ++j)
                     ~~^~~~~~~~~~~~~
Xoractive.cpp:123:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 1; i <= n; ++i)
     ^~~
Xoractive.cpp:125:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return vans;
  ^~~~~~

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 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	376 KB	Output is correct

Subtask #2

82.0 / 94.0

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