# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
686599 | 2023-01-25T14:32:18 Z | minhcool | Xoractive (IZhO19_xoractive) | C++17 | 1 ms | 208 KB |
#include<bits/stdc++.h> #include "interactive.h" using namespace std; //#define int long long #define fi first #define se second #define pb push_back #define mp make_pair typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef pair<ii, ii> iiii; const int N = 3e5 + 5; const int oo = 1e18 + 7, mod = 1e9 + 7; vector<int> guess(int n){ vector<int> ans; int x = ask(1); ans.pb(x); for(int i = 2; i <= n; i++){ vector<int> pos; pos.pb(i - 1), pos.pb(i); vector<int> temp = get_pairwise_xor(pos); x ^= temp.back(); ans.pb(x); } return ans; } /* void process(){ } signed main(){ ios_base::sync_with_stdio(0); int t; cin >> t; while(t--) process(); } */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Correct | 1 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |