oj.uz

답안 #893104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893104 2023-12-26T13:59:46 Z raul2008487 꿈 (IOI13_dreaming) C++17
18 / 100
 50 ms 16164 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
#define ll long long
#define pll pair<ll,ll>
#define vl vector<ll>
#define fi first
#define se second
#define in insert
#define all(v) v.begin(),v.end()
const int sz = 100005;
const ll inf = 1000000000000000;
using namespace std;
vector<pair<ll,ll>> adj[sz];
ll dis[sz][2], center, v1, v2, mx, cnt = -1;
bool used[sz];
vector<vector<ll>> path;
void trav(ll node){
    used[node] = 1;
    path[cnt].push_back(node);
    for(pll edge: adj[node]){
        if(!used[edge.fi]){
            trav(edge.fi);
        }
    }
}
void dfs(ll node, ll we, ll p){
    if(we > mx){
        v2 = node;
        mx = we;
    }
    for(pll edge: adj[node]){
        if(edge.fi != p){
            dfs(edge.fi, we + edge.se, node);
        }
    }
}
void caldis(ll node, ll we, ll p, ll type){
    dis[node][type] = we;
    for(pll edge: adj[node]){
        if(edge.fi != p){
            caldis(edge.fi, we + edge.se, node, type);
        }
    }
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    ll n = N, m = M, i, j;
    for(i=1;i<=m;i++){
        adj[A[i]].push_back({B[i], T[i]});
        adj[B[i]].push_back({A[i], T[i]});
    }
    for(i=0;i<n;i++){
        if(!used[i]){
            cnt++;
            path.push_back(vl(0));
            trav(i);
        }
    }
    multiset<ll> ms;
    ll res = -inf;
    for(i=0;i<=cnt;i++){
        mx = -1, v1 = -1, v2 = -1;
        dfs(path[i][0], 0, -1);
        v1 = v2;
        mx = -1;
        dfs(v1, 0, -1);
        caldis(v1, 0, -1, 0);caldis(v2, 0, -1, 1);
        ll pc = path[i][0], pb = max(dis[pc][0], dis[pc][1]);
        for(auto x: path[i]){
            if(max(dis[x][0], dis[x][1]) < pb){
                pb = max(dis[x][0], dis[x][1]);
            }
        }
        ms.in(pb);  
        res = max(res, mx);
        //ans = max(ans, pb);
    }
    if (cnt == 0) return max(res, *ms.begin());
    auto it = ms.end();
    it--;
    it--;
    auto it1 = it;
    it1--;
    if (cnt == 1) return max(res, *ms.rbegin() + *it + L);
    return max({res, *ms.rbegin() + *it + L, *it + *it1 + 2*L});
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:46:25: warning: unused variable 'j' [-Wunused-variable]
   46 |     ll n = N, m = M, i, j;
      |                         ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 15460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 15460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 13840 KB Output is correct
2 Correct 30 ms 13832 KB Output is correct
3 Correct 30 ms 13828 KB Output is correct
4 Correct 28 ms 13720 KB Output is correct
5 Correct 31 ms 13840 KB Output is correct
6 Correct 30 ms 14340 KB Output is correct
7 Correct 29 ms 14088 KB Output is correct
8 Correct 28 ms 13576 KB Output is correct
9 Correct 30 ms 13580 KB Output is correct
10 Correct 40 ms 14088 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 20 ms 15624 KB Output is correct
13 Correct 21 ms 15628 KB Output is correct
14 Correct 20 ms 15628 KB Output is correct
15 Correct 21 ms 15376 KB Output is correct
16 Correct 20 ms 15628 KB Output is correct
17 Correct 22 ms 15628 KB Output is correct
18 Correct 21 ms 16164 KB Output is correct
19 Correct 24 ms 15512 KB Output is correct
20 Correct 1 ms 5212 KB Output is correct
21 Correct 1 ms 5212 KB Output is correct
22 Correct 2 ms 5724 KB Output is correct
23 Correct 20 ms 16140 KB Output is correct

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 15460 KB Output isn't correct
2 Halted 0 ms 0 KB -