Submission #575655

#	Time	Username	Problem	Language	Result	Execution time	Memory
575655		jack715	Dreaming (IOI13_dreaming)	C++14	100 / 100	106 ms	25936 KiB

dreaming

#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];
}

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});
    }
    sort(child.begin(), child.end());
    int ans = max(up, dist[now]);
    for (int i = 0; i < child.size(); i++) {
        ans = min(ans, find(child[i].ss.ff, now, (i != child.size()-1 ? max(up, child.back().ff) : (i != 0 ? max(up, child[child.size()-2].ff) : up))+child[i].ss.ss, dist, path));
    }
    return ans;
}

int findmax(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});
    }
    sort(child.begin(), child.end());
    int ans = up+dist[now];
    for (int i = 0; i < child.size(); i++) {
        ans = max(ans, findmax(child[i].ss.ff, now, (i != child.size()-1 ? max(up, child.back().ff) : (i != 0 ? max(up, child[child.size()-2].ff) : up))+child[i].ss.ss, dist, path));
    }
    return ans;
}

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);
            centre.pb(find(i, -1, 0, dist, path));
            ans = max(ans, findmax(i, -1, 0, dist, path));
            // cout << findmax(i, -1, 0, dist, path) << ' ';
        }
    }
    // cout << '\n';

    sort(centre.begin(), centre.end());
    // for (int a : centre)
    //     cout << a << ' ';
    // cout << '\n';
    int p = centre.back();
    for (int i = 0; i < centre.size()-1; i++) {
        ans = max(ans, p+centre[i]+L);
        if (centre[i] < p)
            p = max(p, centre[i]+L);
        else 
            p = max(centre[i], p+L);
    }
    return ans;
}

Compilation message (stderr)

dreaming.cpp: In function 'int find(int, int, int, std::vector<int>&, std::vector<std::vector<std::pair<int, int> > >&)':
dreaming.cpp:30: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]
   30 |     for (int i = 0; i < child.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
dreaming.cpp:31:53: 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 |         ans = min(ans, find(child[i].ss.ff, now, (i != child.size()-1 ? max(up, child.back().ff) : (i != 0 ? max(up, child[child.size()-2].ff) : up))+child[i].ss.ss, dist, path));
      |                                                   ~~^~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int findmax(int, int, int, std::vector<int>&, std::vector<std::vector<std::pair<int, int> > >&)':
dreaming.cpp:44: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]
   44 |     for (int i = 0; i < child.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
dreaming.cpp:45:56: 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]
   45 |         ans = max(ans, findmax(child[i].ss.ff, now, (i != child.size()-1 ? max(up, child.back().ff) : (i != 0 ? max(up, child[child.size()-2].ff) : up))+child[i].ss.ss, dist, path));
      |                                                      ~~^~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:73:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int i = 0; i < centre.size()-1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 10 / 10
• Subtask 3: 23 / 23
• Subtask 4: 18 / 18
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23