oj.uz

Submission #807034

# Submission time Handle Problem Language Result Execution time Memory
807034 2023-08-04T12:33:50 Z YassirSalama Dreaming (IOI13_dreaming) C++17
47 / 100
 754 ms 19724 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 ll INF=1e9;
const int MAXN=1e5+100;
int n,m,l;
vector<vector<pair<int,int>>> v(MAXN);
vector<pair<ll,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;
    // dbg(node,par,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){
            // dbg(x.F,node,ew,x.S);
            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;
int par[MAXN];
int f=0;
void find_diameter(int node){
    pair<ll,ll> p=dfs(node,node);
    int f=p.S;
    memset(parr,0,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));
    bigdia=p.F;
    int nodea=0;
    int nodeb=0;
    int a,b,c,e;
    ll besta=INF;
    ll bestb=INF;
    for(auto x:dia){
        a=depth[dia.back()]-depth[x];
        b=depth[x];
        if(besta>max(a,b)){
            besta=max(a,b);
            nodea=x;
        }
        par[x]=dia[0];
    }
    // if(besta==INF){
        // dbg(node);
    // }
    // assert(besta==INF);
    diameters.pb({besta,nodea});
    // dbg(besta,nodea);
    // OVL(dia," ")
    f++;
}
struct Edge{
    ll a,b;
    ll c;
    bool operator < (const Edge& other) const{
        return c<other.c;
    }
};
int find(int node){
    if(node==par[node]) return node;
    return par[node]=find(par[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]){
            find_diameter(i);
        }
    }
    vector<Edge> edges;
    int d=diameters.size();
    // cout<<d<<endl;
    bool ok=true;
    for(int i=0;i<n;i++){
        ok&=(v[i].size()<=1);
    }
    sort(all(diameters),greater<pair<int,int>>());
    for(int i=0;i<d-1;i++){
        int nodea=diameters[i].S;
        ll besta=diameters[i].F;
        int nodeb=-1;
        ll bestb=INF;
        edges.push_back({.a=nodea,.b=diameters[i+1].S,.c=besta+(i+1)*l+diameters[i+1].F});
        // dbg(nodea,nodeb);
    }
    sort(all(edges));
    for(auto& edge:edges){
        if(find(edge.a)==find(edge.b)) continue;
        int a=find(edge.a);
        int b=find(edge.b);
        par[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);
    //working for sub4
    //here we have every element have at most one
    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:61:9: warning: unused variable 'nodeb' [-Wunused-variable]
   61 |     int nodeb=0;
      |         ^~~~~
dreaming.cpp:62:13: warning: unused variable 'c' [-Wunused-variable]
   62 |     int a,b,c,e;
      |             ^
dreaming.cpp:62:15: warning: unused variable 'e' [-Wunused-variable]
   62 |     int a,b,c,e;
      |               ^
dreaming.cpp:64:8: warning: unused variable 'bestb' [-Wunused-variable]
   64 |     ll bestb=INF;
      |        ^~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:120:13: warning: unused variable 'nodeb' [-Wunused-variable]
  120 |         int nodeb=-1;
      |             ^~~~~
dreaming.cpp:121:12: warning: unused variable 'bestb' [-Wunused-variable]
  121 |         ll bestb=INF;
      |            ^~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 18568 KB Output is correct
2 Correct 45 ms 18592 KB Output is correct
3 Correct 28 ms 13672 KB Output is correct
4 Correct 8 ms 6376 KB Output is correct
5 Correct 7 ms 5332 KB Output is correct
6 Correct 15 ms 7544 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 28 ms 8908 KB Output is correct
9 Correct 27 ms 10940 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 37 ms 13248 KB Output is correct
12 Correct 43 ms 15340 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4340 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 3 ms 4308 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 3 ms 4276 KB Output is correct
18 Correct 3 ms 4336 KB Output is correct
19 Correct 3 ms 4308 KB Output is correct
20 Correct 2 ms 4344 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 4336 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 42 ms 18568 KB Output is correct
2 Correct 45 ms 18592 KB Output is correct
3 Correct 28 ms 13672 KB Output is correct
4 Correct 8 ms 6376 KB Output is correct
5 Correct 7 ms 5332 KB Output is correct
6 Correct 15 ms 7544 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 28 ms 8908 KB Output is correct
9 Correct 27 ms 10940 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 37 ms 13248 KB Output is correct
12 Correct 43 ms 15340 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4340 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 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 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 3 ms 4276 KB Output is correct
31 Correct 3 ms 4336 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 2 ms 4344 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 4336 KB Output is correct
37 Correct 2 ms 4308 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct
39 Correct 44 ms 18612 KB Output is correct
40 Correct 47 ms 18572 KB Output is correct
41 Correct 28 ms 13708 KB Output is correct
42 Correct 9 ms 6436 KB Output is correct
43 Correct 2 ms 4340 KB Output is correct
44 Correct 3 ms 4308 KB Output is correct
45 Correct 3 ms 4308 KB Output is correct
46 Correct 2 ms 4308 KB Output is correct
47 Correct 3 ms 4308 KB Output is correct
48 Correct 3 ms 4308 KB Output is correct
49 Correct 2 ms 4308 KB Output is correct
50 Correct 2 ms 4308 KB Output is correct
51 Correct 2 ms 4340 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 48 ms 10920 KB Output is correct
58 Correct 45 ms 10872 KB Output is correct
59 Correct 49 ms 11000 KB Output is correct
60 Correct 53 ms 10968 KB Output is correct
61 Correct 45 ms 10828 KB Output is correct
62 Correct 46 ms 10808 KB Output is correct
63 Correct 47 ms 10444 KB Output is correct
64 Correct 59 ms 10700 KB Output is correct
65 Correct 46 ms 10416 KB Output is correct
66 Correct 46 ms 10396 KB Output is correct
67 Correct 49 ms 10968 KB Output is correct
68 Correct 54 ms 10948 KB Output is correct
69 Correct 54 ms 10956 KB Output is correct
70 Correct 54 ms 10960 KB Output is correct
71 Correct 3 ms 4308 KB Output is correct
72 Correct 3 ms 4436 KB Output is correct
73 Correct 3 ms 4476 KB Output is correct
74 Correct 3 ms 4528 KB Output is correct
75 Correct 3 ms 4436 KB Output is correct
76 Correct 3 ms 4436 KB Output is correct
77 Correct 3 ms 4436 KB Output is correct
78 Correct 3 ms 4436 KB Output is correct
79 Correct 4 ms 4472 KB Output is correct
80 Correct 51 ms 10868 KB Output is correct
81 Correct 48 ms 10892 KB Output is correct
82 Correct 46 ms 10752 KB Output is correct
83 Correct 55 ms 10868 KB Output is correct
84 Correct 4 ms 4436 KB Output is correct
85 Correct 3 ms 4436 KB Output is correct
86 Correct 4 ms 4436 KB Output is correct
87 Correct 3 ms 4472 KB Output is correct
88 Correct 3 ms 4472 KB Output is correct
89 Correct 3 ms 4436 KB Output is correct
90 Correct 3 ms 4436 KB Output is correct
91 Correct 3 ms 4416 KB Output is correct
92 Correct 3 ms 4476 KB Output is correct
93 Correct 3 ms 4436 KB Output is correct
94 Correct 2 ms 4340 KB Output is correct
95 Correct 3 ms 4308 KB Output is correct
96 Correct 2 ms 4308 KB Output is correct
97 Correct 2 ms 4308 KB Output is correct
98 Correct 2 ms 4308 KB Output is correct
99 Correct 3 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 3 ms 4340 KB Output is correct
104 Correct 6 ms 5432 KB Output is correct
105 Correct 15 ms 7484 KB Output is correct
106 Correct 2 ms 4352 KB Output is correct
107 Correct 20 ms 8956 KB Output is correct
108 Correct 27 ms 10964 KB Output is correct
109 Correct 2 ms 4344 KB Output is correct
110 Correct 37 ms 13264 KB Output is correct
111 Correct 46 ms 15412 KB Output is correct
112 Correct 2 ms 4436 KB Output is correct
113 Correct 67 ms 19724 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 754 ms 17260 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 4308 KB Output is correct
2 Correct 2 ms 4340 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 3 ms 4308 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 3 ms 4276 KB Output is correct
18 Correct 3 ms 4336 KB Output is correct
19 Correct 3 ms 4308 KB Output is correct
20 Correct 2 ms 4344 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 4336 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 4340 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 18568 KB Output is correct
2 Correct 45 ms 18592 KB Output is correct
3 Correct 28 ms 13672 KB Output is correct
4 Correct 8 ms 6376 KB Output is correct
5 Correct 7 ms 5332 KB Output is correct
6 Correct 15 ms 7544 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 28 ms 8908 KB Output is correct
9 Correct 27 ms 10940 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 37 ms 13248 KB Output is correct
12 Correct 43 ms 15340 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4340 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 3 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 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 3 ms 4276 KB Output is correct
31 Correct 3 ms 4336 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 2 ms 4344 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 4336 KB Output is correct
37 Correct 2 ms 4308 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct
39 Correct 44 ms 18612 KB Output is correct
40 Correct 47 ms 18572 KB Output is correct
41 Correct 28 ms 13708 KB Output is correct
42 Correct 9 ms 6436 KB Output is correct
43 Correct 2 ms 4340 KB Output is correct
44 Correct 3 ms 4308 KB Output is correct
45 Correct 3 ms 4308 KB Output is correct
46 Correct 2 ms 4308 KB Output is correct
47 Correct 3 ms 4308 KB Output is correct
48 Correct 3 ms 4308 KB Output is correct
49 Correct 2 ms 4308 KB Output is correct
50 Correct 2 ms 4308 KB Output is correct
51 Correct 2 ms 4340 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 48 ms 10920 KB Output is correct
58 Correct 45 ms 10872 KB Output is correct
59 Correct 49 ms 11000 KB Output is correct
60 Correct 53 ms 10968 KB Output is correct
61 Correct 45 ms 10828 KB Output is correct
62 Correct 46 ms 10808 KB Output is correct
63 Correct 47 ms 10444 KB Output is correct
64 Correct 59 ms 10700 KB Output is correct
65 Correct 46 ms 10416 KB Output is correct
66 Correct 46 ms 10396 KB Output is correct
67 Correct 49 ms 10968 KB Output is correct
68 Correct 54 ms 10948 KB Output is correct
69 Correct 54 ms 10956 KB Output is correct
70 Correct 54 ms 10960 KB Output is correct
71 Correct 3 ms 4308 KB Output is correct
72 Correct 3 ms 4436 KB Output is correct
73 Correct 3 ms 4476 KB Output is correct
74 Correct 3 ms 4528 KB Output is correct
75 Correct 3 ms 4436 KB Output is correct
76 Correct 3 ms 4436 KB Output is correct
77 Correct 3 ms 4436 KB Output is correct
78 Correct 3 ms 4436 KB Output is correct
79 Correct 4 ms 4472 KB Output is correct
80 Correct 51 ms 10868 KB Output is correct
81 Correct 48 ms 10892 KB Output is correct
82 Correct 46 ms 10752 KB Output is correct
83 Correct 55 ms 10868 KB Output is correct
84 Correct 4 ms 4436 KB Output is correct
85 Correct 3 ms 4436 KB Output is correct
86 Correct 4 ms 4436 KB Output is correct
87 Correct 3 ms 4472 KB Output is correct
88 Correct 3 ms 4472 KB Output is correct
89 Correct 3 ms 4436 KB Output is correct
90 Correct 3 ms 4436 KB Output is correct
91 Correct 3 ms 4416 KB Output is correct
92 Correct 3 ms 4476 KB Output is correct
93 Correct 3 ms 4436 KB Output is correct
94 Correct 2 ms 4340 KB Output is correct
95 Correct 3 ms 4308 KB Output is correct
96 Correct 2 ms 4308 KB Output is correct
97 Correct 2 ms 4308 KB Output is correct
98 Correct 2 ms 4308 KB Output is correct
99 Correct 3 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 3 ms 4340 KB Output is correct
104 Correct 6 ms 5432 KB Output is correct
105 Correct 15 ms 7484 KB Output is correct
106 Correct 2 ms 4352 KB Output is correct
107 Correct 20 ms 8956 KB Output is correct
108 Correct 27 ms 10964 KB Output is correct
109 Correct 2 ms 4344 KB Output is correct
110 Correct 37 ms 13264 KB Output is correct
111 Correct 46 ms 15412 KB Output is correct
112 Correct 2 ms 4436 KB Output is correct
113 Correct 67 ms 19724 KB Output is correct
114 Incorrect 754 ms 17260 KB Output isn't correct
115 Halted 0 ms 0 KB -