Submission #864061

#	Time	Username	Problem	Language	Result	Execution time	Memory
864061		Danilo21	Ancient Machine 2 (JOI23_ancient2)	C++17	10 / 100	84 ms	1720 KiB

ancient2

#include <bits/stdc++.h>
#include "ancient2.h"

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) (__builtin_popcountll(a))
#define bithigh(a) (63-__builtin_clzll(a))
#define lg bithigh
#define highpow(a) (1LL << (ll)lg(a))

using namespace std;

const ll LINF = 2e18;
const int mxN = 2e3+10, INF = 2e9;

string Solve(int N) {
    string s = "";
    for (int i = 0; i < N; i++){
        vector<int> a, b;
        for (int j = 0; j < i; j++){
            a.pb(j+1);
            b.pb(j+1);
        }
        a.pb(i+1); b.pb(i+2);
        a.pb(i+1); b.pb(i+1);
        a.pb(i+2); b.pb(i+2);
        if (Query(i+3, a, b) == i+1)
            s += '0';
        else s += '1';
    }
    return s;
}

• Subtask 1: 10 / 100