oj.uz

Submission #1075641

# Submission time Handle Problem Language Result Execution time Memory
1075641 2024-08-26T08:15:34 Z Trumling Dreaming (IOI13_dreaming) C++14
47 / 100
 56 ms 19952 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std; 
 
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
 
vector<vector<pair<ll,ll>>>g;
vector<bool>vis;
vector<ll>dist,par;
 
ll n,m;
void dfs1(int start,int pre,ll &maxi)
{
    for(auto x:g[start])
        if(x.F!=pre)
        {
            par[x.F]=start;
            vis[x.F]=1;
            dist[x.F]= dist[start] + x.S;
            if(dist[maxi]<dist[x.F])
                maxi=x.F;
 
            dfs1(x.F, start,maxi);
        }
}
 
void dfs2(int start,int pre,ll &ans,ll diff,ll curr,ll count)
{
   
 
    for(auto x:g[start])
        if(x.F!=pre)
            dfs2(x.F,start,ans,diff,curr + x.S,count);
        
}   
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    n=N;
    m=M;
 
    g.assign(n,vector<pair<ll,ll>>());
    vis.assign(n,0);
    dist.assign(n,0);
    par.assign(n,0);
    for(int i=0;i<m;i++)
        {
            g[A[i]].pb({B[i],T[i]});
            g[B[i]].pb({A[i],T[i]});
        }
    
    vector<ll>ans;
	ll ansi=-1;
    ll idx=0;
    for(int i=0;i<N;i++)
        if(!vis[i])
        {
            vis[i]=1;
            ll p1=i,p2;
            dfs1(i,i,p1);
            dist[p1]=0;
            p2=p1;
            dfs1(p1,p1,p2);
 
            ll curr=0;
            ll diff=INF;
            ll count=dist[p2];
 
            ansi=max(ansi,dist[p2]);
			ll curri=0;
            while(p2!=p1)
            {
 
            if(diff > abs((count-curr)-curr))
            {
                curri=max(curr,count-curr);
                diff= abs((count-curr)-curr);
            }

            curr+=dist[p2]-dist[par[p2]];
            p2=par[p2];
            }
			ans.pb(curri);
        }
	sort(all(ans));
    return max(ansi,ans[ans.size()-1] + ans[ans.size()-2] + L);
 
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:60:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   60 |     for(int i=0;i<N;i++)
      |     ^~~
dreaming.cpp:90:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   90 |  sort(all(ans));
      |  ^~~~
dreaming.cpp:59:8: warning: unused variable 'idx' [-Wunused-variable]
   59 |     ll idx=0;
      |        ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 17736 KB Output is correct
2 Correct 33 ms 17488 KB Output is correct
3 Correct 21 ms 11856 KB Output is correct
4 Correct 5 ms 2820 KB Output is correct
5 Correct 4 ms 1852 KB Output is correct
6 Correct 9 ms 4440 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 17 ms 7004 KB Output is correct
9 Correct 21 ms 9304 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 30 ms 12324 KB Output is correct
12 Correct 35 ms 14932 KB Output is correct
13 Correct 1 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 17736 KB Output is correct
2 Correct 33 ms 17488 KB Output is correct
3 Correct 21 ms 11856 KB Output is correct
4 Correct 5 ms 2820 KB Output is correct
5 Correct 4 ms 1852 KB Output is correct
6 Correct 9 ms 4440 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 17 ms 7004 KB Output is correct
9 Correct 21 ms 9304 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 30 ms 12324 KB Output is correct
12 Correct 35 ms 14932 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 440 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 34 ms 17744 KB Output is correct
40 Correct 32 ms 17544 KB Output is correct
41 Correct 21 ms 11864 KB Output is correct
42 Correct 6 ms 2908 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 47 ms 12780 KB Output is correct
58 Correct 39 ms 12756 KB Output is correct
59 Correct 39 ms 12368 KB Output is correct
60 Correct 41 ms 12368 KB Output is correct
61 Correct 49 ms 12380 KB Output is correct
62 Correct 47 ms 12380 KB Output is correct
63 Correct 33 ms 11868 KB Output is correct
64 Correct 33 ms 11864 KB Output is correct
65 Correct 36 ms 12112 KB Output is correct
66 Correct 35 ms 12124 KB Output is correct
67 Correct 39 ms 12536 KB Output is correct
68 Correct 41 ms 12444 KB Output is correct
69 Correct 41 ms 12628 KB Output is correct
70 Correct 39 ms 12796 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 1 ms 604 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 1 ms 856 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 43 ms 12368 KB Output is correct
81 Correct 43 ms 12372 KB Output is correct
82 Correct 39 ms 12356 KB Output is correct
83 Correct 35 ms 12368 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 712 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 3 ms 600 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 4 ms 1884 KB Output is correct
105 Correct 10 ms 4428 KB Output is correct
106 Correct 1 ms 760 KB Output is correct
107 Correct 21 ms 7004 KB Output is correct
108 Correct 23 ms 9336 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 30 ms 12424 KB Output is correct
111 Correct 44 ms 14932 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 56 ms 19952 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7392 KB Output is correct
2 Incorrect 20 ms 7356 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Incorrect 1 ms 348 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 17736 KB Output is correct
2 Correct 33 ms 17488 KB Output is correct
3 Correct 21 ms 11856 KB Output is correct
4 Correct 5 ms 2820 KB Output is correct
5 Correct 4 ms 1852 KB Output is correct
6 Correct 9 ms 4440 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 17 ms 7004 KB Output is correct
9 Correct 21 ms 9304 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 30 ms 12324 KB Output is correct
12 Correct 35 ms 14932 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 440 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 34 ms 17744 KB Output is correct
40 Correct 32 ms 17544 KB Output is correct
41 Correct 21 ms 11864 KB Output is correct
42 Correct 6 ms 2908 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 47 ms 12780 KB Output is correct
58 Correct 39 ms 12756 KB Output is correct
59 Correct 39 ms 12368 KB Output is correct
60 Correct 41 ms 12368 KB Output is correct
61 Correct 49 ms 12380 KB Output is correct
62 Correct 47 ms 12380 KB Output is correct
63 Correct 33 ms 11868 KB Output is correct
64 Correct 33 ms 11864 KB Output is correct
65 Correct 36 ms 12112 KB Output is correct
66 Correct 35 ms 12124 KB Output is correct
67 Correct 39 ms 12536 KB Output is correct
68 Correct 41 ms 12444 KB Output is correct
69 Correct 41 ms 12628 KB Output is correct
70 Correct 39 ms 12796 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 1 ms 604 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 1 ms 856 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 43 ms 12368 KB Output is correct
81 Correct 43 ms 12372 KB Output is correct
82 Correct 39 ms 12356 KB Output is correct
83 Correct 35 ms 12368 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 712 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 3 ms 600 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 4 ms 1884 KB Output is correct
105 Correct 10 ms 4428 KB Output is correct
106 Correct 1 ms 760 KB Output is correct
107 Correct 21 ms 7004 KB Output is correct
108 Correct 23 ms 9336 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 30 ms 12424 KB Output is correct
111 Correct 44 ms 14932 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 56 ms 19952 KB Output is correct
114 Correct 14 ms 7392 KB Output is correct
115 Incorrect 20 ms 7356 KB Output isn't correct
116 Halted 0 ms 0 KB -