oj.uz

Submission #1024888

# Submission time Handle Problem Language Result Execution time Memory
1024888 2024-07-16T11:53:37 Z thinknoexit City Mapping (NOI18_citymapping) C++17
63.96 / 100
 4 ms 8796 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1010;
mt19937 rnd(time(NULL));
int n;
ll dis[N][N];
int A[N], B[N], W[N], tot;
ll d(int i, int j) {
	if (i == j) return 0;
	if (!dis[i][j]) return dis[i][j] = dis[j][i] = get_distance(i, j);
	return dis[i][j];
}
void play(vector<int>& v, int U, int V) {
	int m = v.size();
	if (m == 1) return;
	if (m == 2) {
		A[tot] = U;
		B[tot] = V;
		W[tot] = d(U, V);
		tot++;
		return;
	}
	ll all = d(U, V);
	vector<pair<ll, int>> in, rem;
	for (auto& x : v) {
		if (d(U, x) + d(x, V) == all) in.push_back({ d(V, x), x });
		else {
			ll extra = (d(U, x) + d(x, V) - all) / 2;
			rem.push_back({ d(V, x) - extra, x });
		}
	}
	sort(in.begin(), in.end());
	sort(rem.begin(), rem.end());
	vector<vector<int>> r;
	vector<int> p2, p3;
	int p = 0;
	for (int i = 1;i < (int)in.size();i++) {
		A[tot] = in[i - 1].second;
		B[tot] = in[i].second;
		W[tot] = in[i].first - in[i - 1].first;
		tot++;
		vector<int> nw;
		ll mn = LLONG_MAX;
		int idx = 0;
		while (p < (int)rem.size() && rem[p].first == in[i].first) {
			int vl = rem[p].second;
			ll extra = (d(U, vl) + d(vl, V) - all) / 2;
			if (extra < mn) {
				mn = extra;
				idx = vl;
			}
			nw.push_back(vl);
			p++;
		}
		if (!nw.empty()) {
			A[tot] = idx;
			B[tot] = in[i].second;
			W[tot] = mn;
			tot++;
			ll mx = -1;
			int idx2 = 0;
			for (auto& x : nw) {
				dis[idx][x] = dis[x][idx] = d(V, x) - mn - in[i].first;
				if (dis[idx][x] > mx) {
					mx = dis[idx][x];
					idx2 = x;
				}
			}
			r.push_back(nw);
			p2.push_back(idx);
			p3.push_back(idx2);
		}
	}
	for (int i = 0;i < (int)r.size();i++) {
		play(r[i], p2[i], p3[i]);
	}
}
void find_roads(int NN, int Q, int A[], int B[], int W[]) {
	n = NN;
	vector<int> init(n);
	iota(init.begin(), init.end(), 1);
	int leaf = 0, leaf2 = 0;
	ll mx = -1;
	for (int i = 2;i <= n;i++) {
		if (d(1, i) > mx) {
			mx = d(1, i);
			leaf = i;
		}
	}
	mx = -1;
	for (int i = 1;i <= n;i++) {
		if (d(leaf, i) > mx) {
			mx = d(leaf, i);
			leaf2 = i;
		}
	}
	play(init, leaf, leaf2);
	for (int i = 0;i < n - 1;i++) {
		A[i] = ::A[i];
		B[i] = ::B[i];
		W[i] = ::W[i];
		//cout << A[i] << ' ' << B[i] << ' ' << W[i] << '\n';
	}
	return;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Correct: 2991 out of 500000 queries used.
2 Correct 2 ms 8128 KB Correct: 2994 out of 500000 queries used.
3 Correct 3 ms 8424 KB Correct: 4956 out of 500000 queries used.
4 Correct 2 ms 8280 KB Correct: 5682 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 11545 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Correct: 2991 out of 500000 queries used.
2 Correct 2 ms 8128 KB Correct: 2994 out of 500000 queries used.
3 Correct 3 ms 8424 KB Correct: 4956 out of 500000 queries used.
4 Correct 2 ms 8280 KB Correct: 5682 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 11545 out of 500000 queries used.
6 Correct 2 ms 8028 KB Correct: 2982 out of 500000 queries used.
7 Correct 4 ms 8796 KB Correct: 15417 out of 500000 queries used.
8 Correct 3 ms 8536 KB Correct: 4996 out of 500000 queries used.
9 Correct 3 ms 8280 KB Correct: 5919 out of 500000 queries used.
10 Correct 3 ms 8284 KB Correct: 5573 out of 500000 queries used.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Correct: 2967 out of 12000 queries used.
2 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
3 Correct 2 ms 8284 KB Correct: 2994 out of 12000 queries used.
4 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
5 Correct 2 ms 8284 KB Correct: 2967 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Correct: 2967 out of 12000 queries used.
2 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
3 Correct 2 ms 8284 KB Correct: 2994 out of 12000 queries used.
4 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
5 Correct 2 ms 8284 KB Correct: 2967 out of 12000 queries used.
6 Correct 2 ms 8540 KB Correct: 2988 out of 12000 queries used.
7 Correct 2 ms 8028 KB Correct: 2982 out of 12000 queries used.
8 Correct 2 ms 8212 KB Correct: 2994 out of 12000 queries used.
9 Correct 2 ms 8284 KB Correct: 2985 out of 12000 queries used.
10 Correct 2 ms 8284 KB Correct: 2976 out of 12000 queries used.

Subtask #5
6.96 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Correct: 2991 out of 500000 queries used.
2 Correct 2 ms 8128 KB Correct: 2994 out of 500000 queries used.
3 Correct 3 ms 8424 KB Correct: 4956 out of 500000 queries used.
4 Correct 2 ms 8280 KB Correct: 5682 out of 500000 queries used.
5 Correct 3 ms 8540 KB Correct: 11545 out of 500000 queries used.
6 Correct 2 ms 8028 KB Correct: 2982 out of 500000 queries used.
7 Correct 4 ms 8796 KB Correct: 15417 out of 500000 queries used.
8 Correct 3 ms 8536 KB Correct: 4996 out of 500000 queries used.
9 Correct 3 ms 8280 KB Correct: 5919 out of 500000 queries used.
10 Correct 3 ms 8284 KB Correct: 5573 out of 500000 queries used.
11 Correct 2 ms 8028 KB Correct: 2967 out of 12000 queries used.
12 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
13 Correct 2 ms 8284 KB Correct: 2994 out of 12000 queries used.
14 Correct 2 ms 8028 KB Correct: 2973 out of 12000 queries used.
15 Correct 2 ms 8284 KB Correct: 2967 out of 12000 queries used.
16 Correct 2 ms 8540 KB Correct: 2988 out of 12000 queries used.
17 Correct 2 ms 8028 KB Correct: 2982 out of 12000 queries used.
18 Correct 2 ms 8212 KB Correct: 2994 out of 12000 queries used.
19 Correct 2 ms 8284 KB Correct: 2985 out of 12000 queries used.
20 Correct 2 ms 8284 KB Correct: 2976 out of 12000 queries used.
21 Correct 2 ms 8540 KB Correct: 2982 out of 25000 queries used.
22 Correct 4 ms 8280 KB Correct: 5352 out of 25000 queries used.
23 Correct 2 ms 8284 KB Correct: 3015 out of 25000 queries used.
24 Correct 3 ms 8540 KB Correct: 4317 out of 25000 queries used.
25 Correct 3 ms 8432 KB Correct: 5038 out of 25000 queries used.
26 Correct 2 ms 8284 KB Correct: 4791 out of 25000 queries used.
27 Correct 2 ms 8284 KB Correct: 4937 out of 25000 queries used.
28 Correct 3 ms 8540 KB Correct: 5073 out of 25000 queries used.
29 Correct 2 ms 8540 KB Correct: 5331 out of 25000 queries used.
30 Correct 2 ms 8280 KB Correct: 5533 out of 25000 queries used.
31 Correct 3 ms 8408 KB Correct: 5707 out of 25000 queries used.
32 Correct 2 ms 8028 KB Correct: 2979 out of 25000 queries used.
33 Correct 3 ms 8284 KB Correct: 5557 out of 25000 queries used.
34 Correct 3 ms 8536 KB Correct: 5709 out of 25000 queries used.
35 Correct 3 ms 8488 KB Correct: 5662 out of 25000 queries used.
36 Correct 3 ms 8284 KB Correct: 5668 out of 25000 queries used.
37 Correct 3 ms 8488 KB Correct: 5682 out of 25000 queries used.
38 Correct 2 ms 8284 KB Correct: 5711 out of 25000 queries used.
39 Correct 2 ms 8540 KB Correct: 5686 out of 25000 queries used.
40 Correct 2 ms 8540 KB Correct: 5692 out of 25000 queries used.
41 Correct 2 ms 8376 KB Correct: 5685 out of 25000 queries used.
42 Correct 3 ms 8284 KB Correct: 5700 out of 25000 queries used.
43 Correct 2 ms 8540 KB Correct: 2988 out of 25000 queries used.
44 Correct 3 ms 8284 KB Correct: 5626 out of 25000 queries used.
45 Correct 2 ms 8284 KB Correct: 5663 out of 25000 queries used.
46 Correct 4 ms 8284 KB Correct: 5630 out of 25000 queries used.
47 Correct 3 ms 8476 KB Correct: 5686 out of 25000 queries used.
48 Correct 3 ms 8284 KB Correct: 5716 out of 25000 queries used.
49 Correct 3 ms 8540 KB Correct: 5716 out of 25000 queries used.
50 Correct 2 ms 8540 KB Correct: 5702 out of 25000 queries used.
51 Correct 3 ms 8280 KB Correct: 5718 out of 25000 queries used.
52 Correct 3 ms 8536 KB Correct: 5684 out of 25000 queries used.
53 Correct 3 ms 8540 KB Correct: 5972 out of 25000 queries used.
54 Correct 3 ms 8796 KB Correct: 15466 out of 25000 queries used.
55 Correct 2 ms 8284 KB Correct: 5707 out of 25000 queries used.
56 Correct 2 ms 8524 KB Correct: 5687 out of 25000 queries used.
57 Correct 2 ms 8540 KB Correct: 5972 out of 25000 queries used.
58 Correct 2 ms 8420 KB Correct: 5639 out of 25000 queries used.
59 Correct 3 ms 8280 KB Correct: 5670 out of 25000 queries used.
60 Correct 3 ms 8540 KB Correct: 6779 out of 25000 queries used.
61 Correct 3 ms 8284 KB Correct: 6706 out of 25000 queries used.
62 Correct 2 ms 8284 KB Correct: 5944 out of 25000 queries used.
63 Correct 2 ms 8540 KB Correct: 5996 out of 25000 queries used.
64 Correct 2 ms 8284 KB Correct: 5973 out of 25000 queries used.
65 Correct 3 ms 8284 KB Correct: 7399 out of 25000 queries used.
66 Correct 2 ms 8540 KB Correct: 6560 out of 25000 queries used.
67 Correct 2 ms 8540 KB Correct: 3180 out of 25000 queries used.
68 Correct 3 ms 8796 KB Correct: 15958 out of 25000 queries used.
69 Correct 4 ms 8540 KB Correct: 10857 out of 25000 queries used.
70 Correct 3 ms 8540 KB Correct: 11851 out of 25000 queries used.