oj.uz

Submission #735123

# Submission time Handle Problem Language Result Execution time Memory
735123 2023-05-03T15:04:57 Z sandry24 Dreaming (IOI13_dreaming) C++17
14 / 100
 87 ms 15268 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
 
vector<vector<pi>> adj(1e5+1);
vector<bool> visited(1e5+1);
vi parent(1e5+1), dists(1e5+1);
 
ll maxe = 0, maxnode = -1;
 
void dfs(ll x, ll p=-1, ll dist=0){
    visited[x] = 1;
    parent[x] = p;
    dists[x] = dist;
    if(dist > maxe){
        maxe = dist;
        maxnode = x;
    }
    for(auto i : adj[x]){
        if(i.f != p)
            dfs(i.f, x, dist + i.s);
    }
}
 
int travelTime(int N, int M, int L, int A[], int B[], int T[]){
    for(int i = 0; i < M; i++){
        adj[A[i]].pb({B[i], T[i]});
        adj[B[i]].pb({A[i], T[i]});
    }
    vector<pair<ll, ll>> centers;
    for(int i = 0; i < N; i++){
        if(!visited[i]){
            maxe = 0, maxnode = -1;
            dfs(i);
            if(maxnode == -1){
                centers.pb({0, i});
                continue;
            }
            ll n1 = maxnode;
            maxe = 0, maxnode = -1;
            dfs(n1);
            ll n2 = maxnode;
            vector<pair<ll, ll>> path;
            while(n2 != n1){
                path.pb({n2, dists[n2]});
                n2 = parent[n2];
            }
            path.pb({n2, dists[n2]});
            reverse(path.begin(), path.end());
            ll diameter = path.back().second;
            ll best_node = -1, best_dist = 1e18;
            for(int j = 0; j < path.size(); j++){
                if(max(path[j].s, diameter - path[j].s) < best_dist){
                    best_node = path[j].f;
                    best_dist = max(path[j].s, diameter - path[j].s);
                }
            }
            centers.pb({best_dist, best_node});
        }
    }
    sort(centers.begin(), centers.end(), greater<pair<ll, ll>>());
    for(int i = 1; i < centers.size(); i++){
        adj[centers[0].s].pb({centers[i].s, L});
        adj[centers[i].s].pb({centers[0].s, L});
    }
    dfs(0);
    maxe = 0;
    dfs(maxnode);
    return dists[maxnode];
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:62:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for(int j = 0; j < path.size(); j++){
      |                            ~~^~~~~~~~~~~~~
dreaming.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     for(int i = 1; i < centers.size(); i++){
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 15268 KB Output is correct
2 Correct 49 ms 15172 KB Output is correct
3 Correct 35 ms 10888 KB Output is correct
4 Correct 8 ms 5268 KB Output is correct
5 Correct 8 ms 4348 KB Output is correct
6 Correct 15 ms 6104 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 29 ms 7364 KB Output is correct
9 Correct 48 ms 9260 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 53 ms 10576 KB Output is correct
12 Correct 87 ms 13376 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Incorrect 2 ms 3412 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 15268 KB Output is correct
2 Correct 49 ms 15172 KB Output is correct
3 Correct 35 ms 10888 KB Output is correct
4 Correct 8 ms 5268 KB Output is correct
5 Correct 8 ms 4348 KB Output is correct
6 Correct 15 ms 6104 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 29 ms 7364 KB Output is correct
9 Correct 48 ms 9260 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 53 ms 10576 KB Output is correct
12 Correct 87 ms 13376 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Incorrect 2 ms 3412 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 8144 KB Output is correct
2 Correct 37 ms 8200 KB Output is correct
3 Correct 38 ms 8208 KB Output is correct
4 Correct 42 ms 8232 KB Output is correct
5 Correct 38 ms 8200 KB Output is correct
6 Correct 46 ms 8884 KB Output is correct
7 Correct 44 ms 8372 KB Output is correct
8 Correct 43 ms 8116 KB Output is correct
9 Correct 33 ms 8012 KB Output is correct
10 Correct 35 ms 8384 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 17 ms 8888 KB Output is correct
13 Correct 16 ms 9028 KB Output is correct
14 Correct 16 ms 8900 KB Output is correct
15 Correct 16 ms 8852 KB Output is correct
16 Correct 16 ms 8888 KB Output is correct
17 Correct 17 ms 8900 KB Output is correct
18 Correct 16 ms 8908 KB Output is correct
19 Correct 15 ms 8888 KB Output is correct
20 Runtime error 5 ms 6740 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Incorrect 2 ms 3412 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 15268 KB Output is correct
2 Correct 49 ms 15172 KB Output is correct
3 Correct 35 ms 10888 KB Output is correct
4 Correct 8 ms 5268 KB Output is correct
5 Correct 8 ms 4348 KB Output is correct
6 Correct 15 ms 6104 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 29 ms 7364 KB Output is correct
9 Correct 48 ms 9260 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 53 ms 10576 KB Output is correct
12 Correct 87 ms 13376 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Incorrect 2 ms 3412 KB Output isn't correct
20 Halted 0 ms 0 KB -