Submission #316830

#	Time	Username	Problem	Language	Result	Execution time	Memory
316830		anakib1	Mechanical Doll (IOI18_doll)	C++17	0 / 100	2 ms	204 KiB

doll

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e9
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
}; 

#include "doll.h"
int state[700707];
int sz = 1, n, cnt;
int get(int v) {
    if (v >= sz) return (sz - n <= v - sz)? v - sz:inf;
    state[v] ^= 1;
    if (state[v])return get(v << 1); return get(v << 1 | 1);
}
void create_circuit(int m, std::vector<int> a) {
    a.push_back(0);
    n = sz(a);
    while (sz < n) sz <<= 1;
    vi t(sz << 1);
    rngi(i, sz)t[sz + i] = inf;
    int tt = 0;
    vi rev(sz);
    rngi(i, sz) t[i] = get(1);
    int j = 0; rngi(i, sz) if (rev[i] != inf) { t[rev[i] + sz] = a[j], j++; }
    vi x, y;
    for (int i = sz - 1; i >= 0; i--) {
        if (t[i << 1] == t[i << 1 | 1] && t[i << 1] == inf)t[i] = inf;
        else {
            t[i] = --tt;
            x.push_back(t[i << 1]);
            y.push_back(t[i << 1 | 1]);
        }
    }
    rngi(i, sz(x)) {
        if (x[i] == inf) x[i] = tt;
        if (y[i] == inf) y[i] = tt;
    }
    answer(vi(m + 1, tt), x, y);
}

Compilation message (stderr)

doll.cpp: In function 'int get(int)':
doll.cpp:119:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  119 |     if (state[v])return get(v << 1); return get(v << 1 | 1);
      |     ^~
doll.cpp:119:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  119 |     if (state[v])return get(v << 1); return get(v << 1 | 1);
      |                                      ^~~~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56