Submission #1255269

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255269		lrnnz	World Map (IOI25_worldmap)	C++20	72 / 100	77 ms	9380 KiB

worldmap

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
#include "worldmap.h"
using namespace std;

#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
#define pb push_back

#define chmin(x, y) (x = min(x, y)) 
#define chmax(x, y) (x = max(x, y))

/********* DEBUG *********/

template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}


template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

/********* DEBUG *********/

#define sp << " " <<
#define fi first
#define se second   

const ll MOD2 = 1e9 + 7;
const ll MOD = 998244353;
const ll inf = 1e18;

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
    vector<vector<int>> adj(N+1);
    vector<int> cur;

    for (int i = 0; i < M; i++){
        adj[A[i]].pb(B[i]);
        adj[B[i]].pb(A[i]);
    }

    vector<bool> seen(N+1);    
    auto dfs = [&](auto &&dfs, ll u) -> void {
        cur.pb(u);
        seen[u] = 1;

        for (auto &v : adj[u]){
            if (seen[v])
                continue;

            dfs(dfs, v);
            cur.pb(u);
        }
    };

    dfs(dfs, 1);

    for (int i = 0; i <= N; i++)
        seen[i] = 0;
    
    vector<int> ril, idx(N+1);
    for (int i = 0; i < cur.size(); i++){
        ril.pb(cur[i]);

        if (!seen[cur[i]]){
            seen[cur[i]] = 1;
            idx[cur[i]] = ril.size();

            ril.pb(cur[i]);
            ril.pb(cur[i]);
        }
    }
    
    vector<vector<int>> ans(ril.size());
    for (int i = 0; i < ril.size(); i++)
        ans[i] = ril;

    for (int i = 1; i <= N; i++){
        ll cur = 0;
        for (auto &v : adj[i]){
            ans[cur][idx[i]] = v;
            cur += 2;
        }
    }

    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: 28 / 56