제출 #735104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735104		sandry24	꿈 (IOI13_dreaming)	C++17	32 / 100	100 ms	15296 KiB

dreaming

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

컴파일 시 표준 에러 (stderr) 메시지

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 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 18 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23