oj.uz

Submission #1030989

# Submission time Handle Problem Language Result Execution time Memory
1030989 2024-07-22T13:16:51 Z vjudge1 City Mapping (NOI18_citymapping) C++17
32 / 100
 1 ms 604 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 1e3+3;

mt19937 rng(time(nullptr) + 69);

int n, nd[N], deg[N];
pair<int, int> p[N], d[N];

void find_roads(signed N, signed Q, signed A[], signed B[], signed W[]) {
	n = N;
	
	d[0] = make_pair(0, 1);
	for (int i = 2; i <= n; i++) {
		d[i-1] = make_pair(get_distance(1, i), i);
	}
	sort(d, d+n);

	int x = d[n-1].second;
	for (int i = 1; i <= n; i++) {
		if (x == i) d[i-1] = make_pair(0, x);
		else d[i-1] = make_pair(get_distance(x, i), i);
	}
	sort(d, d+n);

	for (int i = 0; i < n-1; i++) {
		A[i] = d[i].second;
		B[i] = d[i+1].second;
		W[i] = d[i+1].first - d[i].first;
	}

	/*
	for (int i = 0; i < n; i++) {
		nd[i] = i+1;
		deg[i] = 0;
	}
	shuffle(nd, nd+n, rng);
	
	d[0] = make_pair(0, nd[0]);
	for (int i = 1; i < n; i++) {
		d[i] = make_pair(get_distance(nd[0], nd[i]), nd[i]);
	}
	sort(d, d+n);

	set<int> st;
	for (int i = 1; i < n; i++) {
		int mn = d[i].first;
		int best = nd[0];
		for (int j : st) {
			if (mn == 1) break;

			int x = get_distance(j, d[i].second);
			if (x < mn) {
				mn = x;
				best = j;
			}
		}
		p[d[i].second] = make_pair(best, mn);
		
		if (++deg[best] == 3) {
			st.erase(best);
		}
		st.insert(d[i].second);
	}

	for (int i = 0; i < N-1; i++) {
		A[i] = p[nd[i+1]].first;
		B[i] = nd[i+1];
		W[i] = p[nd[i+1]].second;
	}
	return;
*/
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 480 KB Correct: 1996 out of 500000 queries used.
2 Incorrect 1 ms 480 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 480 KB Correct: 1996 out of 500000 queries used.
2 Incorrect 1 ms 480 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 476 KB Correct: 1980 out of 12000 queries used.
2 Correct 1 ms 604 KB Correct: 1984 out of 12000 queries used.
3 Correct 1 ms 604 KB Correct: 1998 out of 12000 queries used.
4 Correct 1 ms 604 KB Correct: 1984 out of 12000 queries used.
5 Correct 1 ms 604 KB Correct: 1980 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 476 KB Correct: 1980 out of 12000 queries used.
2 Correct 1 ms 604 KB Correct: 1984 out of 12000 queries used.
3 Correct 1 ms 604 KB Correct: 1998 out of 12000 queries used.
4 Correct 1 ms 604 KB Correct: 1984 out of 12000 queries used.
5 Correct 1 ms 604 KB Correct: 1980 out of 12000 queries used.
6 Correct 1 ms 604 KB Correct: 1994 out of 12000 queries used.
7 Correct 1 ms 604 KB Correct: 1990 out of 12000 queries used.
8 Correct 1 ms 604 KB Correct: 1998 out of 12000 queries used.
9 Correct 1 ms 604 KB Correct: 1992 out of 12000 queries used.
10 Correct 1 ms 604 KB Correct: 1986 out of 12000 queries used.

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 480 KB Correct: 1996 out of 500000 queries used.
2 Incorrect 1 ms 480 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -