oj.uz

답안 #622770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622770 2022-08-04T14:18:31 Z PoonYaPat City Mapping (NOI18_citymapping) C++14
63.53 / 100
 27 ms 8576 KB 
#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];

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) {
        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;
    ll longest=0;
    for (int i=2; i<=n; ++i) {
        dis[1][i]=dis[i][1]=get_distance(i,1);
        if (dis[1][i]>longest) {
            longest=dis[1][i];
            l=i;
        }
    }

    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<long long 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:38:56: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   38 |             if (dis[x][s]-(dis[x][s]+dis[s][r]-dis[x][r])/2==b.first) {
      |                                                ~~~~~~~~^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8276 KB Correct: 2993 out of 500000 queries used.
2 Correct 6 ms 7928 KB Correct: 3495 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5529 out of 500000 queries used.
4 Correct 7 ms 8260 KB Correct: 6432 out of 500000 queries used.
5 Correct 8 ms 8260 KB Correct: 11614 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8276 KB Correct: 2993 out of 500000 queries used.
2 Correct 6 ms 7928 KB Correct: 3495 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5529 out of 500000 queries used.
4 Correct 7 ms 8260 KB Correct: 6432 out of 500000 queries used.
5 Correct 8 ms 8260 KB Correct: 11614 out of 500000 queries used.
6 Correct 4 ms 6824 KB Correct: 2984 out of 500000 queries used.
7 Correct 6 ms 8380 KB Correct: 16054 out of 500000 queries used.
8 Correct 5 ms 8276 KB Correct: 5593 out of 500000 queries used.
9 Correct 8 ms 8372 KB Correct: 6669 out of 500000 queries used.
10 Correct 7 ms 7924 KB Correct: 5639 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6132 KB Correct: 2969 out of 12000 queries used.
2 Correct 4 ms 6484 KB Correct: 2975 out of 12000 queries used.
3 Correct 5 ms 6868 KB Correct: 2996 out of 12000 queries used.
4 Correct 4 ms 7160 KB Correct: 2975 out of 12000 queries used.
5 Correct 7 ms 8284 KB Correct: 2969 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6132 KB Correct: 2969 out of 12000 queries used.
2 Correct 4 ms 6484 KB Correct: 2975 out of 12000 queries used.
3 Correct 5 ms 6868 KB Correct: 2996 out of 12000 queries used.
4 Correct 4 ms 7160 KB Correct: 2975 out of 12000 queries used.
5 Correct 7 ms 8284 KB Correct: 2969 out of 12000 queries used.
6 Correct 6 ms 8360 KB Correct: 2990 out of 12000 queries used.
7 Correct 6 ms 6868 KB Correct: 2984 out of 12000 queries used.
8 Correct 19 ms 7636 KB Correct: 2996 out of 12000 queries used.
9 Correct 5 ms 7380 KB Correct: 2987 out of 12000 queries used.
10 Correct 4 ms 7508 KB Correct: 2978 out of 12000 queries used.

Subtask #5
6.53 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8276 KB Correct: 2993 out of 500000 queries used.
2 Correct 6 ms 7928 KB Correct: 3495 out of 500000 queries used.
3 Correct 5 ms 8276 KB Correct: 5529 out of 500000 queries used.
4 Correct 7 ms 8260 KB Correct: 6432 out of 500000 queries used.
5 Correct 8 ms 8260 KB Correct: 11614 out of 500000 queries used.
6 Correct 4 ms 6824 KB Correct: 2984 out of 500000 queries used.
7 Correct 6 ms 8380 KB Correct: 16054 out of 500000 queries used.
8 Correct 5 ms 8276 KB Correct: 5593 out of 500000 queries used.
9 Correct 8 ms 8372 KB Correct: 6669 out of 500000 queries used.
10 Correct 7 ms 7924 KB Correct: 5639 out of 500000 queries used.
11 Correct 3 ms 6132 KB Correct: 2969 out of 12000 queries used.
12 Correct 4 ms 6484 KB Correct: 2975 out of 12000 queries used.
13 Correct 5 ms 6868 KB Correct: 2996 out of 12000 queries used.
14 Correct 4 ms 7160 KB Correct: 2975 out of 12000 queries used.
15 Correct 7 ms 8284 KB Correct: 2969 out of 12000 queries used.
16 Correct 6 ms 8360 KB Correct: 2990 out of 12000 queries used.
17 Correct 6 ms 6868 KB Correct: 2984 out of 12000 queries used.
18 Correct 19 ms 7636 KB Correct: 2996 out of 12000 queries used.
19 Correct 5 ms 7380 KB Correct: 2987 out of 12000 queries used.
20 Correct 4 ms 7508 KB Correct: 2978 out of 12000 queries used.
21 Correct 6 ms 8312 KB Correct: 2984 out of 25000 queries used.
22 Correct 5 ms 7892 KB Correct: 5872 out of 25000 queries used.
23 Correct 7 ms 8148 KB Correct: 3517 out of 25000 queries used.
24 Correct 7 ms 8184 KB Correct: 4823 out of 25000 queries used.
25 Correct 5 ms 8276 KB Correct: 5641 out of 25000 queries used.
26 Correct 7 ms 8148 KB Correct: 5392 out of 25000 queries used.
27 Correct 7 ms 8256 KB Correct: 5527 out of 25000 queries used.
28 Correct 5 ms 8276 KB Correct: 5662 out of 25000 queries used.
29 Correct 7 ms 8276 KB Correct: 5920 out of 25000 queries used.
30 Correct 7 ms 8276 KB Correct: 6130 out of 25000 queries used.
31 Correct 6 ms 8276 KB Correct: 6460 out of 25000 queries used.
32 Correct 4 ms 6356 KB Correct: 2981 out of 25000 queries used.
33 Correct 6 ms 8308 KB Correct: 6426 out of 25000 queries used.
34 Correct 6 ms 8276 KB Correct: 6460 out of 25000 queries used.
35 Correct 6 ms 8308 KB Correct: 6439 out of 25000 queries used.
36 Correct 7 ms 8228 KB Correct: 6415 out of 25000 queries used.
37 Correct 7 ms 8276 KB Correct: 6430 out of 25000 queries used.
38 Correct 27 ms 8288 KB Correct: 6461 out of 25000 queries used.
39 Correct 6 ms 8276 KB Correct: 6435 out of 25000 queries used.
40 Correct 5 ms 8276 KB Correct: 6443 out of 25000 queries used.
41 Correct 7 ms 8308 KB Correct: 6441 out of 25000 queries used.
42 Correct 6 ms 8276 KB Correct: 6450 out of 25000 queries used.
43 Correct 5 ms 8276 KB Correct: 2990 out of 25000 queries used.
44 Correct 5 ms 8232 KB Correct: 6375 out of 25000 queries used.
45 Correct 5 ms 8276 KB Correct: 6406 out of 25000 queries used.
46 Correct 21 ms 8224 KB Correct: 6374 out of 25000 queries used.
47 Correct 8 ms 8296 KB Correct: 6436 out of 25000 queries used.
48 Correct 5 ms 8276 KB Correct: 6467 out of 25000 queries used.
49 Correct 5 ms 8276 KB Correct: 6465 out of 25000 queries used.
50 Correct 5 ms 8276 KB Correct: 6452 out of 25000 queries used.
51 Correct 5 ms 8276 KB Correct: 6467 out of 25000 queries used.
52 Correct 8 ms 8276 KB Correct: 6435 out of 25000 queries used.
53 Correct 6 ms 8360 KB Correct: 6725 out of 25000 queries used.
54 Correct 10 ms 8576 KB Correct: 16017 out of 25000 queries used.
55 Correct 7 ms 8312 KB Correct: 6452 out of 25000 queries used.
56 Correct 9 ms 8232 KB Correct: 6435 out of 25000 queries used.
57 Correct 5 ms 8276 KB Correct: 6725 out of 25000 queries used.
58 Correct 6 ms 8296 KB Correct: 6383 out of 25000 queries used.
59 Correct 5 ms 8228 KB Correct: 6415 out of 25000 queries used.
60 Correct 5 ms 8248 KB Correct: 6843 out of 25000 queries used.
61 Correct 5 ms 7844 KB Correct: 6772 out of 25000 queries used.
62 Correct 5 ms 7636 KB Correct: 6006 out of 25000 queries used.
63 Correct 5 ms 8148 KB Correct: 6061 out of 25000 queries used.
64 Correct 6 ms 7892 KB Correct: 6037 out of 25000 queries used.
65 Correct 7 ms 8020 KB Correct: 7911 out of 25000 queries used.
66 Correct 5 ms 8276 KB Correct: 6628 out of 25000 queries used.
67 Correct 7 ms 8344 KB Correct: 3688 out of 25000 queries used.
68 Correct 7 ms 8308 KB Correct: 16513 out of 25000 queries used.
69 Correct 8 ms 8404 KB Correct: 11378 out of 25000 queries used.
70 Correct 7 ms 8316 KB Correct: 12386 out of 25000 queries used.