Submission #4076068
Source Code Expand
#include <algorithm> #include <bitset> #include <cctype> #include <cmath> #include <cstdio> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <iostream> #include <limits> #include <map> #include <numeric> #include <queue> #include <set> #include <vector> using namespace std; using ll = long long; #define fst first #define snd second /* clang-format off */ template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; }; template <class T> struct _vec<T, 0> { using type = T; }; template <class T, size_t D> using vec = typename _vec<T, D>::type; template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); } template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); } template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; } template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; } /* clang-format on */ int ask(const vector<int>& q) { cout << "?"; for (int x : q) cout << " " << x; cout << endl; int res; cin >> res; return res; } int main() { int N; while (cin >> N) { vector<int> ans(N, 0); for (int i = 0; i < N; i += 6) { vector<int> q(N, 0); int k = min(i + 6, N); int sub = 0, pw = 1; for (int j = i; j < k; j++) { q[j] = pw; sub += 8 * pw; pw *= 6; } int val = ask(q) - sub; for (int j = i; j < k; j++) { ans[j] = (val % 6) & 1; val /= 6; } } cout << "!"; for (int x : ans) cout << " " << x; cout << endl; break; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Coin Authentication |
User | kroton |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1757 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 724 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt |
All | sample_01.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 3 ms | 724 KB |
subtask_1_1.txt | AC | 3 ms | 720 KB |
subtask_1_10.txt | AC | 3 ms | 716 KB |
subtask_1_11.txt | AC | 3 ms | 724 KB |
subtask_1_12.txt | AC | 3 ms | 716 KB |
subtask_1_13.txt | AC | 3 ms | 720 KB |
subtask_1_14.txt | AC | 3 ms | 716 KB |
subtask_1_15.txt | AC | 3 ms | 592 KB |
subtask_1_16.txt | AC | 3 ms | 592 KB |
subtask_1_17.txt | AC | 3 ms | 720 KB |
subtask_1_18.txt | AC | 4 ms | 716 KB |
subtask_1_19.txt | AC | 4 ms | 596 KB |
subtask_1_2.txt | AC | 3 ms | 720 KB |
subtask_1_20.txt | AC | 4 ms | 720 KB |
subtask_1_21.txt | AC | 4 ms | 588 KB |
subtask_1_22.txt | AC | 4 ms | 720 KB |
subtask_1_23.txt | AC | 4 ms | 720 KB |
subtask_1_24.txt | AC | 4 ms | 720 KB |
subtask_1_25.txt | AC | 4 ms | 716 KB |
subtask_1_26.txt | AC | 3 ms | 720 KB |
subtask_1_27.txt | AC | 4 ms | 720 KB |
subtask_1_28.txt | AC | 3 ms | 592 KB |
subtask_1_29.txt | AC | 4 ms | 720 KB |
subtask_1_3.txt | AC | 3 ms | 724 KB |
subtask_1_4.txt | AC | 3 ms | 724 KB |
subtask_1_5.txt | AC | 3 ms | 716 KB |
subtask_1_6.txt | AC | 3 ms | 716 KB |
subtask_1_7.txt | AC | 3 ms | 720 KB |
subtask_1_8.txt | AC | 3 ms | 592 KB |
subtask_1_9.txt | AC | 3 ms | 716 KB |