oj.uz

답안 #330681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330681 2020-11-26T08:28:17 Z AlexLuchianov Xoractive (IZhO19_xoractive) C++14
100 / 100
 4 ms 384 KB 
#include "interactive.h"
#include <vector>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>

using namespace std;

std::vector<int> dif(std::vector<int> a, std::vector<int> b) {
  std::vector<int> v;
  int ptr = 0;
  for(int i = 0; i < a.size(); i++) {
    while(ptr < b.size() && b[ptr] < a[i])
      ptr++;
    if(ptr < b.size() && b[ptr] == a[i]) 
      ptr++;
    else
      v.push_back(a[i]);
  }
  return v;
}

std::vector<int> intersect(std::vector<int> a, std::vector<int> b) {
  std::vector<int> v;
  int ptr = 0;
  for(int i = 0; i < a.size(); i++) {
    while(ptr < b.size() && b[ptr] < a[i])
      ptr++;
    if(ptr < b.size() && b[ptr] == a[i]) {
      v.push_back(a[i]);
      ptr++;
    }
  }
  return v;
}

int const lgmax = 7;

vector<int> guess(int n) {
  int key = ask(n);
  std::vector<std::vector<int>> st(1 + lgmax);
  for(int i = 0; i < lgmax; i++) {
    std::vector<int> quer;
    for(int j = 1; j < n; j++)
      if(j & (1 << i))
        quer.push_back(j);
    if(0 < quer.size()) { 
      std::vector<int> without, with;
      without = get_pairwise_xor(quer);
      quer.push_back(n);
      with = get_pairwise_xor(quer);
      without.insert(without.begin(), 0);
      st[i] = dif(with, without);
    }
  }
  
  std::vector<int> ans;
  for(int i = 1;i < n; i++) {
    std::vector<int> sol;
    for(int j = 0; j < lgmax; j++) {
      if(sol.size() == 0 && (i & (1 << j)))
        sol = st[j];
    }
    
    for(int j = 0; j < lgmax; j++)
      if(0 < (i & (1 << j)))
        sol = intersect(sol, st[j]);
      else
        sol = dif(sol, st[j]);
    ans.push_back(sol[0] ^ key);
  }
  ans.push_back(key);
  return ans;
}

Compilation message

Xoractive.cpp: In function 'std::vector<int> dif(std::vector<int>, std::vector<int>)':
Xoractive.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i = 0; i < a.size(); i++) {
      |                  ~~^~~~~~~~~~
Xoractive.cpp:14:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     while(ptr < b.size() && b[ptr] < a[i])
      |           ~~~~^~~~~~~~~~
Xoractive.cpp:16:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     if(ptr < b.size() && b[ptr] == a[i])
      |        ~~~~^~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> intersect(std::vector<int>, std::vector<int>)':
Xoractive.cpp:27:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for(int i = 0; i < a.size(); i++) {
      |                  ~~^~~~~~~~~~
Xoractive.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     while(ptr < b.size() && b[ptr] < a[i])
      |           ~~~~^~~~~~~~~~
Xoractive.cpp:30:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     if(ptr < b.size() && b[ptr] == a[i]) {
      |        ~~~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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