oj.uz

Submission #805203

# Submission time Handle Problem Language Result Execution time Memory
805203 2023-08-03T13:59:52 Z YassirSalama Dreaming (IOI13_dreaming) C++17
47 / 100
 754 ms 20640 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
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__);
#define pb push_back
#define F first
#define S second
const int INF=1e9;
const int MAXN=1e5+100;
int n,m,l;
vector<vector<pair<int,int>>> v(MAXN);
vector<vector<ll>> diameters;
bool visited[MAXN];
ll parr[MAXN];
ll depth[MAXN];
pair<ll,ll> dfs(int node,int par,ll ew=0){//depth, best node
    visited[node]=true;
    parr[node]=par;
    depth[node]=ew;
    if(v[node].size()==1&&v[node][0].F==par){
        return {ew,node};
    }
    ll ans=0;
    ll best=node;
    for(auto x:v[node]){
        if(x.F!=par){
            pair<ll,ll> p=dfs(x.F,node,ew+x.S);
            if(p.F>ans){
                ans=p.F;
                best=p.S;
            }
        }
    }
    return {ans,best};
}
ll bigdia=0;
void find_diameter(int node){
    pair<ll,ll> p=dfs(node,node);
    int f=p.S;
    memset(parr,-1,sizeof(parr));
    p=dfs(p.S,p.S);
    // dbg(f,p.S);
    vector<ll> dia;
    while(p.S!=parr[p.S]) {
        dia.push_back(p.S);
        p.S=parr[p.S];
    }
    dia.push_back(p.S);
    reverse(all(dia));
    diameters.push_back(dia);
    bigdia=p.F;
}
struct Edge{
    ll a,b;
    ll c;
    bool operator < (const Edge& other) const{
        return c<other.c;
    }
};
int find(int node){
    if(node==parr[node]) return node;
    return parr[node]=find(parr[node]);
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    n=N;
    m=M;
    l=L;
    memset(visited,false,sizeof(visited));
    for(int i=0;i<m;i++){
        v[A[i]].push_back({B[i],T[i]});
        v[B[i]].push_back({A[i],T[i]});
    }
    memset(depth,0,sizeof(depth));
    for(int i=0;i<n;i++){
        if(!visited[i]){
            // dbg(i);
            find_diameter(i);
            // OVL(diameters.back()," ")
        }
    }
    vector<Edge> edges;
    int d=diameters.size();
    set<pair<int,int>> p;
    for(int i=0;i+1<d;i+=2){
        int nodea=-1;
        int nodeb=-1;
        int a,b,c,e;
        ll besta=INF;
        ll bestb=INF;
        for(auto x:diameters[i]){
            a=depth[diameters[i].back()]-depth[x];
            b=depth[x];
            if(besta>max(a,b)){
                besta=max(a,b);
                nodea=x;
            }
        }
        for(auto y:diameters[i+1]){
            c=depth[diameters[i+1].back()]-depth[y];
            e=depth[y];
            if(bestb>max(c,e)){
                bestb=max(c,e);
                nodeb=y;
            }
        }
        // dbg(nodea,nodeb,besta+l+bestb);
        edges.push_back({.a=nodea,.b=nodeb,.c=besta+l+bestb});
    }
    sort(all(edges));
    for(int i=0;i<n;i++) parr[i]=i;
    for(auto x:diameters){
        for(auto y:x) {
            parr[y]=x[0];
        }
    }
    for(auto& edge:edges){
        if(find(edge.a)==find(edge.b)) continue;
        int a=find(edge.a);
        int b=find(edge.b);
        parr[b]=a;
        // dbg(edge.a,edge.b,edge.c);
        // dbg(a,b,edge.a,edge.b);
        v[edge.a].pb({edge.b,l});
        v[edge.b].pb({edge.a,l});
    }
    memset(depth,0LL,sizeof(depth));
    find_diameter(0);
    return bigdia;
}

#ifdef IOI

#define fail(s, x...) do { \
        fprintf(stderr, s "\n", ## x); \
        exit(1); \
    } while(0)

#define MAX_N 100000

static int A[MAX_N];
static int B[MAX_N];
static int T[MAX_N];

int main() {
    int N, M, L, i;
    int res;

    FILE *f = fopen("dreaming.in", "r");
    if (!f)
        fail("Failed to open input file.");

    res = fscanf(f, "%d%d%d", &N, &M, &L);
    for (i = 0; i < M; i++)
        res = fscanf(f, "%d%d%d", &A[i], &B[i], &T[i]);
    fclose(f);

    int answer = travelTime(N, M, L, A, B, T);
    printf("%d\n", answer);

    return 0;
}

#endif

Compilation message

dreaming.cpp: In function 'void find_diameter(int)':
dreaming.cpp:44:9: warning: unused variable 'f' [-Wunused-variable]
   44 |     int f=p.S;
      |         ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17788 KB Output is correct
2 Correct 42 ms 17740 KB Output is correct
3 Correct 27 ms 12976 KB Output is correct
4 Correct 7 ms 6248 KB Output is correct
5 Correct 6 ms 5364 KB Output is correct
6 Correct 11 ms 7540 KB Output is correct
7 Correct 2 ms 4340 KB Output is correct
8 Correct 23 ms 9164 KB Output is correct
9 Correct 25 ms 11028 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 39 ms 13508 KB Output is correct
12 Correct 51 ms 15468 KB Output is correct
13 Correct 3 ms 4456 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4248 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4336 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4308 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4308 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4308 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 2 ms 4308 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17788 KB Output is correct
2 Correct 42 ms 17740 KB Output is correct
3 Correct 27 ms 12976 KB Output is correct
4 Correct 7 ms 6248 KB Output is correct
5 Correct 6 ms 5364 KB Output is correct
6 Correct 11 ms 7540 KB Output is correct
7 Correct 2 ms 4340 KB Output is correct
8 Correct 23 ms 9164 KB Output is correct
9 Correct 25 ms 11028 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 39 ms 13508 KB Output is correct
12 Correct 51 ms 15468 KB Output is correct
13 Correct 3 ms 4456 KB Output is correct
14 Correct 2 ms 4248 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4336 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4308 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 2 ms 4308 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 2 ms 4308 KB Output is correct
29 Correct 2 ms 4308 KB Output is correct
30 Correct 2 ms 4308 KB Output is correct
31 Correct 2 ms 4308 KB Output is correct
32 Correct 2 ms 4308 KB Output is correct
33 Correct 2 ms 4308 KB Output is correct
34 Correct 2 ms 4308 KB Output is correct
35 Correct 2 ms 4308 KB Output is correct
36 Correct 2 ms 4308 KB Output is correct
37 Correct 2 ms 4308 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct
39 Correct 42 ms 19044 KB Output is correct
40 Correct 42 ms 18984 KB Output is correct
41 Correct 29 ms 13916 KB Output is correct
42 Correct 7 ms 6504 KB Output is correct
43 Correct 2 ms 4308 KB Output is correct
44 Correct 2 ms 4308 KB Output is correct
45 Correct 2 ms 4308 KB Output is correct
46 Correct 3 ms 4308 KB Output is correct
47 Correct 2 ms 4308 KB Output is correct
48 Correct 2 ms 4308 KB Output is correct
49 Correct 2 ms 4308 KB Output is correct
50 Correct 2 ms 4340 KB Output is correct
51 Correct 2 ms 4308 KB Output is correct
52 Correct 2 ms 4308 KB Output is correct
53 Correct 2 ms 4308 KB Output is correct
54 Correct 2 ms 4308 KB Output is correct
55 Correct 2 ms 4308 KB Output is correct
56 Correct 2 ms 4308 KB Output is correct
57 Correct 44 ms 10824 KB Output is correct
58 Correct 42 ms 10840 KB Output is correct
59 Correct 55 ms 10796 KB Output is correct
60 Correct 44 ms 10848 KB Output is correct
61 Correct 45 ms 10876 KB Output is correct
62 Correct 43 ms 10828 KB Output is correct
63 Correct 42 ms 10468 KB Output is correct
64 Correct 42 ms 10464 KB Output is correct
65 Correct 46 ms 10800 KB Output is correct
66 Correct 43 ms 10776 KB Output is correct
67 Correct 55 ms 10740 KB Output is correct
68 Correct 46 ms 10700 KB Output is correct
69 Correct 47 ms 11152 KB Output is correct
70 Correct 49 ms 11084 KB Output is correct
71 Correct 2 ms 4340 KB Output is correct
72 Correct 3 ms 4436 KB Output is correct
73 Correct 3 ms 4564 KB Output is correct
74 Correct 3 ms 4436 KB Output is correct
75 Correct 3 ms 4436 KB Output is correct
76 Correct 3 ms 4524 KB Output is correct
77 Correct 3 ms 4436 KB Output is correct
78 Correct 4 ms 4484 KB Output is correct
79 Correct 3 ms 4436 KB Output is correct
80 Correct 48 ms 10788 KB Output is correct
81 Correct 52 ms 10780 KB Output is correct
82 Correct 58 ms 10956 KB Output is correct
83 Correct 43 ms 10828 KB Output is correct
84 Correct 3 ms 4388 KB Output is correct
85 Correct 3 ms 4436 KB Output is correct
86 Correct 3 ms 4436 KB Output is correct
87 Correct 3 ms 4436 KB Output is correct
88 Correct 2 ms 4436 KB Output is correct
89 Correct 3 ms 4436 KB Output is correct
90 Correct 3 ms 4436 KB Output is correct
91 Correct 4 ms 4436 KB Output is correct
92 Correct 3 ms 4436 KB Output is correct
93 Correct 3 ms 4436 KB Output is correct
94 Correct 3 ms 4340 KB Output is correct
95 Correct 3 ms 4340 KB Output is correct
96 Correct 2 ms 4308 KB Output is correct
97 Correct 2 ms 4340 KB Output is correct
98 Correct 2 ms 4308 KB Output is correct
99 Correct 2 ms 4308 KB Output is correct
100 Correct 2 ms 4308 KB Output is correct
101 Correct 2 ms 4308 KB Output is correct
102 Correct 2 ms 4308 KB Output is correct
103 Correct 2 ms 4308 KB Output is correct
104 Correct 6 ms 5368 KB Output is correct
105 Correct 11 ms 7640 KB Output is correct
106 Correct 2 ms 4340 KB Output is correct
107 Correct 20 ms 9036 KB Output is correct
108 Correct 25 ms 10956 KB Output is correct
109 Correct 2 ms 4308 KB Output is correct
110 Correct 38 ms 13616 KB Output is correct
111 Correct 42 ms 15464 KB Output is correct
112 Correct 3 ms 4436 KB Output is correct
113 Correct 118 ms 20640 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 754 ms 11668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4248 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4336 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4308 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4308 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4308 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 2 ms 4308 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Incorrect 5 ms 4308 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17788 KB Output is correct
2 Correct 42 ms 17740 KB Output is correct
3 Correct 27 ms 12976 KB Output is correct
4 Correct 7 ms 6248 KB Output is correct
5 Correct 6 ms 5364 KB Output is correct
6 Correct 11 ms 7540 KB Output is correct
7 Correct 2 ms 4340 KB Output is correct
8 Correct 23 ms 9164 KB Output is correct
9 Correct 25 ms 11028 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 39 ms 13508 KB Output is correct
12 Correct 51 ms 15468 KB Output is correct
13 Correct 3 ms 4456 KB Output is correct
14 Correct 2 ms 4248 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4336 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4308 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 2 ms 4308 KB Output is correct
23 Correct 2 ms 4308 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 2 ms 4308 KB Output is correct
29 Correct 2 ms 4308 KB Output is correct
30 Correct 2 ms 4308 KB Output is correct
31 Correct 2 ms 4308 KB Output is correct
32 Correct 2 ms 4308 KB Output is correct
33 Correct 2 ms 4308 KB Output is correct
34 Correct 2 ms 4308 KB Output is correct
35 Correct 2 ms 4308 KB Output is correct
36 Correct 2 ms 4308 KB Output is correct
37 Correct 2 ms 4308 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct
39 Correct 42 ms 19044 KB Output is correct
40 Correct 42 ms 18984 KB Output is correct
41 Correct 29 ms 13916 KB Output is correct
42 Correct 7 ms 6504 KB Output is correct
43 Correct 2 ms 4308 KB Output is correct
44 Correct 2 ms 4308 KB Output is correct
45 Correct 2 ms 4308 KB Output is correct
46 Correct 3 ms 4308 KB Output is correct
47 Correct 2 ms 4308 KB Output is correct
48 Correct 2 ms 4308 KB Output is correct
49 Correct 2 ms 4308 KB Output is correct
50 Correct 2 ms 4340 KB Output is correct
51 Correct 2 ms 4308 KB Output is correct
52 Correct 2 ms 4308 KB Output is correct
53 Correct 2 ms 4308 KB Output is correct
54 Correct 2 ms 4308 KB Output is correct
55 Correct 2 ms 4308 KB Output is correct
56 Correct 2 ms 4308 KB Output is correct
57 Correct 44 ms 10824 KB Output is correct
58 Correct 42 ms 10840 KB Output is correct
59 Correct 55 ms 10796 KB Output is correct
60 Correct 44 ms 10848 KB Output is correct
61 Correct 45 ms 10876 KB Output is correct
62 Correct 43 ms 10828 KB Output is correct
63 Correct 42 ms 10468 KB Output is correct
64 Correct 42 ms 10464 KB Output is correct
65 Correct 46 ms 10800 KB Output is correct
66 Correct 43 ms 10776 KB Output is correct
67 Correct 55 ms 10740 KB Output is correct
68 Correct 46 ms 10700 KB Output is correct
69 Correct 47 ms 11152 KB Output is correct
70 Correct 49 ms 11084 KB Output is correct
71 Correct 2 ms 4340 KB Output is correct
72 Correct 3 ms 4436 KB Output is correct
73 Correct 3 ms 4564 KB Output is correct
74 Correct 3 ms 4436 KB Output is correct
75 Correct 3 ms 4436 KB Output is correct
76 Correct 3 ms 4524 KB Output is correct
77 Correct 3 ms 4436 KB Output is correct
78 Correct 4 ms 4484 KB Output is correct
79 Correct 3 ms 4436 KB Output is correct
80 Correct 48 ms 10788 KB Output is correct
81 Correct 52 ms 10780 KB Output is correct
82 Correct 58 ms 10956 KB Output is correct
83 Correct 43 ms 10828 KB Output is correct
84 Correct 3 ms 4388 KB Output is correct
85 Correct 3 ms 4436 KB Output is correct
86 Correct 3 ms 4436 KB Output is correct
87 Correct 3 ms 4436 KB Output is correct
88 Correct 2 ms 4436 KB Output is correct
89 Correct 3 ms 4436 KB Output is correct
90 Correct 3 ms 4436 KB Output is correct
91 Correct 4 ms 4436 KB Output is correct
92 Correct 3 ms 4436 KB Output is correct
93 Correct 3 ms 4436 KB Output is correct
94 Correct 3 ms 4340 KB Output is correct
95 Correct 3 ms 4340 KB Output is correct
96 Correct 2 ms 4308 KB Output is correct
97 Correct 2 ms 4340 KB Output is correct
98 Correct 2 ms 4308 KB Output is correct
99 Correct 2 ms 4308 KB Output is correct
100 Correct 2 ms 4308 KB Output is correct
101 Correct 2 ms 4308 KB Output is correct
102 Correct 2 ms 4308 KB Output is correct
103 Correct 2 ms 4308 KB Output is correct
104 Correct 6 ms 5368 KB Output is correct
105 Correct 11 ms 7640 KB Output is correct
106 Correct 2 ms 4340 KB Output is correct
107 Correct 20 ms 9036 KB Output is correct
108 Correct 25 ms 10956 KB Output is correct
109 Correct 2 ms 4308 KB Output is correct
110 Correct 38 ms 13616 KB Output is correct
111 Correct 42 ms 15464 KB Output is correct
112 Correct 3 ms 4436 KB Output is correct
113 Correct 118 ms 20640 KB Output is correct
114 Incorrect 754 ms 11668 KB Output isn't correct
115 Halted 0 ms 0 KB -