oj.uz

Submission #735104

# Submission time Handle Problem Language Result Execution time Memory
735104 2023-05-03T14:50:47 Z sandry24 Dreaming (IOI13_dreaming) C++17
32 / 100
 100 ms 15296 KB 
#include <bits/stdc++.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

#include "dreaming.h"

vector<vector<pi>> adj(1e5+1);
vector<bool> visited(1e5+1);
vi parent(1e5+1), dists(1e5+1);

ll maxe = -1, 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 = -1, maxnode = -1;
            dfs(i);
            ll n1 = maxnode;
            maxe = -1, 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_diff = 1e18, best_node = -1, best_dist = -1;
            for(int j = 0; j < path.size(); j++){
                if(abs(diameter - 2 * path[j].s) < best_diff){
                    best_diff = abs(diameter - 2 * path[j].s);
                    best_node = path[j].f;
                    best_dist = max((ll)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 = -1;
    dfs(maxnode);
    return dists[maxnode];
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:59: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]
   59 |             for(int j = 0; j < path.size(); j++){
      |                            ~~^~~~~~~~~~~~~
dreaming.cpp:70: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]
   70 |     for(int i = 1; i < centers.size(); i++){
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 15296 KB Output is correct
2 Correct 77 ms 15268 KB Output is correct
3 Correct 52 ms 11012 KB Output is correct
4 Correct 9 ms 5332 KB Output is correct
5 Correct 8 ms 4484 KB Output is correct
6 Correct 14 ms 6232 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 30 ms 7488 KB Output is correct
9 Correct 37 ms 9376 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 82 ms 10720 KB Output is correct
12 Correct 100 ms 13444 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 3 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 3 ms 3412 KB Output is correct
5 Correct 3 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 74 ms 15296 KB Output is correct
2 Correct 77 ms 15268 KB Output is correct
3 Correct 52 ms 11012 KB Output is correct
4 Correct 9 ms 5332 KB Output is correct
5 Correct 8 ms 4484 KB Output is correct
6 Correct 14 ms 6232 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 30 ms 7488 KB Output is correct
9 Correct 37 ms 9376 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 82 ms 10720 KB Output is correct
12 Correct 100 ms 13444 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 3 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 3 ms 3412 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 3 ms 3412 KB Output is correct
19 Incorrect 2 ms 3412 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 8332 KB Output is correct
2 Correct 50 ms 8252 KB Output is correct
3 Correct 54 ms 8264 KB Output is correct
4 Correct 58 ms 8292 KB Output is correct
5 Correct 56 ms 8276 KB Output is correct
6 Correct 48 ms 9088 KB Output is correct
7 Correct 56 ms 8520 KB Output is correct
8 Correct 49 ms 8240 KB Output is correct
9 Correct 54 ms 8132 KB Output is correct
10 Correct 48 ms 8408 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 27 ms 8900 KB Output is correct
13 Correct 25 ms 8816 KB Output is correct
14 Correct 20 ms 8900 KB Output is correct
15 Correct 26 ms 8840 KB Output is correct
16 Correct 22 ms 8932 KB Output is correct
17 Correct 30 ms 8900 KB Output is correct
18 Correct 26 ms 8844 KB Output is correct
19 Correct 28 ms 8820 KB Output is correct
20 Correct 2 ms 3468 KB Output is correct
21 Correct 3 ms 3440 KB Output is correct
22 Correct 3 ms 3540 KB Output is correct
23 Correct 31 ms 8920 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 3 ms 3412 KB Output is correct
5 Correct 3 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 74 ms 15296 KB Output is correct
2 Correct 77 ms 15268 KB Output is correct
3 Correct 52 ms 11012 KB Output is correct
4 Correct 9 ms 5332 KB Output is correct
5 Correct 8 ms 4484 KB Output is correct
6 Correct 14 ms 6232 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 30 ms 7488 KB Output is correct
9 Correct 37 ms 9376 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 82 ms 10720 KB Output is correct
12 Correct 100 ms 13444 KB Output is correct
13 Correct 3 ms 3540 KB Output is correct
14 Correct 3 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 3 ms 3412 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 3 ms 3412 KB Output is correct
19 Incorrect 2 ms 3412 KB Output isn't correct
20 Halted 0 ms 0 KB -