# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821099 | ono_de206 | Ancient Machine 2 (JOI23_ancient2) | C++17 | 105 ms | 692 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
int ask(vector<int> a, vector<int> b) {
return Query((int)a.size(), a, b);
}
string Solve(int n) {
vector<int> a, b;
int l = 0;
string ans = "";
auto getNext = [&]() -> char {
int m = (int)a.size();
a.pb(m + 2);
b.pb(m + 1);
for(int i = 0; i < 2; i++) {
a.pb(m + i + 1);
b.pb(m + i + 1);
}
int ret = ask(a, b);
for(int i = 0; i < 3; i++) {
a.pop_back();
b.pop_back();
}
return (ret == m + 2 ? '0' : '1');
};
for(int i = 0; i < n; i++) {
ans.pb(getNext());
a.pb(i + 1);
b.pb(i + 1);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |