#include "ancient2.h"
#include<bits/stdc++.h>
using namespace std;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
//#define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
string Solve(int n) {
vector<int> a, b;
string ans = "";
for(int i = 0; i < n; i++) {
a.pb(i + 2);
b.pb(i + 1);
for(int j = 0; j < 2; j++) {
a.pb(i + j + 1);
b.pb(i + j + 1);
}
int l = Query((int)a.size(), a, b);
if(l == i + 2) ans.pb('1');
else ans.pb('0');
for(int j = 0; j < 2; j++) {
a.pop_back();
b.pop_back();
}
a.pb(i + 1);
b.pb(i + 1);
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
38 ms |
380 KB |
Wrong Answer [4] |
| 2 |
Halted |
0 ms |
0 KB |
- |
