oj.uz

답안 #486040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486040 2021-11-10T12:15:46 Z Ronin13 Xoractive (IZhO19_xoractive) C++14
100 / 100
 8 ms 584 KB 
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#include "interactive.h"
using namespace std;

vector<int> guess(int n) {
	vector <int> ans(n);
	ans[n-1]=ask(n);
	set<int>st[7];
	for(int pos=0;pos<=6;pos++){
        vector<int>a;
        for(int j=0;j<n-1;j++){
            if(j&(1<<pos))continue;
            else a.pb(j+1);
        }
        int len=a.size();
        vector<int>vec=get_pairwise_xor(a);
        multiset<int>x,y;
        for(int j=len;j<vec.size();j+=2)x.insert(vec[j]);
        a.pb(n);
        vector<int>vec1=get_pairwise_xor(a);
        for(int j=len+1;j<vec1.size();j+=2)y.insert(vec1[j]);
        for(int to:x){
            y.erase(y.find(to));
        }
        for(int to:y){
            st[pos].insert(to^ans[n-1]);
        }
	}
	for(int i=0;i<n-1;i++){
        vector<int>vec;
        for(int j=0;j<=6;j++){
            if(i&(1<<j))continue;
            vec.pb(j);
        }
        for(int to:st[vec[0]]){
            bool indic=true;
            for(int j=1;j<vec.size();j++){
                int ind=vec[j];
                if(st[ind].find(to)==st[ind].end()){
                    indic=false;
                    break;
                }
            }
            if(indic){
                ans[i]=to;
                for(int j=0;j<vec.size();j++){
                    int ind=vec[j];
                    st[ind].erase(st[ind].find(ans[i]));
                }
                break;
            }
        }
	}
	return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:21:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |         for(int j=len;j<vec.size();j+=2)x.insert(vec[j]);
      |                       ~^~~~~~~~~~~
Xoractive.cpp:24:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for(int j=len+1;j<vec1.size();j+=2)y.insert(vec1[j]);
      |                         ~^~~~~~~~~~~~
Xoractive.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for(int j=1;j<vec.size();j++){
      |                         ~^~~~~~~~~~~
Xoractive.cpp:49:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 for(int j=0;j<vec.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 7 ms 456 KB Output is correct
2 Correct 5 ms 456 KB Output is correct
3 Correct 5 ms 456 KB Output is correct
4 Correct 6 ms 456 KB Output is correct
5 Correct 6 ms 456 KB Output is correct
6 Correct 6 ms 456 KB Output is correct
7 Correct 5 ms 456 KB Output is correct
8 Correct 5 ms 448 KB Output is correct
9 Correct 6 ms 456 KB Output is correct
10 Correct 7 ms 456 KB Output is correct
11 Correct 5 ms 456 KB Output is correct
12 Correct 5 ms 456 KB Output is correct
13 Correct 6 ms 456 KB Output is correct
14 Correct 5 ms 456 KB Output is correct
15 Correct 7 ms 440 KB Output is correct
16 Correct 7 ms 456 KB Output is correct
17 Correct 6 ms 456 KB Output is correct
18 Correct 6 ms 432 KB Output is correct
19 Correct 7 ms 456 KB Output is correct
20 Correct 7 ms 456 KB Output is correct
21 Correct 7 ms 456 KB Output is correct
22 Correct 6 ms 444 KB Output is correct
23 Correct 5 ms 456 KB Output is correct
24 Correct 7 ms 480 KB Output is correct
25 Correct 5 ms 456 KB Output is correct
26 Correct 5 ms 428 KB Output is correct
27 Correct 6 ms 456 KB Output is correct
28 Correct 6 ms 456 KB Output is correct
29 Correct 6 ms 456 KB Output is correct
30 Correct 6 ms 456 KB Output is correct
31 Correct 7 ms 456 KB Output is correct
32 Correct 6 ms 456 KB Output is correct
33 Correct 6 ms 456 KB Output is correct
34 Correct 6 ms 456 KB Output is correct
35 Correct 6 ms 456 KB Output is correct
36 Correct 6 ms 456 KB Output is correct
37 Correct 6 ms 456 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 6 ms 500 KB Output is correct
40 Correct 6 ms 456 KB Output is correct
41 Correct 6 ms 456 KB Output is correct
42 Correct 6 ms 528 KB Output is correct
43 Correct 5 ms 456 KB Output is correct
44 Correct 5 ms 456 KB Output is correct
45 Correct 6 ms 456 KB Output is correct
46 Correct 6 ms 508 KB Output is correct
47 Correct 7 ms 456 KB Output is correct
48 Correct 6 ms 444 KB Output is correct
49 Correct 6 ms 456 KB Output is correct
50 Correct 6 ms 456 KB Output is correct
51 Correct 6 ms 444 KB Output is correct
52 Correct 6 ms 584 KB Output is correct
53 Correct 5 ms 528 KB Output is correct
54 Correct 6 ms 456 KB Output is correct
55 Correct 5 ms 456 KB Output is correct
56 Correct 6 ms 456 KB Output is correct
57 Correct 6 ms 456 KB Output is correct
58 Correct 5 ms 456 KB Output is correct
59 Correct 6 ms 456 KB Output is correct
60 Correct 7 ms 456 KB Output is correct
61 Correct 6 ms 456 KB Output is correct
62 Correct 6 ms 456 KB Output is correct
63 Correct 6 ms 456 KB Output is correct
64 Correct 6 ms 456 KB Output is correct
65 Correct 6 ms 456 KB Output is correct
66 Correct 5 ms 540 KB Output is correct
67 Correct 5 ms 468 KB Output is correct
68 Correct 5 ms 456 KB Output is correct
69 Correct 6 ms 456 KB Output is correct
70 Correct 6 ms 456 KB Output is correct
71 Correct 5 ms 456 KB Output is correct
72 Correct 6 ms 432 KB Output is correct
73 Correct 6 ms 456 KB Output is correct
74 Correct 5 ms 456 KB Output is correct
75 Correct 6 ms 456 KB Output is correct
76 Correct 7 ms 456 KB Output is correct
77 Correct 7 ms 456 KB Output is correct
78 Correct 8 ms 456 KB Output is correct
79 Correct 5 ms 456 KB Output is correct
80 Correct 6 ms 456 KB Output is correct
81 Correct 6 ms 528 KB Output is correct
82 Correct 6 ms 456 KB Output is correct
83 Correct 5 ms 456 KB Output is correct
84 Correct 7 ms 456 KB Output is correct
85 Correct 6 ms 456 KB Output is correct
86 Correct 7 ms 528 KB Output is correct
87 Correct 6 ms 456 KB Output is correct
88 Correct 6 ms 456 KB Output is correct
89 Correct 8 ms 460 KB Output is correct
90 Correct 6 ms 460 KB Output is correct
91 Correct 6 ms 456 KB Output is correct
92 Correct 7 ms 460 KB Output is correct
93 Correct 6 ms 532 KB Output is correct
94 Correct 6 ms 460 KB Output is correct
95 Correct 5 ms 460 KB Output is correct
96 Correct 5 ms 460 KB Output is correct
97 Correct 5 ms 456 KB Output is correct
98 Correct 6 ms 456 KB Output is correct
99 Correct 6 ms 456 KB Output is correct
100 Correct 6 ms 456 KB Output is correct