oj.uz

Submission #499288

# Submission time Handle Problem Language Result Execution time Memory
499288 2021-12-27T19:08:15 Z blue City Mapping (NOI18_citymapping) C++17
32 / 100
 2 ms 464 KB 
#include "citymapping.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

using ll = long long;
using vi = vector<int>;

void find_roads(int N, int Q, int A[], int B[], int W[])
{
	vector< pair<ll, int> > E;
    for(int i = 2; i <= N; i++) E.push_back({get_distance(1, i), i});
    sort(E.begin(), E.end());

    int D = E.back().second;

    E.clear();
    for(int i = 1; i <= N; i++)
        if(i != D)
            E.push_back({get_distance(D, i), i});
    E.push_back({0, D});
    
    sort(E.begin(), E.end());

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

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Correct: 1996 out of 500000 queries used.
2 Incorrect 1 ms 460 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 460 KB Correct: 1996 out of 500000 queries used.
2 Incorrect 1 ms 460 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 2 ms 460 KB Correct: 1980 out of 12000 queries used.
2 Correct 1 ms 464 KB Correct: 1984 out of 12000 queries used.
3 Correct 1 ms 436 KB Correct: 1998 out of 12000 queries used.
4 Correct 1 ms 452 KB Correct: 1984 out of 12000 queries used.
5 Correct 1 ms 464 KB Correct: 1980 out of 12000 queries used.

Subtask #4
19.0 / 19.0

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

Subtask #5
0 / 43.0

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