제출 #917882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917882		trMatherz	경주 (Race) (IOI11_race)	C++17	0 / 100	3 ms	4444 KiB

race

//#include <iostream> //cin, cout
#include <race.h>
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)


vi v;
int n, m;
vector<mii> b;
vvi a;
int an = -1;
void dfs(int x, int p, mii temp){
    A(u, a[x]) {
        if(u == p) continue; 
        mii yup = temp;
        yup[v[u]] = 1;
        A(k, temp) {if(k.f + v[u] > (int) 1e6) {break;} yup[k.f + v[u]] = k.s + 1;}
        dfs(u, x, yup);
        bool sw = false;
        if(sz(temp) > sz(b[u])) swap(temp, b[u]), sw = true;
        A(k, temp){
            if(b[u].find(m - k.f) != b[u].end()) emin(an, b[u][m - k.f] + k.s);
        }
        if(sw) swap(temp, b[u]); 
        if(sz(b[u]) > sz(b[x])) swap(b[u], b[x]);
        A(k, b[u]) {
            if(k.f + v[x] > (int) 1e6) {break;}
            if(b[x].find(k.f + v[x]) == b[x].end()) b[x][k.f + v[x]] = k.s + 1;
            else emin(b[x][k.f + v[x]], k.s + 1);
        }
    }
    b[x][v[x]] = 1;
}

int best_path(int N, int K, int H[][2], int L[]){
    n = N, m = K;
    an = n + 7;
    a = vvi(a); b = vector<mii>(n); v = vi(n, 0);
    F(i, n) {v[i + 1] = L[i]; if(L[i] == m) an = 1;}
    F(i, n - 1) a[H[i][1]].pb(H[i][0]), a[H[i][0]].pb(H[i][1]);
    mii temp;
    dfs(0, -1, temp);
    return (an == n + 7 ? -1 : an);
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57