oj.uz

답안 #575645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575645 2022-06-11T07:09:05 Z jack715 꿈 (IOI13_dreaming) C++14
18 / 100
 51 ms 15288 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];
}

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()-1].ff) : up))+child[i].ss.ss, dist, path));
    }
    return ans;
}

int findmax(int now, vector<int>& dist, vector<vector<pair<int, int> > >& path) {
    vector<int> child;
    for (auto next : path[now]) {
        child.pb(dist[next.ff]+next.ss);
    }
    sort(child.begin(), child.end());
    if (child.size() == 0) return 0;
    if (child.size() == 1) return child[0];
    return child[child.size()-1]+child[child.size()-2];
}

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, dist, path));
        }
    }

    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

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()-1].ff) : up))+child[i].ss.ss, dist, path));
      |                                                   ~~^~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:68:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for (int i = 0; i < centre.size()-1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 15288 KB Output is correct
2 Correct 51 ms 14728 KB Output is correct
3 Correct 35 ms 13332 KB Output is correct
4 Correct 6 ms 2388 KB Output is correct
5 Correct 5 ms 1492 KB Output is correct
6 Correct 10 ms 3508 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 15288 KB Output is correct
2 Correct 51 ms 14728 KB Output is correct
3 Correct 35 ms 13332 KB Output is correct
4 Correct 6 ms 2388 KB Output is correct
5 Correct 5 ms 1492 KB Output is correct
6 Correct 10 ms 3508 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 5588 KB Output is correct
2 Correct 24 ms 5588 KB Output is correct
3 Correct 20 ms 5588 KB Output is correct
4 Correct 30 ms 5588 KB Output is correct
5 Correct 30 ms 5580 KB Output is correct
6 Correct 22 ms 6080 KB Output is correct
7 Correct 21 ms 5812 KB Output is correct
8 Correct 20 ms 5464 KB Output is correct
9 Correct 20 ms 5376 KB Output is correct
10 Correct 22 ms 5684 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 3664 KB Output is correct
13 Correct 5 ms 3664 KB Output is correct
14 Correct 5 ms 3664 KB Output is correct
15 Correct 5 ms 3636 KB Output is correct
16 Correct 5 ms 3664 KB Output is correct
17 Correct 5 ms 3664 KB Output is correct
18 Correct 6 ms 3664 KB Output is correct
19 Correct 5 ms 3664 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 6 ms 3664 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 15288 KB Output is correct
2 Correct 51 ms 14728 KB Output is correct
3 Correct 35 ms 13332 KB Output is correct
4 Correct 6 ms 2388 KB Output is correct
5 Correct 5 ms 1492 KB Output is correct
6 Correct 10 ms 3508 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -