oj.uz

답안 #878860

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878860 2023-11-25T10:56:36 Z 8pete8 Xoractive (IZhO19_xoractive) C++14
100 / 100
 2 ms 652 KB 
#include "interactive.h"
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <algorithm>
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,pii>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
using namespace std;
const int mod=9901,mxn=3*1e5+5;

vector<int> guess(int n){
    int g=ask(1);
    map<int,int>pos;
    for(int i=0;i<7;i++){
        vector<int>q;
        for(int j=2;j<=n;j++)if(j&(1<<i))q.pb(j);
        if(q.size()<=1){
            for(auto j:q)pos[ask(j)]+=(1<<i);
            continue;
        }
        vector<int>a1=get_pairwise_xor(q);
        q.pb(1);
        vector<int>a2=get_pairwise_xor(q);
        int cur=0,j=0;
        while(cur<a1.size()&&a1[cur]==0)cur++;
        while(j<a2.size()&&a2[j]==0)j++;
        for(;j<a2.size();j++){
            if(cur<a1.size()&&a1[cur]==a2[j]){
                cur++;
                continue;
            }
            pos[a2[j]^g]+=(1<<i);
            j++;
        }
    }
    vector<int>ans(n);
    ans[0]=g;
    for(auto i:pos)ans[i.s-1]=i.f;
    return ans;
}

Compilation message

Xoractive.cpp:36:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   36 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Xoractive.cpp:40:24: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   40 | vector<int> guess(int n){
      |                        ^
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:54:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         while(cur<a1.size()&&a1[cur]==0)cur++;
      |               ~~~^~~~~~~~~~
Xoractive.cpp:55:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         while(j<a2.size()&&a2[j]==0)j++;
      |               ~^~~~~~~~~~
Xoractive.cpp:56:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(;j<a2.size();j++){
      |              ~^~~~~~~~~~
Xoractive.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             if(cur<a1.size()&&a1[cur]==a2[j]){
      |                ~~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
94.0 / 94.0

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