oj.uz

답안 #622781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
622781 2022-08-04T14:24:22 Z PoonYaPat City Mapping (NOI18_citymapping) C++14
63.12 / 100
 26 ms 8404 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];

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=1,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;
}

Compilation message

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.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8300 KB Correct: 3523 out of 500000 queries used.
2 Correct 5 ms 7220 KB Correct: 3608 out of 500000 queries used.
3 Correct 6 ms 8172 KB Correct: 5530 out of 500000 queries used.
4 Correct 6 ms 8296 KB Correct: 6471 out of 500000 queries used.
5 Correct 7 ms 8404 KB Correct: 7713 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8300 KB Correct: 3523 out of 500000 queries used.
2 Correct 5 ms 7220 KB Correct: 3608 out of 500000 queries used.
3 Correct 6 ms 8172 KB Correct: 5530 out of 500000 queries used.
4 Correct 6 ms 8296 KB Correct: 6471 out of 500000 queries used.
5 Correct 7 ms 8404 KB Correct: 7713 out of 500000 queries used.
6 Correct 5 ms 7852 KB Correct: 3928 out of 500000 queries used.
7 Correct 5 ms 7476 KB Correct: 3961 out of 500000 queries used.
8 Correct 6 ms 8184 KB Correct: 5606 out of 500000 queries used.
9 Correct 7 ms 8240 KB Correct: 6880 out of 500000 queries used.
10 Correct 7 ms 7700 KB Correct: 4247 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7764 KB Correct: 3889 out of 12000 queries used.
2 Correct 5 ms 6356 KB Correct: 3220 out of 12000 queries used.
3 Correct 8 ms 7676 KB Correct: 3776 out of 12000 queries used.
4 Correct 5 ms 7124 KB Correct: 3309 out of 12000 queries used.
5 Correct 9 ms 8296 KB Correct: 3297 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7764 KB Correct: 3889 out of 12000 queries used.
2 Correct 5 ms 6356 KB Correct: 3220 out of 12000 queries used.
3 Correct 8 ms 7676 KB Correct: 3776 out of 12000 queries used.
4 Correct 5 ms 7124 KB Correct: 3309 out of 12000 queries used.
5 Correct 9 ms 8296 KB Correct: 3297 out of 12000 queries used.
6 Correct 7 ms 8276 KB Correct: 3292 out of 12000 queries used.
7 Correct 7 ms 7576 KB Correct: 3878 out of 12000 queries used.
8 Correct 25 ms 7592 KB Correct: 3347 out of 12000 queries used.
9 Correct 7 ms 7892 KB Correct: 3667 out of 12000 queries used.
10 Correct 6 ms 7464 KB Correct: 3032 out of 12000 queries used.

Subtask #5
6.12 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8300 KB Correct: 3523 out of 500000 queries used.
2 Correct 5 ms 7220 KB Correct: 3608 out of 500000 queries used.
3 Correct 6 ms 8172 KB Correct: 5530 out of 500000 queries used.
4 Correct 6 ms 8296 KB Correct: 6471 out of 500000 queries used.
5 Correct 7 ms 8404 KB Correct: 7713 out of 500000 queries used.
6 Correct 5 ms 7852 KB Correct: 3928 out of 500000 queries used.
7 Correct 5 ms 7476 KB Correct: 3961 out of 500000 queries used.
8 Correct 6 ms 8184 KB Correct: 5606 out of 500000 queries used.
9 Correct 7 ms 8240 KB Correct: 6880 out of 500000 queries used.
10 Correct 7 ms 7700 KB Correct: 4247 out of 500000 queries used.
11 Correct 6 ms 7764 KB Correct: 3889 out of 12000 queries used.
12 Correct 5 ms 6356 KB Correct: 3220 out of 12000 queries used.
13 Correct 8 ms 7676 KB Correct: 3776 out of 12000 queries used.
14 Correct 5 ms 7124 KB Correct: 3309 out of 12000 queries used.
15 Correct 9 ms 8296 KB Correct: 3297 out of 12000 queries used.
16 Correct 7 ms 8276 KB Correct: 3292 out of 12000 queries used.
17 Correct 7 ms 7576 KB Correct: 3878 out of 12000 queries used.
18 Correct 25 ms 7592 KB Correct: 3347 out of 12000 queries used.
19 Correct 7 ms 7892 KB Correct: 3667 out of 12000 queries used.
20 Correct 6 ms 7464 KB Correct: 3032 out of 12000 queries used.
21 Correct 6 ms 8276 KB Correct: 3438 out of 25000 queries used.
22 Correct 5 ms 7252 KB Correct: 3520 out of 25000 queries used.
23 Correct 6 ms 8312 KB Correct: 3875 out of 25000 queries used.
24 Correct 6 ms 8268 KB Correct: 4846 out of 25000 queries used.
25 Correct 7 ms 8276 KB Correct: 6300 out of 25000 queries used.
26 Correct 8 ms 8148 KB Correct: 5575 out of 25000 queries used.
27 Correct 7 ms 8276 KB Correct: 6207 out of 25000 queries used.
28 Correct 7 ms 8276 KB Correct: 5730 out of 25000 queries used.
29 Correct 7 ms 8352 KB Correct: 5934 out of 25000 queries used.
30 Correct 7 ms 8276 KB Correct: 6298 out of 25000 queries used.
31 Correct 8 ms 8372 KB Correct: 6456 out of 25000 queries used.
32 Correct 6 ms 6356 KB Correct: 3013 out of 25000 queries used.
33 Correct 6 ms 8312 KB Correct: 6424 out of 25000 queries used.
34 Correct 6 ms 8276 KB Correct: 6723 out of 25000 queries used.
35 Correct 8 ms 8276 KB Correct: 6406 out of 25000 queries used.
36 Correct 7 ms 8312 KB Correct: 6410 out of 25000 queries used.
37 Correct 7 ms 8276 KB Correct: 6427 out of 25000 queries used.
38 Correct 6 ms 8276 KB Correct: 6457 out of 25000 queries used.
39 Correct 7 ms 8312 KB Correct: 6632 out of 25000 queries used.
40 Correct 6 ms 8312 KB Correct: 6438 out of 25000 queries used.
41 Correct 6 ms 8276 KB Correct: 6435 out of 25000 queries used.
42 Correct 6 ms 8364 KB Correct: 6487 out of 25000 queries used.
43 Correct 6 ms 8276 KB Correct: 3680 out of 25000 queries used.
44 Correct 7 ms 8228 KB Correct: 6402 out of 25000 queries used.
45 Correct 6 ms 8276 KB Correct: 6445 out of 25000 queries used.
46 Correct 7 ms 8276 KB Correct: 6576 out of 25000 queries used.
47 Correct 6 ms 8276 KB Correct: 6457 out of 25000 queries used.
48 Correct 6 ms 8276 KB Correct: 6429 out of 25000 queries used.
49 Correct 7 ms 8228 KB Correct: 6463 out of 25000 queries used.
50 Correct 8 ms 8276 KB Correct: 6467 out of 25000 queries used.
51 Correct 9 ms 8276 KB Correct: 6436 out of 25000 queries used.
52 Correct 7 ms 8364 KB Correct: 6543 out of 25000 queries used.
53 Correct 7 ms 8344 KB Correct: 6572 out of 25000 queries used.
54 Correct 5 ms 7508 KB Correct: 3614 out of 25000 queries used.
55 Correct 6 ms 8276 KB Correct: 6476 out of 25000 queries used.
56 Correct 7 ms 8308 KB Correct: 6691 out of 25000 queries used.
57 Correct 6 ms 8232 KB Correct: 6463 out of 25000 queries used.
58 Correct 6 ms 8276 KB Correct: 6574 out of 25000 queries used.
59 Correct 7 ms 8276 KB Correct: 6474 out of 25000 queries used.
60 Correct 6 ms 8276 KB Correct: 7271 out of 25000 queries used.
61 Correct 6 ms 7764 KB Correct: 5607 out of 25000 queries used.
62 Correct 6 ms 7848 KB Correct: 6890 out of 25000 queries used.
63 Correct 6 ms 8276 KB Correct: 6413 out of 25000 queries used.
64 Correct 6 ms 8148 KB Correct: 6262 out of 25000 queries used.
65 Correct 9 ms 8312 KB Correct: 8888 out of 25000 queries used.
66 Correct 7 ms 8276 KB Correct: 5166 out of 25000 queries used.
67 Correct 6 ms 8148 KB Correct: 3546 out of 25000 queries used.
68 Correct 26 ms 8308 KB Correct: 17047 out of 25000 queries used.
69 Correct 6 ms 8020 KB Correct: 3934 out of 25000 queries used.
70 Correct 13 ms 8148 KB Correct: 6764 out of 25000 queries used.