oj.uz

Submission #961462

# Submission time Handle Problem Language Result Execution time Memory
961462 2024-04-12T06:42:16 Z vjudge1 City Mapping (NOI18_citymapping) C++17
25 / 100
 42 ms 13652 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ent "\n"

const int maxn = 1e3 + 100;
const ll INF = (ll)1e18 + 100;
const int inf = 1e9 + 100;
const int MOD = 1e9 + 7;
const int maxl = 30;
const int P = 31;

long long get_distance(int X, int Y);

int n;
ll d[maxn][maxn];
vector<pii> ans;

void calc(vector<int> v){
	sort(v.begin(), v.end(), [](int i, int j){
		return d[1][i] < d[1][j];
	});
	vector<vector<int>> to;
	for(int i: v){
		if(i == v[0]) continue;
		bool ok = 1;
		for(auto &s: to){
			if(d[v[0]][s[0]] + d[s[0]][i] == d[v[0]][i]){
				s.push_back(i);
				ok = 0;
				break;
			}
		}
		if(ok) to.push_back({i});
	}
	for(auto &s: to){
		ans.push_back({v[0], s[0]});
		calc(s);
	}
}

void find_roads(int N, int Q, int A[], int B[], int W[]){
	n = N;
	for(int i = 1; i <= n; i++){
		for(int j = i + 1; j <= n; j++){
			d[i][j] = d[j][i] = get_distance(i, j);
		}
	}
	vector<int> v;
	for(int i = 1; i <= n; i++){
		v.push_back(i);
	}
	calc(v);
	for(int i = 0; i < n-1; i++){
		A[i] = ans[i].first;
		B[i] = ans[i].second;
		W[i] = d[A[i]][B[i]];
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 10476 KB Correct: 498501 out of 500000 queries used.
2 Correct 37 ms 11088 KB Correct: 499500 out of 500000 queries used.
3 Correct 27 ms 9104 KB Correct: 492528 out of 500000 queries used.
4 Correct 27 ms 9148 KB Correct: 494515 out of 500000 queries used.
5 Correct 37 ms 9300 KB Correct: 498501 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 10476 KB Correct: 498501 out of 500000 queries used.
2 Correct 37 ms 11088 KB Correct: 499500 out of 500000 queries used.
3 Correct 27 ms 9104 KB Correct: 492528 out of 500000 queries used.
4 Correct 27 ms 9148 KB Correct: 494515 out of 500000 queries used.
5 Correct 37 ms 9300 KB Correct: 498501 out of 500000 queries used.
6 Correct 37 ms 13652 KB Correct: 495510 out of 500000 queries used.
7 Correct 38 ms 11344 KB Correct: 497503 out of 500000 queries used.
8 Correct 27 ms 9164 KB Correct: 497503 out of 500000 queries used.
9 Correct 24 ms 9304 KB Correct: 495510 out of 500000 queries used.
10 Correct 36 ms 9296 KB Correct: 496506 out of 500000 queries used.

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9052 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9052 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 10476 KB Correct: 498501 out of 500000 queries used.
2 Correct 37 ms 11088 KB Correct: 499500 out of 500000 queries used.
3 Correct 27 ms 9104 KB Correct: 492528 out of 500000 queries used.
4 Correct 27 ms 9148 KB Correct: 494515 out of 500000 queries used.
5 Correct 37 ms 9300 KB Correct: 498501 out of 500000 queries used.
6 Correct 37 ms 13652 KB Correct: 495510 out of 500000 queries used.
7 Correct 38 ms 11344 KB Correct: 497503 out of 500000 queries used.
8 Correct 27 ms 9164 KB Correct: 497503 out of 500000 queries used.
9 Correct 24 ms 9304 KB Correct: 495510 out of 500000 queries used.
10 Correct 36 ms 9296 KB Correct: 496506 out of 500000 queries used.
11 Incorrect 2 ms 9052 KB Too many calls to get_distance().
12 Halted 0 ms 0 KB -