oj.uz

Submission #1004905

# Submission time Handle Problem Language Result Execution time Memory
1004905 2024-06-21T23:06:18 Z YassirSalama Race (IOI11_race) C++17
100 / 100
 337 ms 98832 KB 
// #include "race.h"
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
#define endl "\n"
using ull=unsigned long long;
using ll=long long;
using pii=pair<int,int>;
const int mod=1e9+7;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
template <typename T> istream& operator>>(istream& is, vector<T> &a) {
    copy_n(istream_iterator<T>(is), a.size(), a.begin()); return is;}
#ifdef IOI
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int mxN=2e5+100;
int k;
int n;
vector<pii> v[mxN];
ll ans=1e9;
ll sz[mxN];
ll d1[mxN];//using weight of the edge
ll d2[mxN];//jut dist (weight=1)
void dfs(int node,int par,ll d=0){
    d2[node]=d2[par]+1;
    d1[node]=d;
    sz[node]=1;
    for(auto x:v[node]){
        if(x.F==par) continue;
        dfs(x.F,node,d+x.S);
        sz[node]+=sz[x.F];
    }
}
map<ll,ll> mp[mxN];
void dfs2(int node,int par){
    int bc=-1;
    ll bs=0;
    for(auto x:v[node]){
        if(x.F!=par&&sz[x.F]>bs)
            bs=sz[x.F],bc=x.F;
        if(x.F!=par){
            dfs2(x.F,node);
        }
    }
    if(bc!=-1){
        swap(mp[node],mp[bc]);
    }
    mp[node][d1[node]]=d2[node];
    if(mp[node].count(d1[node]+k)>0){
    //     // dbg(node,-d2[node],mp[node][d1[node]+k])
        ans=min(ans,-d2[node]+mp[node][d1[node]+k]);
    }
    for(auto x:v[node]){
        if(x.F==par||x.F==bc) continue;
        for(auto it:mp[x.F]){
            ll z=k-it.F+2*d1[node];
            if(mp[node].count(z)>0){
                ans=min(ans,mp[node][z]+it.S-2*d2[node]);
            }
        }
        for(auto it:mp[x.F]){
            if(mp[node].count(it.F)>0)
                mp[node][it.first]=min(mp[node][it.first],
                    it.second);
            else mp[node][it.F]=it.S;
        }
    }
}


int best_path(int N, int K, int H[][2], int L[]){
    n=N;
    k=K;
    for(int i=0;i+1<n;i++){
        v[H[i][0]].pb({H[i][1],L[i]});
        v[H[i][1]].pb({H[i][0],L[i]});
    }
    dfs(0,0);
    dfs2(0,0);

    if(ans==1e9) return -1;
    return ans;

}











#ifdef IOI
// #include "race.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_N 500000

static int N, K;
static int H[MAX_N][2];
static int L[MAX_N];
static int solution;

inline 
void my_assert(int e) {if (!e) abort();}

void read_input()
{
    int i;
    my_assert(2==scanf("%d %d",&N,&K));
    for(i=0; i<N-1; i++)
        my_assert(3==scanf("%d %d %d",&H[i][0],&H[i][1],&L[i]));
    my_assert(1==scanf("%d",&solution));
}

int main()
{
    int ans;
    read_input();
    ans = best_path(N,K,H,L);
    if(ans==solution)
        printf("Correct.\n");
    else
        printf("Incorrect. Returned %d, Expected %d.\n",ans,solution);

    return 0;
}
#endif

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22856 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 3 ms 22876 KB Output is correct
6 Correct 3 ms 22876 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 4 ms 22876 KB Output is correct
10 Correct 4 ms 23124 KB Output is correct
11 Correct 4 ms 22876 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 3 ms 22876 KB Output is correct
15 Correct 3 ms 22876 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 3 ms 22876 KB Output is correct
18 Correct 3 ms 22876 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22856 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 3 ms 22876 KB Output is correct
6 Correct 3 ms 22876 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 4 ms 22876 KB Output is correct
10 Correct 4 ms 23124 KB Output is correct
11 Correct 4 ms 22876 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 3 ms 22876 KB Output is correct
15 Correct 3 ms 22876 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 3 ms 22876 KB Output is correct
18 Correct 3 ms 22876 KB Output is correct
19 Correct 3 ms 22872 KB Output is correct
20 Correct 3 ms 22896 KB Output is correct
21 Correct 5 ms 22876 KB Output is correct
22 Correct 4 ms 23132 KB Output is correct
23 Correct 4 ms 22876 KB Output is correct
24 Correct 4 ms 22876 KB Output is correct
25 Correct 4 ms 23128 KB Output is correct
26 Correct 4 ms 23132 KB Output is correct
27 Correct 4 ms 22872 KB Output is correct
28 Correct 4 ms 22872 KB Output is correct
29 Correct 4 ms 22872 KB Output is correct
30 Correct 4 ms 22876 KB Output is correct
31 Correct 4 ms 22876 KB Output is correct
32 Correct 4 ms 22876 KB Output is correct
33 Correct 4 ms 23132 KB Output is correct
34 Correct 3 ms 22872 KB Output is correct
35 Correct 4 ms 22876 KB Output is correct
36 Correct 3 ms 22876 KB Output is correct
37 Correct 4 ms 22876 KB Output is correct
38 Correct 4 ms 22876 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22856 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 3 ms 22876 KB Output is correct
6 Correct 3 ms 22876 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 4 ms 22876 KB Output is correct
10 Correct 4 ms 23124 KB Output is correct
11 Correct 4 ms 22876 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 3 ms 22876 KB Output is correct
15 Correct 3 ms 22876 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 3 ms 22876 KB Output is correct
18 Correct 3 ms 22876 KB Output is correct
19 Correct 64 ms 39764 KB Output is correct
20 Correct 66 ms 40384 KB Output is correct
21 Correct 68 ms 40260 KB Output is correct
22 Correct 66 ms 40784 KB Output is correct
23 Correct 99 ms 54352 KB Output is correct
24 Correct 80 ms 46992 KB Output is correct
25 Correct 53 ms 39552 KB Output is correct
26 Correct 36 ms 47444 KB Output is correct
27 Correct 128 ms 46440 KB Output is correct
28 Correct 160 ms 82256 KB Output is correct
29 Correct 148 ms 80724 KB Output is correct
30 Correct 113 ms 46676 KB Output is correct
31 Correct 115 ms 46780 KB Output is correct
32 Correct 125 ms 46828 KB Output is correct
33 Correct 131 ms 45676 KB Output is correct
34 Correct 224 ms 77672 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22856 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 3 ms 22876 KB Output is correct
6 Correct 3 ms 22876 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 4 ms 22876 KB Output is correct
10 Correct 4 ms 23124 KB Output is correct
11 Correct 4 ms 22876 KB Output is correct
12 Correct 3 ms 22876 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 3 ms 22876 KB Output is correct
15 Correct 3 ms 22876 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 3 ms 22876 KB Output is correct
18 Correct 3 ms 22876 KB Output is correct
19 Correct 3 ms 22872 KB Output is correct
20 Correct 3 ms 22896 KB Output is correct
21 Correct 5 ms 22876 KB Output is correct
22 Correct 4 ms 23132 KB Output is correct
23 Correct 4 ms 22876 KB Output is correct
24 Correct 4 ms 22876 KB Output is correct
25 Correct 4 ms 23128 KB Output is correct
26 Correct 4 ms 23132 KB Output is correct
27 Correct 4 ms 22872 KB Output is correct
28 Correct 4 ms 22872 KB Output is correct
29 Correct 4 ms 22872 KB Output is correct
30 Correct 4 ms 22876 KB Output is correct
31 Correct 4 ms 22876 KB Output is correct
32 Correct 4 ms 22876 KB Output is correct
33 Correct 4 ms 23132 KB Output is correct
34 Correct 3 ms 22872 KB Output is correct
35 Correct 4 ms 22876 KB Output is correct
36 Correct 3 ms 22876 KB Output is correct
37 Correct 4 ms 22876 KB Output is correct
38 Correct 4 ms 22876 KB Output is correct
39 Correct 64 ms 39764 KB Output is correct
40 Correct 66 ms 40384 KB Output is correct
41 Correct 68 ms 40260 KB Output is correct
42 Correct 66 ms 40784 KB Output is correct
43 Correct 99 ms 54352 KB Output is correct
44 Correct 80 ms 46992 KB Output is correct
45 Correct 53 ms 39552 KB Output is correct
46 Correct 36 ms 47444 KB Output is correct
47 Correct 128 ms 46440 KB Output is correct
48 Correct 160 ms 82256 KB Output is correct
49 Correct 148 ms 80724 KB Output is correct
50 Correct 113 ms 46676 KB Output is correct
51 Correct 115 ms 46780 KB Output is correct
52 Correct 125 ms 46828 KB Output is correct
53 Correct 131 ms 45676 KB Output is correct
54 Correct 224 ms 77672 KB Output is correct
55 Correct 12 ms 25432 KB Output is correct
56 Correct 7 ms 23900 KB Output is correct
57 Correct 49 ms 38740 KB Output is correct
58 Correct 34 ms 36292 KB Output is correct
59 Correct 55 ms 54100 KB Output is correct
60 Correct 148 ms 81748 KB Output is correct
61 Correct 151 ms 50328 KB Output is correct
62 Correct 116 ms 47376 KB Output is correct
63 Correct 139 ms 47424 KB Output is correct
64 Correct 312 ms 96424 KB Output is correct
65 Correct 337 ms 98832 KB Output is correct
66 Correct 171 ms 75348 KB Output is correct
67 Correct 106 ms 48832 KB Output is correct
68 Correct 226 ms 65872 KB Output is correct
69 Correct 228 ms 64340 KB Output is correct
70 Correct 205 ms 64596 KB Output is correct