oj.uz

답안 #147001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147001 2019-08-27T03:51:29 Z gs14004 City Mapping (NOI18_citymapping) C++17
68.96 / 100
 34 ms 8568 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
const int MAXN = 1005;
 
lint mem[MAXN][MAXN];
 
lint dist(int x, int y){
	if(x == y) return 0;
	if(mem[x][y]) return mem[x][y];
	return mem[x][y] = mem[y][x] = get_distance(x, y);
}
 
vector<pi> gph[MAXN];
lint dep[MAXN];
bool vis[MAXN];
vector<int> dfn;
int sz[MAXN], msz[MAXN];
 
void dfs(int x, int p){
	sz[x] = 1;
	msz[x] = 0;
	for(auto &i : gph[x]){
		if(!vis[i.second] && i.second != p){
			dfs(i.second, x);
			sz[x] += sz[i.second];
			msz[x] = max(msz[x], sz[i.second]);
		}
	}
	dfn.push_back(x);
}
 
int get_center(int v){
	dfn.clear();
	dfs(v, -1);
	pi ret(1e9, -1);
	for(auto &i : dfn){
		pi ans = pi(max(sz(dfn) - sz[i], msz[i]), i);
		ret = min(ret, ans);
	}
	return ret.second;
}
 
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	auto make_edge = [&](int s, int e, int x){
//		printf("make_edge(%d, %d, %d)\n", s, e, x);
		gph[s].emplace_back(x, e);
		gph[e].emplace_back(x, s);
		for(int i=0; i<N-1; i++){
			if(!W[i]){
				tie(A[i], B[i], W[i]) = make_tuple(s, e, x);
				break;
			}
		}
	};
	vector<pi> v;
	for(int i=2; i<=N; i++){
		dep[i] = dist(1, i);
		v.emplace_back(dep[i], i);
	}
	sort(v.begin(), v.end());
	vector<int> prv = {1};
	for(auto &i : v){
		if(sz(prv) == 1){
			make_edge(1, i.second, i.first);
			prv.push_back(i.second);
			continue;
		}
		memset(vis, 0, sizeof(vis));
		int cur_check = 1;
		pi lowest(dep[1], 1);
		while(!vis[cur_check]){
			int c = get_center(cur_check);
			vis[c] = 1;
			if(dist(1, c) + dist(c, i.second) == i.first){
				lowest = max(lowest, pi(dep[c], c));
				vector<int> sons;
				for(auto &j : gph[c]){
					if(dep[j.second] > dep[c]){
						sons.push_back(j.second);
					}
				}
				if(sons.empty()) break;
				random_shuffle(sons.begin(), sons.end());
				cur_check = sons.back();
				for(int j=0; j<sz(sons)-1; j++){
					if(dist(1, sons[j]) + dist(sons[j], i.second) == i.first){
						cur_check = sons[j];
					}
				}
			}
			else{
				for(auto &j : gph[c]){
					if(dep[j.second] < dep[c]){
						cur_check = j.second;
						break;
					}
				}
			}
		}
		make_edge(lowest.second, i.second, dist(lowest.second, i.second));
		prv.push_back(i.second);
	}
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8440 KB Correct: 9455 out of 500000 queries used.
2 Correct 33 ms 8440 KB Correct: 15308 out of 500000 queries used.
3 Correct 27 ms 8440 KB Correct: 11089 out of 500000 queries used.
4 Correct 26 ms 8568 KB Correct: 11194 out of 500000 queries used.
5 Correct 31 ms 8440 KB Correct: 10475 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8440 KB Correct: 9455 out of 500000 queries used.
2 Correct 33 ms 8440 KB Correct: 15308 out of 500000 queries used.
3 Correct 27 ms 8440 KB Correct: 11089 out of 500000 queries used.
4 Correct 26 ms 8568 KB Correct: 11194 out of 500000 queries used.
5 Correct 31 ms 8440 KB Correct: 10475 out of 500000 queries used.
6 Correct 32 ms 8460 KB Correct: 9409 out of 500000 queries used.
7 Correct 32 ms 8440 KB Correct: 11512 out of 500000 queries used.
8 Correct 27 ms 8440 KB Correct: 10983 out of 500000 queries used.
9 Correct 28 ms 8440 KB Correct: 10318 out of 500000 queries used.
10 Correct 33 ms 8440 KB Correct: 10675 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 8316 KB Correct: 9337 out of 12000 queries used.
2 Correct 32 ms 8440 KB Correct: 9356 out of 12000 queries used.
3 Correct 33 ms 8480 KB Correct: 9469 out of 12000 queries used.
4 Correct 32 ms 8440 KB Correct: 9350 out of 12000 queries used.
5 Correct 31 ms 8440 KB Correct: 9360 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 8316 KB Correct: 9337 out of 12000 queries used.
2 Correct 32 ms 8440 KB Correct: 9356 out of 12000 queries used.
3 Correct 33 ms 8480 KB Correct: 9469 out of 12000 queries used.
4 Correct 32 ms 8440 KB Correct: 9350 out of 12000 queries used.
5 Correct 31 ms 8440 KB Correct: 9360 out of 12000 queries used.
6 Correct 32 ms 8440 KB Correct: 9415 out of 12000 queries used.
7 Correct 32 ms 8440 KB Correct: 9395 out of 12000 queries used.
8 Correct 32 ms 8412 KB Correct: 9438 out of 12000 queries used.
9 Correct 32 ms 8412 KB Correct: 9424 out of 12000 queries used.
10 Correct 32 ms 8440 KB Correct: 9353 out of 12000 queries used.

Subtask #5
11.96 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8440 KB Correct: 9455 out of 500000 queries used.
2 Correct 33 ms 8440 KB Correct: 15308 out of 500000 queries used.
3 Correct 27 ms 8440 KB Correct: 11089 out of 500000 queries used.
4 Correct 26 ms 8568 KB Correct: 11194 out of 500000 queries used.
5 Correct 31 ms 8440 KB Correct: 10475 out of 500000 queries used.
6 Correct 32 ms 8460 KB Correct: 9409 out of 500000 queries used.
7 Correct 32 ms 8440 KB Correct: 11512 out of 500000 queries used.
8 Correct 27 ms 8440 KB Correct: 10983 out of 500000 queries used.
9 Correct 28 ms 8440 KB Correct: 10318 out of 500000 queries used.
10 Correct 33 ms 8440 KB Correct: 10675 out of 500000 queries used.
11 Correct 31 ms 8316 KB Correct: 9337 out of 12000 queries used.
12 Correct 32 ms 8440 KB Correct: 9356 out of 12000 queries used.
13 Correct 33 ms 8480 KB Correct: 9469 out of 12000 queries used.
14 Correct 32 ms 8440 KB Correct: 9350 out of 12000 queries used.
15 Correct 31 ms 8440 KB Correct: 9360 out of 12000 queries used.
16 Correct 32 ms 8440 KB Correct: 9415 out of 12000 queries used.
17 Correct 32 ms 8440 KB Correct: 9395 out of 12000 queries used.
18 Correct 32 ms 8412 KB Correct: 9438 out of 12000 queries used.
19 Correct 32 ms 8412 KB Correct: 9424 out of 12000 queries used.
20 Correct 32 ms 8440 KB Correct: 9353 out of 12000 queries used.
21 Correct 32 ms 8440 KB Correct: 9408 out of 25000 queries used.
22 Correct 31 ms 8440 KB Correct: 11630 out of 25000 queries used.
23 Correct 31 ms 8440 KB Correct: 11254 out of 25000 queries used.
24 Correct 32 ms 8440 KB Correct: 10291 out of 25000 queries used.
25 Correct 28 ms 8440 KB Correct: 11164 out of 25000 queries used.
26 Correct 28 ms 8312 KB Correct: 10919 out of 25000 queries used.
27 Correct 29 ms 8440 KB Correct: 10962 out of 25000 queries used.
28 Correct 27 ms 8440 KB Correct: 10800 out of 25000 queries used.
29 Correct 28 ms 8464 KB Correct: 10698 out of 25000 queries used.
30 Correct 27 ms 8312 KB Correct: 10674 out of 25000 queries used.
31 Correct 27 ms 8484 KB Correct: 10447 out of 25000 queries used.
32 Correct 32 ms 8440 KB Correct: 9366 out of 25000 queries used.
33 Correct 26 ms 8440 KB Correct: 10201 out of 25000 queries used.
34 Correct 27 ms 8440 KB Correct: 10438 out of 25000 queries used.
35 Correct 26 ms 8440 KB Correct: 10359 out of 25000 queries used.
36 Correct 27 ms 8440 KB Correct: 10370 out of 25000 queries used.
37 Correct 27 ms 8440 KB Correct: 10422 out of 25000 queries used.
38 Correct 29 ms 8440 KB Correct: 10247 out of 25000 queries used.
39 Correct 27 ms 8440 KB Correct: 10303 out of 25000 queries used.
40 Correct 27 ms 8424 KB Correct: 10333 out of 25000 queries used.
41 Correct 26 ms 8440 KB Correct: 10260 out of 25000 queries used.
42 Correct 27 ms 8440 KB Correct: 10314 out of 25000 queries used.
43 Correct 31 ms 8416 KB Correct: 9422 out of 25000 queries used.
44 Correct 26 ms 8440 KB Correct: 10202 out of 25000 queries used.
45 Correct 26 ms 8440 KB Correct: 10269 out of 25000 queries used.
46 Correct 26 ms 8440 KB Correct: 10223 out of 25000 queries used.
47 Correct 27 ms 8440 KB Correct: 10377 out of 25000 queries used.
48 Correct 26 ms 8440 KB Correct: 10305 out of 25000 queries used.
49 Correct 27 ms 8440 KB Correct: 10358 out of 25000 queries used.
50 Correct 27 ms 8440 KB Correct: 10355 out of 25000 queries used.
51 Correct 27 ms 8440 KB Correct: 10242 out of 25000 queries used.
52 Correct 28 ms 8476 KB Correct: 10339 out of 25000 queries used.
53 Correct 27 ms 8444 KB Correct: 10419 out of 25000 queries used.
54 Correct 31 ms 8412 KB Correct: 11030 out of 25000 queries used.
55 Correct 26 ms 8440 KB Correct: 10309 out of 25000 queries used.
56 Correct 27 ms 8444 KB Correct: 10220 out of 25000 queries used.
57 Correct 27 ms 8440 KB Correct: 10323 out of 25000 queries used.
58 Correct 26 ms 8440 KB Correct: 10321 out of 25000 queries used.
59 Correct 26 ms 8440 KB Correct: 10306 out of 25000 queries used.
60 Correct 31 ms 8568 KB Correct: 10466 out of 25000 queries used.
61 Correct 31 ms 8440 KB Correct: 10339 out of 25000 queries used.
62 Correct 30 ms 8444 KB Correct: 10353 out of 25000 queries used.
63 Correct 31 ms 8440 KB Correct: 10393 out of 25000 queries used.
64 Correct 31 ms 8440 KB Correct: 10430 out of 25000 queries used.
65 Correct 34 ms 8440 KB Correct: 10143 out of 25000 queries used.
66 Correct 31 ms 8440 KB Correct: 10683 out of 25000 queries used.
67 Correct 31 ms 8440 KB Correct: 11640 out of 25000 queries used.
68 Correct 32 ms 8440 KB Correct: 10696 out of 25000 queries used.
69 Correct 32 ms 8440 KB Correct: 11025 out of 25000 queries used.
70 Correct 31 ms 8440 KB Correct: 10837 out of 25000 queries used.