Submission #404987

# Submission time Handle Problem Language Result Execution time Memory
404987 2021-05-15T13:08:23 Z Ruxandra985 Xoractive (IZhO19_xoractive) C++14
100 / 100
7 ms 456 KB
#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;
 
int ask(int x);
vector <int> get_pairwise_xor(vector<int> v);
 
vector<int> guess(int n) {
	vector <int> ans , q , aux , aux2;
	set <int> ok[10] , s;
	int p1 , bit , i , j , taken;
 
	p1 = ask(1);
	ans.push_back(p1);
 
	for (bit = 0 ; bit < 7 ; bit++){
 
        q.clear();
 
        for (i = 2 ; i <= n ; i++){
            if ((i & (1 << bit)) == 0){
                q.push_back(i);
            }
        }
 
        aux = get_pairwise_xor(q);
 
        q.push_back(1);
 
        aux2 = get_pairwise_xor(q);
 
        i = j = 0;
        while (i < aux.size() && j < aux2.size()){
            if (aux[i] == aux2[j]){
                i++;
                j++;
            }
            else {
                if (aux2[j] != 0){
                    ok[bit].insert(aux2[j] ^ p1);
                }
                j++;
            }
        }
 
        while (j < aux2.size()){
            if (aux2[j] != 0){
                ok[bit].insert(aux2[j] ^ p1);
            }
            j++;
        }
 
	}
 
	for (i = 2 ; i <= n ; i++){
 
        s.clear();
        taken = 0;
 
        for (bit = 0 ; bit < 7 ; bit++){
 
            if ( (i & (1 << bit)) == 0 ){
                /// valoarea din i trb sa se regaseasca in ok[bit]
 
                if (!taken){
 
                    for (set <int> :: iterator it = ok[bit].begin() ; it != ok[bit].end() ; it++)
                        s.insert(*it);
 
                }
 
                else {
 
                    aux.clear();
 
                    for (set <int> :: iterator it = s.begin() ; it != s.end() ; it++){
 
                        if (ok[bit].find(*it) != ok[bit].end())
                            aux.push_back(*it);
 
                    }
 
                    s.clear();
                    for (j = 0 ; j < aux.size() ; j++)
                        s.insert(aux[j]);
                }
 
 
                taken = 1;
 
            }
 
        }
 
        /// -------------------------------------------------------------------------
 
        for (bit = 0 ; bit < 7 ; bit++){
 
            if ( (i & (1 << bit))){
                /// valoarea din i NU trb sa se regaseasca in ok[bit]
 
 
                aux.clear();
 
                for (set <int> :: iterator it = s.begin() ; it != s.end() ; it++){
 
                    if (ok[bit].find(*it) == ok[bit].end())
                        aux.push_back(*it);
 
                }
 
                s.clear();
                for (j = 0 ; j < aux.size() ; j++)
                    s.insert(aux[j]);
 
 
            }
 
        }
 
        if (s.size() == 1){
 
            ans.push_back(*s.begin());
 
            //printf ("%d %d\n" , s.size() , *s.begin());
        }
        else {
            ans.push_back(ask(i));
            //printf ("%d %d\n" , s.size() , *s.begin());
        }
 
 
	}
 
	return ans;
 
 
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:33:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         while (i < aux.size() && j < aux2.size()){
      |                ~~^~~~~~~~~~~~
Xoractive.cpp:33:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         while (i < aux.size() && j < aux2.size()){
      |                                  ~~^~~~~~~~~~~~~
Xoractive.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         while (j < aux2.size()){
      |                ~~^~~~~~~~~~~~~
Xoractive.cpp:84:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |                     for (j = 0 ; j < aux.size() ; j++)
      |                                  ~~^~~~~~~~~~~~
Xoractive.cpp:113:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |                 for (j = 0 ; j < aux.size() ; j++)
      |                              ~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 328 KB Output is correct
2 Correct 4 ms 388 KB Output is correct
3 Correct 5 ms 328 KB Output is correct
4 Correct 5 ms 328 KB Output is correct
5 Correct 5 ms 328 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 4 ms 328 KB Output is correct
8 Correct 5 ms 328 KB Output is correct
9 Correct 5 ms 328 KB Output is correct
10 Correct 4 ms 328 KB Output is correct
11 Correct 5 ms 328 KB Output is correct
12 Correct 4 ms 328 KB Output is correct
13 Correct 6 ms 328 KB Output is correct
14 Correct 5 ms 328 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Correct 5 ms 328 KB Output is correct
18 Correct 5 ms 328 KB Output is correct
19 Correct 4 ms 328 KB Output is correct
20 Correct 5 ms 328 KB Output is correct
21 Correct 5 ms 328 KB Output is correct
22 Correct 5 ms 328 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 5 ms 328 KB Output is correct
25 Correct 4 ms 328 KB Output is correct
26 Correct 5 ms 328 KB Output is correct
27 Correct 4 ms 328 KB Output is correct
28 Correct 5 ms 328 KB Output is correct
29 Correct 5 ms 396 KB Output is correct
30 Correct 5 ms 328 KB Output is correct
31 Correct 5 ms 328 KB Output is correct
32 Correct 5 ms 380 KB Output is correct
33 Correct 5 ms 328 KB Output is correct
34 Correct 5 ms 328 KB Output is correct
35 Correct 4 ms 328 KB Output is correct
36 Correct 5 ms 328 KB Output is correct
37 Correct 5 ms 328 KB Output is correct
38 Correct 5 ms 328 KB Output is correct
39 Correct 4 ms 328 KB Output is correct
40 Correct 4 ms 328 KB Output is correct
41 Correct 4 ms 328 KB Output is correct
42 Correct 5 ms 328 KB Output is correct
43 Correct 4 ms 328 KB Output is correct
44 Correct 4 ms 328 KB Output is correct
45 Correct 5 ms 328 KB Output is correct
46 Correct 4 ms 328 KB Output is correct
47 Correct 4 ms 328 KB Output is correct
48 Correct 4 ms 328 KB Output is correct
49 Correct 4 ms 328 KB Output is correct
50 Correct 5 ms 328 KB Output is correct
51 Correct 4 ms 328 KB Output is correct
52 Correct 4 ms 328 KB Output is correct
53 Correct 4 ms 328 KB Output is correct
54 Correct 5 ms 328 KB Output is correct
55 Correct 4 ms 328 KB Output is correct
56 Correct 5 ms 328 KB Output is correct
57 Correct 5 ms 328 KB Output is correct
58 Correct 5 ms 328 KB Output is correct
59 Correct 4 ms 380 KB Output is correct
60 Correct 4 ms 328 KB Output is correct
61 Correct 5 ms 328 KB Output is correct
62 Correct 6 ms 328 KB Output is correct
63 Correct 4 ms 368 KB Output is correct
64 Correct 4 ms 384 KB Output is correct
65 Correct 7 ms 328 KB Output is correct
66 Correct 4 ms 456 KB Output is correct
67 Correct 5 ms 328 KB Output is correct
68 Correct 4 ms 328 KB Output is correct
69 Correct 5 ms 328 KB Output is correct
70 Correct 6 ms 328 KB Output is correct
71 Correct 4 ms 328 KB Output is correct
72 Correct 4 ms 328 KB Output is correct
73 Correct 5 ms 328 KB Output is correct
74 Correct 4 ms 328 KB Output is correct
75 Correct 4 ms 328 KB Output is correct
76 Correct 5 ms 328 KB Output is correct
77 Correct 4 ms 328 KB Output is correct
78 Correct 4 ms 328 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 4 ms 328 KB Output is correct
81 Correct 5 ms 328 KB Output is correct
82 Correct 4 ms 328 KB Output is correct
83 Correct 4 ms 328 KB Output is correct
84 Correct 5 ms 328 KB Output is correct
85 Correct 5 ms 328 KB Output is correct
86 Correct 6 ms 328 KB Output is correct
87 Correct 4 ms 312 KB Output is correct
88 Correct 5 ms 328 KB Output is correct
89 Correct 5 ms 328 KB Output is correct
90 Correct 4 ms 328 KB Output is correct
91 Correct 4 ms 328 KB Output is correct
92 Correct 4 ms 384 KB Output is correct
93 Correct 6 ms 328 KB Output is correct
94 Correct 5 ms 328 KB Output is correct
95 Correct 4 ms 328 KB Output is correct
96 Correct 4 ms 380 KB Output is correct
97 Correct 5 ms 328 KB Output is correct
98 Correct 5 ms 328 KB Output is correct
99 Correct 4 ms 328 KB Output is correct
100 Correct 5 ms 328 KB Output is correct