oj.uz

Submission #180895

# Submission time Handle Problem Language Result Execution time Memory
180895 2020-01-09T06:01:49 Z dimash241 Xoractive (IZhO19_xoractive) C++17
0 / 100
 3 ms 380 KB 
#include "interactive.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back 
vector<int> a;
 
set<int> getMn(set<int> ind) {
    set<int> ans;
    if (ind.empty())
        return ans;
    vector<int> pos;
    for (auto i = ind.begin(); i != ind.end(); i++)
        pos.pb(*i);
    pos.pb(1);
    vector<int> px1 = get_pairwise_xor(pos);
    pos.pop_back();
    vector<int> px2 = get_pairwise_xor(pos);
    multiset<int> temp;
    for (int i = 0; i < px1.size(); i++)
        temp.insert(px1[i]);
    for (int i = 0; i < px2.size(); i++)
        temp.erase(temp.find(px2[i]));
    for (auto i = temp.begin(); i != temp.end(); i++)
        ans.insert(*i ^ a[1]);
    ans.erase(a[1]);
    return ans;
}
 
vector<int> guess(int n) {
    a.resize(n + 1);
	set<int> all;
    a[1] = ask(1);
    vector< vector< set<int> > > mn(7, vector< set<int> >(2)), ind(7, vector< set<int> >(2));
    for (int i = 2; i <= n; i++) {
        for (int j = 6; j >= 0; j--) {
            ind[j][(i & (1 << j))].insert(i);
        }
    }
    for (int j = 6; j >= 0; j--) {
        mn[j][1] = getMn(ind[j][1]);
        for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
            all.insert(*i);
    }
 
    for (int j = 6; j >= 0; j--) {
        mn[j][0] = all;
        for (auto i = mn[j][1].begin(); i != mn[j][1].end(); i++)
            mn[j][0].erase(*i);
    }
 
    for (int i = 2; i <= n; i++) {
        set<int> cur = all;
        for (int j = 6; j >= 0; j--) {
            for (auto it = all.begin(); it != all.end(); it++) {
                if (mn[j][(i & (1 << j))].find(*it) == mn[j][(i & (1 << j))].end())
                    cur.erase(*it);
            }
        }
        a[i] = *cur.begin();
    }
    vector < int > ans;
    for (int i = 1; i <= n; i++)
        ans.pb(a[i]);
    return ans;
}


// B...a

Compilation message

Xoractive.cpp: In function 'std::set<int> getMn(std::set<int>)':
Xoractive.cpp:20:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < px1.size(); i++)
                     ~~^~~~~~~~~~~~
Xoractive.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < px2.size(); i++)
                     ~~^~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 94.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 380 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -