Submission #568014

#	Time	Username	Problem	Language	Result	Execution time	Memory
568014		abc864197532	Chameleon's Love (JOI20_chameleon)	C++17	4 / 100	19 ms	320 KiB

chameleon

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty()) return o << "{}";
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#include "grader.cpp"
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#include "chameleon.h"
#endif
const int mod = 1e9 + 7, N = 100000, logN = 20, K = 48763;

void Solve(int n) {
    vector <bool> vis(n * 2 + 1, false);
    for (int i = 1; i <= n * 2; ++i) if (!vis[i]) {
        int st = i;
        vector <int> p;
        for (int i = 1; i <= n * 2; ++i) if (!vis[i] && i != st)
            p.pb(i);
        int l = 0, r = p.size();
        while (r - l > 1) {
            int m = l + r >> 1;
            vector <int> now;
            for (int i = l; i < m; ++i)
                now.pb(p[i]);
            int x = Query(now);
            now.pb(st);
            int y = Query(now);
            if (y == x)
                r = m;
            else
                l = m;
        }
        Answer(st, p[l]);
        vis[st] = vis[p[l]] = true;
    }
}

Compilation message (stderr)

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:59:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |             int m = l + r >> 1;
      |                     ~~^~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36