제출 #622782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
622782		PoonYaPat	City Mapping (NOI18_citymapping)	C++14	63.15 / 100	38 ms	8404 KiB

citymapping

#include "citymapping.h"
 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;
typedef tuple<int,int,int> t;
 
int n;
vector<int> v[1001];
vector<t> ans;
ll dis[1001][1001];
 
ll get(int  x, int y) {
    if (!dis[x][y]) dis[x][y]=dis[y][x]=get_distance(x,y);
    return dis[x][y];
}
 
void find(int x) { //have v[x] represent the node which has x as it child, know dis[x][s]
    int r;
    ll longest=0;
    vector<pii> temp; //dis and node in backbone
    vector<int> tree;
 
    for (auto s : v[x]) if (dis[x][s]>longest) longest=dis[x][s], r=s; //find backbone
 
    for (auto s : v[x]) {
        if (get(x,s)+get(s,r)==get(x,r)) temp.push_back(pii(get(x,s),s)); //in backbone
        else tree.push_back(s);
    }
 
    sort(temp.begin(),temp.end());
    ans.push_back(t(x,temp[0].second,temp[0].first));
 
    for (int i=1; i<temp.size(); ++i) {
        ans.push_back(t(temp[i-1].second,temp[i].second,temp[i].first-temp[i-1].first));
    }
 
    for (auto s : tree) {
        for (auto b : temp) {
            if (dis[x][s]-(dis[x][s]+dis[s][r]-dis[x][r])/2==b.first) {
                v[b.second].push_back(s);
                dis[b.second][s]=dis[s][b.second]=(dis[x][s]+dis[s][r]-dis[x][r])/2;
                break;
            }
        }
    }
 
    for (auto s : temp) if (v[s.second].size()) find(s.second);
}
 
void find_roads(int N, int Q, int A[], int B[], int W[]) {
    n=N;
 
    //find rim
    int l=500,r=2;
    for (int x=3; x<=n; ++x) if (get(x,l)+get(l,r)==get(x,r)) l=x;
 
    for (int i=1; i<=n; ++i) {
        if (i==l) continue;
        v[l].push_back(i);
        get(i,l);
    }
    find(l);
 
    for (int i=0; i<ans.size(); ++i) tie(A[i],B[i],W[i])=ans[i];
	return;
}

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

citymapping.cpp: In function 'void find(int)':
citymapping.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i=1; i<temp.size(); ++i) {
      |                   ~^~~~~~~~~~~~
citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:66:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i=0; i<ans.size(); ++i) tie(A[i],B[i],W[i])=ans[i];
      |                   ~^~~~~~~~~~~
citymapping.cpp: In function 'void find(int)':
citymapping.cpp:41:56: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |             if (dis[x][s]-(dis[x][s]+dis[s][r]-dis[x][r])/2==b.first) {
      |                                                ~~~~~~~~^

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 13 / 13
• Subtask 4: 19 / 19
• Subtask 5: 6.15 / 43