Submission #1218239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218239		M_SH_O	Mouse (info1cup19_mouse)	C++20	9 / 100	18 ms	416 KiB

mouse

#include <bits/stdc++.h>
#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

/*vvll s1;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

vll unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return {};
    if (s1[a].size() < s1[b].size()) {
        p[a] = b;
        for (auto i : s1[a]) {
            s1[b].pb(i);

        }
        return s1[a];
    }
    else {
        p[b] = a;
        for (auto i : s1[b]) {
            s1[a].pb(i);

        }
        return s1[b];
    }
}

vll tree1, d;

void push(ll v, ll tl, ll tr) {
    if (tl == tr) return;
    tree1[v*2] += d[v];
    tree1[v*2+1] += d[v];
    d[v*2] += d[v];
    d[v*2+1] += d[v];
    d[v] = 0;
    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

void bt(ll v, ll tl, ll tr, vll& a) {
    if (tl == tr) {
        tree1[v] = a[tl];
        return;
    }

    ll tm = (tl+tr)/2;
    bt(v*2, tl, tm, a);
    bt(v*2, tm+1, tr, a);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

ll get(ll l, ll r, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) return tree1[v];
    if (tl > r || tr < l) return 0;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);
    return get(l, r, v*2, tl, tm)+get(l, r, v*2+1, tm+1, tr);
}

void update(ll l, ll r, ll val, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        tree1[v] += val;
        d[v] += val;
        push(v, tl, tr);
        return;
    }
    if (tl > r || tr < l) return;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);

    update(l, r, val, v*2, tl, tm);
    update(l, r, val, v*2+1, tm+1, tr);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}*/

vi f(ll i, ll x, ll n) {
    vi b;
    for (int j = 1; j <= n; j ++) {
        if (j == x) continue;
        b.pb(j);
    }
    random_shuffle(all(b));
    vi a;
    for (int j = 0; j < b.size(); j ++) {
        if (i == j) break;
        a.pb(b[j]);
    }
    a.pb(x);
    for (int j = i; j < b.size(); j ++) {
        a.pb(b[j]);
    }
    return a;
}

void solve(int n) {
    srand(time(0));
    set<ll> s;
    vi res(n);
    for (int i = 0; i < n; i ++) {
        vll a(n);
        for (int j = 0; j < n; j ++) {
            a[j] = j+1;
        }
        random_shuffle(all(a));

        for (int j : a) {
            if (s.find(j) != s.end()) continue;
            bool q = 1;
            for (int i1 = 0; i1 < 20; i1 ++) {
                vi b = f(i, j, n);
                ll k = query(b);
                if (k == 0) {
                    q = 0;
                    break;
                }
                if (k == n) return;
            }
            if (q) {
                res[i] = j;
                s.insert(j);
                break;
            }
        }
    }
    ll k = query(res);
    return;
}

• Subtask 1: 9 / 13
• Subtask 2: 0 / 38
• Subtask 3: 0 / 49