Submission #1209213

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209213		Zbyszek99	Amusement Park (JOI17_amusement_park)	C++20	100 / 100	130 ms	5576 KiB

Joi

#include "Joi.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

vi graph[10'001];
ll bit_num[10'001];
bool odw[10'001];
vi span_tree[10'001];
vi comp[10'001];
bool was_used[60];
int cur_bit = 0;
int comp_cnt = 0;
bool is_in[10'001];
ll ans;
ll table[10'001];

void dfs_fc(int v, int pop)
{
    odw[v] = 1;
    if(cur_bit <= 59)
    {
        bit_num[v] = cur_bit++;
        comp[0].pb(v);
    }
    if(v != 0) span_tree[pop].pb(v);
    forall(it,graph[v])
    {
        if(odw[it] == 0)
        {
            dfs_fc(it,v);
        }
    }
}

void dfs_new_comp(int v, int start)
{
    if(comp_cnt == 59) return;
    comp[start].pb(v);
    comp_cnt++;
    was_used[bit_num[v]] = 1;
    is_in[v] = 0;
    forall(it,graph[v])
    {
        if(is_in[it])
        {
            dfs_new_comp(it,start);
        }
    }
}

void dfs_comps(int v, int pop)
{
    if(bit_num[v] == -1)
    {
        rep(bit,60) was_used[bit] = 0;
        comp_cnt = 0;
        forall(it,comp[pop])
        {
            is_in[it] = 1;
        }
        comp[v].pb(v);
        dfs_new_comp(pop,v);
        forall(it,comp[pop])
        {
            is_in[it] = 0;
        }
        rep(bit,60)
        {
            if(!was_used[bit])
            {
                bit_num[v] = bit;
                break;
            }
        }
    }
    forall(it,span_tree[v])
    {
        dfs_comps(it,v);
    }
}

void Joi(int N, int M, int A[], int B[], ll X, int T) 
{
    rep(i,N)
    {
        bit_num[i] = -1;
    }
    rep(i,M)
    {
        graph[A[i]].pb(B[i]);
        graph[B[i]].pb(A[i]);
    }
    dfs_fc(0,0);
    forall(it,comp[0])
    {
        if(it == 0) continue;
        forall(it2,comp[0])
        {
            comp[it].pb(it2);
        }
    }
    dfs_comps(0,0);
    rep(i,N)
    {
        if((1LL << bit_num[i]) & X)
        {
            MessageBoard(i,1);
        }
        else
        {
            MessageBoard(i,0);
        }
    }
}

Ioi

#include "Ioi.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

namespace
{
    vi graph[10'001];
    ll bit_num[10'001];
    bool odw[10'001];
    vi span_tree[10'001];
    vi comp[10'001];
    bool was_used[60];
    int cur_bit = 0;
    int comp_cnt = 0;
    bool is_in[10'001];
    ll ans;
    ll table[10'001];
    void dfs_fc(int v, int pop)
    {
        odw[v] = 1;
        if(cur_bit <= 59)
        {
            bit_num[v] = cur_bit++;
            comp[0].pb(v);
        }
        if(v != 0) span_tree[pop].pb(v);
        forall(it,graph[v])
        {
            if(odw[it] == 0)
            {
                dfs_fc(it,v);
            }
        }
    }

    void dfs_new_comp(int v, int start)
    {
        if(comp_cnt == 59) return;
        comp[start].pb(v);
        comp_cnt++;
        was_used[bit_num[v]] = 1;
        is_in[v] = 0;
        forall(it,graph[v])
        {
            if(is_in[it])
            {
                dfs_new_comp(it,start);
            }
        }
    }

    void dfs_comps(int v, int pop)
    {
        if(bit_num[v] == -1)
        {
            rep(bit,60) was_used[bit] = 0;
            comp_cnt = 0;
            forall(it,comp[pop])
            {
                is_in[it] = 1;
            }
            comp[v].pb(v);
            dfs_new_comp(pop,v);
            forall(it,comp[pop])
            {
                is_in[it] = 0;
            }
            rep(bit,60)
            {
                if(!was_used[bit])
                {
                    bit_num[v] = bit;
                    break;
                }
            }
        }
        forall(it,span_tree[v])
        {
            dfs_comps(it,v);
        }
    }

    void dfs_ans(int v)
    {
        ans += (1LL << bit_num[v]) * table[v];
        is_in[v] = 0;
        forall(it,graph[v])
        {
            if(is_in[it])
            {
                table[it] = Move(it);
                dfs_ans(it);
                Move(v);
            }
        }
    }
}

ll Ioi(int N, int M, int A[], int B[], int P, int V, int T) 
{
    rep(i,N)
    {
        bit_num[i] = -1;
    }
    rep(i,M)
    {
        graph[A[i]].pb(B[i]);
        graph[B[i]].pb(A[i]);
    }
    dfs_fc(0,0);
    forall(it,comp[0])
    {
        if(it == 0) continue;
        forall(it2,comp[0])
        {
            comp[it].pb(it2);
        }
    }
    dfs_comps(0,0);
    vi c = comp[P];
    rep(i,N) is_in[i] = 0;
    forall(it,c) is_in[it] = 1;
    ans = 0;
    table[P] = V;
    dfs_ans(P);
    return ans;
}

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 55 / 55
• Subtask 5: 17 / 17