oj.uz

답안 #622435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622435 2022-08-04T09:28:25 Z PoonYaPat City Mapping (NOI18_citymapping) C++14
22 / 100
 7 ms 8344 KB 
#include "citymapping.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> t;

int n;
vector<int> v[1001];
vector<t> ans;
ll dis[1001][1001];

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]) {
        dis[s][r]=dis[r][s]=get_distance(s,r);

        if (dis[x][s]+dis[s][r]==dis[x][r]) temp.push_back(pii(dis[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) {
        int t=dis[x][s]-(dis[x][s]+dis[s][r]-dis[x][r])/2;
        for (auto b : temp) {
            if (t==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=1,r=2;
    for (int x=3; x<=n; ++x) {
        dis[x][l]=dis[l][x]=get_distance(x,l);
        dis[x][r]=dis[r][x]=get_distance(r,x);
        if (!dis[l][r]) dis[l][r]=dis[r][l]=get_distance(l,r);

        if (dis[x][l]+dis[l][r]==dis[x][r]) l=x;
    }

    for (int i=1; i<=n; ++i) {
        if (i==l) continue;
        v[l].push_back(i);
        if (!dis[l][i]) dis[l][i]=dis[i][l]=get_distance(i,l);
    }
    find(l);

    for (int i=0; i<ans.size(); ++i) tie(A[i],B[i],W[i])=ans[i];
	return;
}

Compilation message

citymapping.cpp: In function 'void find(int)':
citymapping.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i=1; i<temp.size(); ++i) {
      |                   ~^~~~~~~~~~~~
citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:70: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]
   70 |     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:37:54: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |         int t=dis[x][s]-(dis[x][s]+dis[s][r]-dis[x][r])/2;
      |                                              ~~~~~~~~^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Correct: 3525 out of 500000 queries used.
2 Correct 6 ms 7156 KB Correct: 3609 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5532 out of 500000 queries used.
4 Correct 7 ms 8276 KB Correct: 6599 out of 500000 queries used.
5 Correct 5 ms 8344 KB Correct: 7714 out of 500000 queries used.

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Correct: 3525 out of 500000 queries used.
2 Correct 6 ms 7156 KB Correct: 3609 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5532 out of 500000 queries used.
4 Correct 7 ms 8276 KB Correct: 6599 out of 500000 queries used.
5 Correct 5 ms 8344 KB Correct: 7714 out of 500000 queries used.
6 Incorrect 5 ms 7800 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7764 KB Correct: 3891 out of 12000 queries used.
2 Correct 6 ms 6484 KB Correct: 3222 out of 12000 queries used.
3 Correct 4 ms 7672 KB Correct: 3778 out of 12000 queries used.
4 Correct 4 ms 7124 KB Correct: 3311 out of 12000 queries used.
5 Correct 7 ms 8276 KB Correct: 3298 out of 12000 queries used.

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7764 KB Correct: 3891 out of 12000 queries used.
2 Correct 6 ms 6484 KB Correct: 3222 out of 12000 queries used.
3 Correct 4 ms 7672 KB Correct: 3778 out of 12000 queries used.
4 Correct 4 ms 7124 KB Correct: 3311 out of 12000 queries used.
5 Correct 7 ms 8276 KB Correct: 3298 out of 12000 queries used.
6 Incorrect 6 ms 8276 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Correct: 3525 out of 500000 queries used.
2 Correct 6 ms 7156 KB Correct: 3609 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5532 out of 500000 queries used.
4 Correct 7 ms 8276 KB Correct: 6599 out of 500000 queries used.
5 Correct 5 ms 8344 KB Correct: 7714 out of 500000 queries used.
6 Incorrect 5 ms 7800 KB Reported list of edges differ from actual.
7 Halted 0 ms 0 KB -