Submission #1250424

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250424		Zbyszek99	World Map (IOI25_worldmap)	C++20	86 / 100	69 ms	5600 KiB

worldmap

#include "worldmap.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;

vi graph[41];
vi route;
bool odw[41];

void dfs(int v)
{
    route.pb(v);
    odw[v] = 1;
    forall(it,graph[v])
    {
        if(odw[it] == 0)
        {
            dfs(it);
            route.pb(v);
        }
    }
}

vector<vi> create_map(int n, int m, vi A, vi B) 
{
    rep(i,n) graph[i+1] = {};
    rep(i,m)
    {
        graph[A[i]].pb(B[i]);
        graph[B[i]].pb(A[i]);
    }
    route = {};
    rep2(i,1,n) odw[i] = 0;
    dfs(1);
    int len = siz(route)+n;
    vector<vi> ans(len,vi(len,0));
    rep2(i,1,n) odw[i] = 0;
    int d = 0;
    int cur_level = 0;
    int prev = route[0];
    forall(it,route)
    {
        if(odw[it] == 0)
        {
            rep(i,len)
            {
                if(i%2 == d)
                {
                    ans[cur_level][i] = prev;
                }
                else
                {
                    ans[cur_level][i] = it;
                }
            }
            cur_level++;
            rep(i,len)
            {
                if(i%2 == d)
                {
                    ans[cur_level][i] = it;
                }
                else
                {
                    if(siz(graph[it]) > i/2)
                    {
                        ans[cur_level][i] = graph[it][i/2];
                    }
                    else
                    {
                        ans[cur_level][i] = it;
                    }
                }
            }
            cur_level++;
            d = (d+1)%2;
        }
        else
        {
            rep(i,len)
            {
                if(i%2 == d)
                {
                    ans[cur_level][i] = prev;
                }
                else
                {
                    ans[cur_level][i] = it;
                }
            }
            cur_level++;
        }
        prev = it;
        odw[it] = 1;
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 7 / 7
• Subtask 4: 8 / 8
• Subtask 5: 14 / 14
• Subtask 6: 42 / 56