oj.uz

답안 #805362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805362 2023-08-03T15:48:46 Z YassirSalama 꿈 (IOI13_dreaming) C++17
47 / 100
 96 ms 19048 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
    // if(visited[node]) return {ew,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){
    // memset(visited,false,sizeof(visited));
    pair<ll,ll> p=dfs(node,node);
    int f=p.S;
    // memset(parr,0,sizeof(parr));
    // memset(visited,false,sizeof(visited));
    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);
    }
    // if(ok){
        // for(int i=0;i<diameters.size();i++) dbg(diameters[i].F,diameters[i].S);
        //answer of sub4 here
        // for(int i=0;i+1<diameters.size();i++){
            // v[diameters[i].S].push_back({diameters[i+1].S,l});
            // v[diameters[i+1].S].push_back({diameters[i].S,l});

            // dbg(diameters[i].S,diameters[i+1].S,l);
        // }
        // for(int i=0;i<n;i++) {
        //     cout<<i<<" --> ";
        //     for(auto x:v[i]){
        //         cout<<" [ "<<x.F<<" ; "<<x.S<<" ] ,";
        //     }
        //     cout<<endl;
        // }
        // memset(depth,0LL,sizeof(depth));
        // dbg("START");
        // find_diameter(0);
        // dbg(f);
        // return bigdia;
    // }
    for(int i=0;i<d-1;i++){
        int nodea=diameters[i].S;
        ll besta=diameters[i].F;
        int nodeb=-1;
        ll bestb=INF;
        int j=i+1;
        // dbg(nodea,besta);
        // for(int j=i+1;j<d;j++){
            // if(bestb>diameters[j].F){
                // bestb=diameters[j].F;
                // nodeb=diameters[j].S;
            // }
            // dbg(nodea,nodeb,besta,bestb);
        edges.push_back({.a=nodea,.b=diameters[j].S,.c=besta+diameters[j].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});
        f++;
    }
    // dbg(f);
    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:64:9: warning: unused variable 'nodeb' [-Wunused-variable]
   64 |     int nodeb=0;
      |         ^~~~~
dreaming.cpp:65:13: warning: unused variable 'c' [-Wunused-variable]
   65 |     int a,b,c,e;
      |             ^
dreaming.cpp:65:15: warning: unused variable 'e' [-Wunused-variable]
   65 |     int a,b,c,e;
      |               ^
dreaming.cpp:67:8: warning: unused variable 'bestb' [-Wunused-variable]
   67 |     ll bestb=INF;
      |        ^~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:144:13: warning: unused variable 'nodeb' [-Wunused-variable]
  144 |         int nodeb=-1;
      |             ^~~~~
dreaming.cpp:145:12: warning: unused variable 'bestb' [-Wunused-variable]
  145 |         ll bestb=INF;
      |            ^~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 17348 KB Output is correct
2 Correct 40 ms 17276 KB Output is correct
3 Correct 28 ms 12456 KB Output is correct
4 Correct 7 ms 5500 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 13 ms 6876 KB Output is correct
7 Correct 2 ms 3572 KB Output is correct
8 Correct 20 ms 8536 KB Output is correct
9 Correct 25 ms 10276 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 37 ms 12388 KB Output is correct
12 Correct 44 ms 14612 KB Output is correct
13 Correct 3 ms 3668 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 17348 KB Output is correct
2 Correct 40 ms 17276 KB Output is correct
3 Correct 28 ms 12456 KB Output is correct
4 Correct 7 ms 5500 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 13 ms 6876 KB Output is correct
7 Correct 2 ms 3572 KB Output is correct
8 Correct 20 ms 8536 KB Output is correct
9 Correct 25 ms 10276 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 37 ms 12388 KB Output is correct
12 Correct 44 ms 14612 KB Output is correct
13 Correct 3 ms 3668 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 2 ms 3540 KB Output is correct
30 Correct 2 ms 3540 KB Output is correct
31 Correct 2 ms 3540 KB Output is correct
32 Correct 2 ms 3540 KB Output is correct
33 Correct 2 ms 3540 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 3540 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 2 ms 3540 KB Output is correct
38 Correct 2 ms 3540 KB Output is correct
39 Correct 42 ms 17916 KB Output is correct
40 Correct 43 ms 17792 KB Output is correct
41 Correct 26 ms 12964 KB Output is correct
42 Correct 6 ms 5736 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3540 KB Output is correct
45 Correct 2 ms 3528 KB Output is correct
46 Correct 2 ms 3540 KB Output is correct
47 Correct 2 ms 3572 KB Output is correct
48 Correct 2 ms 3540 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 2 ms 3540 KB Output is correct
51 Correct 2 ms 3540 KB Output is correct
52 Correct 2 ms 3540 KB Output is correct
53 Correct 2 ms 3540 KB Output is correct
54 Correct 2 ms 3564 KB Output is correct
55 Correct 2 ms 3540 KB Output is correct
56 Correct 2 ms 3540 KB Output is correct
57 Correct 43 ms 10336 KB Output is correct
58 Correct 43 ms 10248 KB Output is correct
59 Correct 52 ms 10304 KB Output is correct
60 Correct 58 ms 10360 KB Output is correct
61 Correct 44 ms 10220 KB Output is correct
62 Correct 44 ms 10200 KB Output is correct
63 Correct 43 ms 9756 KB Output is correct
64 Correct 45 ms 9728 KB Output is correct
65 Correct 43 ms 9804 KB Output is correct
66 Correct 45 ms 9848 KB Output is correct
67 Correct 47 ms 10320 KB Output is correct
68 Correct 50 ms 10228 KB Output is correct
69 Correct 48 ms 10400 KB Output is correct
70 Correct 48 ms 10316 KB Output is correct
71 Correct 2 ms 3540 KB Output is correct
72 Correct 3 ms 3796 KB Output is correct
73 Correct 3 ms 3796 KB Output is correct
74 Correct 3 ms 3668 KB Output is correct
75 Correct 3 ms 3668 KB Output is correct
76 Correct 3 ms 3704 KB Output is correct
77 Correct 3 ms 3796 KB Output is correct
78 Correct 3 ms 3752 KB Output is correct
79 Correct 3 ms 3796 KB Output is correct
80 Correct 65 ms 10316 KB Output is correct
81 Correct 45 ms 10304 KB Output is correct
82 Correct 46 ms 10184 KB Output is correct
83 Correct 44 ms 10164 KB Output is correct
84 Correct 3 ms 3716 KB Output is correct
85 Correct 2 ms 3708 KB Output is correct
86 Correct 3 ms 3668 KB Output is correct
87 Correct 3 ms 3668 KB Output is correct
88 Correct 2 ms 3668 KB Output is correct
89 Correct 3 ms 3708 KB Output is correct
90 Correct 3 ms 3668 KB Output is correct
91 Correct 3 ms 3668 KB Output is correct
92 Correct 4 ms 3744 KB Output is correct
93 Correct 3 ms 3668 KB Output is correct
94 Correct 2 ms 3560 KB Output is correct
95 Correct 2 ms 3564 KB Output is correct
96 Correct 2 ms 3572 KB Output is correct
97 Correct 2 ms 3568 KB Output is correct
98 Correct 2 ms 3564 KB Output is correct
99 Correct 2 ms 3540 KB Output is correct
100 Correct 2 ms 3540 KB Output is correct
101 Correct 2 ms 3568 KB Output is correct
102 Correct 2 ms 3540 KB Output is correct
103 Correct 2 ms 3568 KB Output is correct
104 Correct 6 ms 4736 KB Output is correct
105 Correct 12 ms 6884 KB Output is correct
106 Correct 2 ms 3540 KB Output is correct
107 Correct 21 ms 8536 KB Output is correct
108 Correct 25 ms 10324 KB Output is correct
109 Correct 2 ms 3540 KB Output is correct
110 Correct 39 ms 12464 KB Output is correct
111 Correct 40 ms 14616 KB Output is correct
112 Correct 2 ms 3668 KB Output is correct
113 Correct 96 ms 19048 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 17292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Incorrect 3 ms 3540 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 17348 KB Output is correct
2 Correct 40 ms 17276 KB Output is correct
3 Correct 28 ms 12456 KB Output is correct
4 Correct 7 ms 5500 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 13 ms 6876 KB Output is correct
7 Correct 2 ms 3572 KB Output is correct
8 Correct 20 ms 8536 KB Output is correct
9 Correct 25 ms 10276 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 37 ms 12388 KB Output is correct
12 Correct 44 ms 14612 KB Output is correct
13 Correct 3 ms 3668 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 2 ms 3540 KB Output is correct
30 Correct 2 ms 3540 KB Output is correct
31 Correct 2 ms 3540 KB Output is correct
32 Correct 2 ms 3540 KB Output is correct
33 Correct 2 ms 3540 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 3540 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 2 ms 3540 KB Output is correct
38 Correct 2 ms 3540 KB Output is correct
39 Correct 42 ms 17916 KB Output is correct
40 Correct 43 ms 17792 KB Output is correct
41 Correct 26 ms 12964 KB Output is correct
42 Correct 6 ms 5736 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3540 KB Output is correct
45 Correct 2 ms 3528 KB Output is correct
46 Correct 2 ms 3540 KB Output is correct
47 Correct 2 ms 3572 KB Output is correct
48 Correct 2 ms 3540 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 2 ms 3540 KB Output is correct
51 Correct 2 ms 3540 KB Output is correct
52 Correct 2 ms 3540 KB Output is correct
53 Correct 2 ms 3540 KB Output is correct
54 Correct 2 ms 3564 KB Output is correct
55 Correct 2 ms 3540 KB Output is correct
56 Correct 2 ms 3540 KB Output is correct
57 Correct 43 ms 10336 KB Output is correct
58 Correct 43 ms 10248 KB Output is correct
59 Correct 52 ms 10304 KB Output is correct
60 Correct 58 ms 10360 KB Output is correct
61 Correct 44 ms 10220 KB Output is correct
62 Correct 44 ms 10200 KB Output is correct
63 Correct 43 ms 9756 KB Output is correct
64 Correct 45 ms 9728 KB Output is correct
65 Correct 43 ms 9804 KB Output is correct
66 Correct 45 ms 9848 KB Output is correct
67 Correct 47 ms 10320 KB Output is correct
68 Correct 50 ms 10228 KB Output is correct
69 Correct 48 ms 10400 KB Output is correct
70 Correct 48 ms 10316 KB Output is correct
71 Correct 2 ms 3540 KB Output is correct
72 Correct 3 ms 3796 KB Output is correct
73 Correct 3 ms 3796 KB Output is correct
74 Correct 3 ms 3668 KB Output is correct
75 Correct 3 ms 3668 KB Output is correct
76 Correct 3 ms 3704 KB Output is correct
77 Correct 3 ms 3796 KB Output is correct
78 Correct 3 ms 3752 KB Output is correct
79 Correct 3 ms 3796 KB Output is correct
80 Correct 65 ms 10316 KB Output is correct
81 Correct 45 ms 10304 KB Output is correct
82 Correct 46 ms 10184 KB Output is correct
83 Correct 44 ms 10164 KB Output is correct
84 Correct 3 ms 3716 KB Output is correct
85 Correct 2 ms 3708 KB Output is correct
86 Correct 3 ms 3668 KB Output is correct
87 Correct 3 ms 3668 KB Output is correct
88 Correct 2 ms 3668 KB Output is correct
89 Correct 3 ms 3708 KB Output is correct
90 Correct 3 ms 3668 KB Output is correct
91 Correct 3 ms 3668 KB Output is correct
92 Correct 4 ms 3744 KB Output is correct
93 Correct 3 ms 3668 KB Output is correct
94 Correct 2 ms 3560 KB Output is correct
95 Correct 2 ms 3564 KB Output is correct
96 Correct 2 ms 3572 KB Output is correct
97 Correct 2 ms 3568 KB Output is correct
98 Correct 2 ms 3564 KB Output is correct
99 Correct 2 ms 3540 KB Output is correct
100 Correct 2 ms 3540 KB Output is correct
101 Correct 2 ms 3568 KB Output is correct
102 Correct 2 ms 3540 KB Output is correct
103 Correct 2 ms 3568 KB Output is correct
104 Correct 6 ms 4736 KB Output is correct
105 Correct 12 ms 6884 KB Output is correct
106 Correct 2 ms 3540 KB Output is correct
107 Correct 21 ms 8536 KB Output is correct
108 Correct 25 ms 10324 KB Output is correct
109 Correct 2 ms 3540 KB Output is correct
110 Correct 39 ms 12464 KB Output is correct
111 Correct 40 ms 14616 KB Output is correct
112 Correct 2 ms 3668 KB Output is correct
113 Correct 96 ms 19048 KB Output is correct
114 Incorrect 52 ms 17292 KB Output isn't correct
115 Halted 0 ms 0 KB -