oj.uz

Submission #575603

# Submission time Handle Problem Language Result Execution time Memory
575603 2022-06-11T06:39:22 Z jack715 Dreaming (IOI13_dreaming) C++14
14 / 100
 40 ms 10708 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

int build(int now, int par, vector<int>& dist, vector<vector<pair<int, int> > >& path) {
    dist[now] = 0;
    for (auto next : path[now]) {
        if (next.ff == par) continue; 
        dist[now] = max(dist[now], build(next.ff, now, dist, path)+next.ss);
    }
    return dist[now];
}

pair<int, int> find(int now, int par, int up, vector<int>& dist, vector<vector<pair<int, int> > >& path) {
    vector<pair<int, pair<int, int> > > child;
    for (auto next : path[now]) {
        if (next.ff == par) continue; 
        child.pb({dist[next.ff]+next.ss, next});
    }
    if (child.size() == 0)
        return {up, up};
    sort(child.begin(), child.end());
    for (int i = 0; i < child.size()-1; i++) {
        up = max(up, child[i].ff);
    }
    if (dist[child.back().ss.ff] >= child.back().ss.ss + up)
        return find(child.back().ss.ff, now, up+child.back().ss.ss, dist, path);
    // cout << now << ' ' << up << ' ' << child.back().ff << ' ' << par << '\n';
    return {max(up, child.back().ff), child.back().ff+up};
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    vector<int> dist(N, -1), centre;
    vector<vector<pair<int, int> > > path(N);
    for (int i = 0; i < M; i++) {
        path[A[i]].pb({B[i], T[i]});
        path[B[i]].pb({A[i], T[i]});
    }
    int ans = 0;
    for (int i = 0; i < N; i++) {
        if (dist[i] == -1) {
            build(i, -1, dist, path);
            pair<int, int> ret = find(i, -1, 0, dist, path); 
            centre.pb(ret.ff);
            ans = max(ans, ret.ss);
        }
    }

    // for (int a : centre)
    //     cout << a << ' ';
    // cout << '\n';
    int p = centre[0];
    for (int i = 1; i < centre.size(); i++) {
        ans = max(ans, p+centre[i]+L);
        p = min(p+L, centre[i]+L);
    }
    return ans;
}

Compilation message

dreaming.cpp: In function 'std::pair<int, int> find(int, int, int, std::vector<int>&, std::vector<std::vector<std::pair<int, int> > >&)':
dreaming.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < child.size()-1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 1; i < centre.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10708 KB Output is correct
2 Correct 38 ms 10324 KB Output is correct
3 Correct 28 ms 9128 KB Output is correct
4 Correct 5 ms 1748 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 11 ms 2636 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 19 ms 4856 KB Output is correct
9 Correct 26 ms 7404 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 35 ms 8080 KB Output is correct
12 Correct 40 ms 9368 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10708 KB Output is correct
2 Correct 38 ms 10324 KB Output is correct
3 Correct 28 ms 9128 KB Output is correct
4 Correct 5 ms 1748 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 11 ms 2636 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 19 ms 4856 KB Output is correct
9 Correct 26 ms 7404 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 35 ms 8080 KB Output is correct
12 Correct 40 ms 9368 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 5564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10708 KB Output is correct
2 Correct 38 ms 10324 KB Output is correct
3 Correct 28 ms 9128 KB Output is correct
4 Correct 5 ms 1748 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 11 ms 2636 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 19 ms 4856 KB Output is correct
9 Correct 26 ms 7404 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 35 ms 8080 KB Output is correct
12 Correct 40 ms 9368 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -