Submission #1060171

#	Time	Username	Problem	Language	Result	Execution time	Memory
1060171		RecursiveCo	Ancient Machine 2 (JOI23_ancient2)	C++17	10 / 100	87 ms	1484 KiB

ancient2

// CF template, version 3.0

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

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

string Solve(int N) {
    string ans = "";
    forto(N, i) {
        vector<int> A;
        vector<int> B;
        forto(i, j) A.push_back(j + 1), B.push_back(j + 1);
        A.push_back(i + 1);
        B.push_back(i + 2);
        A.push_back(i + 1);
        B.push_back(i + 1);
        A.push_back(i + 2);
        B.push_back(i + 2);
        int m = A.size(); // = B.size()
        int res = Query(m, A, B);
        if (res == i + 1) ans += "0";
        else ans += "1";
    }
    return ans;
}

Compilation message (stderr)

ancient2.cpp: In function 'std::string Solve(int)':
ancient2.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
ancient2.cpp:74:5: note: in expansion of macro 'forto'
   74 |     forto(N, i) {
      |     ^~~~~
ancient2.cpp:16:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
ancient2.cpp:77:9: note: in expansion of macro 'forto'
   77 |         forto(i, j) A.push_back(j + 1), B.push_back(j + 1);
      |         ^~~~~

• Subtask 1: 10 / 100