oj.uz

Submission #836176

# Submission time Handle Problem Language Result Execution time Memory
836176 2023-08-24T08:24:21 Z Liudas City Mapping (NOI18_citymapping) C++17
0 / 100
 2 ms 468 KB 
#include "citymapping.h"
#include <bits/stdc++.h>
using namespace std;	
void find_roads(int N, int Q, int A[], int B[], int W[]) {
	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];
		cout << A[i] << " " << B[i] << " " << W[i] << endl;
	}
	return;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB DO NOT PRINT ANYTHING TO STANDARD OUTPUT
2 Halted 0 ms 0 KB -