oj.uz

답안 #836491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
836491 2023-08-24T11:48:45 Z Liudas City Mapping (NOI18_citymapping) C++17
32 / 100
 253 ms 27760 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> par;
int get(int x){
	if(par[x] != x){
		return par[x] = get(par[x]);
	}
	return x;
}
void merge(int a, int b){
	par[get(a)] = get(b);
}
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	if(Q == 500000){
		par.resize(N);
		vector<vector<long long>> tree;
		int p = 0;
		for(int i = 0; i < N; i ++){
			for(int j = i + 1; j < N; j ++){
				tree.push_back({get_distance(i+1, j+1), i+1, j+1});
			}
		}
		sort(tree.begin(), tree.end());
		for(auto i : tree){
			int a = i[0], b = i[1], c = i[2];
			if(get(b) != get(c)){
				merge(b,c);
				A[p] = b;
				B[p] = c;
				W[p++] = a; 
			}
		}
	}
	else{
		vector<pair<long long, long long>> dist(N, {0, 0});
		for(int i = 1; i < N; i ++){
			dist[i] = {get_distance(1, i + 1), i};
		}
		sort(dist.rbegin(), dist.rend());
		for(int i = 1; i < N; i ++){
			dist[i] = {get_distance(dist[i].second + 1, dist[0].second + 1), dist[i].second};
		}
		long long total = 0;
		dist[0] = {0, dist[0].second};
		sort(dist.begin(), dist.end());
		for(int i = 1; i < N; i ++){
			W[i-1] = dist[i].first - total;
			A[i-1] = dist[i-1].second + 1;
			B[i-1] = dist[i].second + 1;
			total += W[i-1];
		}
	}
	return;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 253 ms 27760 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 253 ms 27760 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Correct: 1980 out of 12000 queries used.
2 Correct 1 ms 468 KB Correct: 1984 out of 12000 queries used.
3 Correct 1 ms 468 KB Correct: 1998 out of 12000 queries used.
4 Correct 1 ms 484 KB Correct: 1984 out of 12000 queries used.
5 Correct 1 ms 468 KB Correct: 1980 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Correct: 1980 out of 12000 queries used.
2 Correct 1 ms 468 KB Correct: 1984 out of 12000 queries used.
3 Correct 1 ms 468 KB Correct: 1998 out of 12000 queries used.
4 Correct 1 ms 484 KB Correct: 1984 out of 12000 queries used.
5 Correct 1 ms 468 KB Correct: 1980 out of 12000 queries used.
6 Correct 1 ms 468 KB Correct: 1994 out of 12000 queries used.
7 Correct 1 ms 468 KB Correct: 1990 out of 12000 queries used.
8 Correct 1 ms 468 KB Correct: 1998 out of 12000 queries used.
9 Correct 1 ms 468 KB Correct: 1992 out of 12000 queries used.
10 Correct 1 ms 468 KB Correct: 1986 out of 12000 queries used.

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 253 ms 27760 KB Reported list of edges differ from actual.
2 Halted 0 ms 0 KB -