oj.uz

답안 #1024443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024443 2024-07-16T05:16:06 Z thinknoexit City Mapping (NOI18_citymapping) C++17
32 / 100
 2 ms 8284 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1010;
ll dis[N][N];
int n;
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 find_roads(int NN, int Q, int A[], int B[], int W[]) {
	n = NN;
	ll mx = 0;
	int idx = 0;
	for (int i = 2;i <= n;i++) {
		if (d(1, i) > mx) {
			mx = d(1, i);
			idx = i;
		}
	}
	vector<pair<ll, int>> v;
	for (int i = 1;i <= n;i++) {
		v.push_back({ d(idx, i), i });
	}
	sort(v.begin(), v.end());
	for (int i = 1;i < n;i++) {
		A[i - 1] = v[i - 1].second;
		B[i - 1] = v[i].second;
		W[i - 1] = v[i].first - v[i - 1].first;
	}
	return;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Correct: 1995 out of 500000 queries used.
2 Incorrect 1 ms 7512 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Correct: 1995 out of 500000 queries used.
2 Incorrect 1 ms 7512 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Correct: 1979 out of 12000 queries used.
2 Correct 2 ms 7772 KB Correct: 1983 out of 12000 queries used.
3 Correct 1 ms 7772 KB Correct: 1997 out of 12000 queries used.
4 Correct 2 ms 7772 KB Correct: 1983 out of 12000 queries used.
5 Correct 2 ms 8028 KB Correct: 1979 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Correct: 1979 out of 12000 queries used.
2 Correct 2 ms 7772 KB Correct: 1983 out of 12000 queries used.
3 Correct 1 ms 7772 KB Correct: 1997 out of 12000 queries used.
4 Correct 2 ms 7772 KB Correct: 1983 out of 12000 queries used.
5 Correct 2 ms 8028 KB Correct: 1979 out of 12000 queries used.
6 Correct 2 ms 8284 KB Correct: 1993 out of 12000 queries used.
7 Correct 2 ms 7772 KB Correct: 1989 out of 12000 queries used.
8 Correct 2 ms 7696 KB Correct: 1997 out of 12000 queries used.
9 Correct 2 ms 8284 KB Correct: 1991 out of 12000 queries used.
10 Correct 2 ms 7772 KB Correct: 1985 out of 12000 queries used.

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Correct: 1995 out of 500000 queries used.
2 Incorrect 1 ms 7512 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -