oj.uz

Submission #147502

# Submission time Handle Problem Language Result Execution time Memory
147502 2019-08-29T19:49:21 Z JovanK26 City Mapping (NOI18_citymapping) C++14
25 / 100
 137 ms 9940 KB 
#include "citymapping.h"
#include<bits/stdc++.h>
using namespace std;
struct edge
{
    int a;
    int b;
    long long w;
};
vector<edge> edg;
bool cmp(edge i,edge j)
{
    return i.w<j.w;
}
bool vis[1001][1001];
int prt[1001];
int sz[1001];
int findd(int x)
{
    while(prt[x]!=x)
    {
        x=prt[x];
    }
    return x;
}
void unionn(int x,int y)
{
    x=findd(x);
    y=findd(y);
    if(sz[x]<sz[y])swap(x,y);
    prt[y]=x;
    sz[x]+=sz[y];
}
void find_roads(int N, int Q, int A[], int B[], int W[]) {
    int br=0;
    for(int i=0;i<=N;i++)
    {
        prt[i]=i;
        sz[i]=1;
    }
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;j++)
        {
            if(i==j)continue;
            if(vis[i][j] || vis[j][i])continue;
            vis[i][j]=1;
            vis[j][i]=1;
            long long temp=get_distance(i,j);
            edge tmp;
            tmp.a=i;
            tmp.b=j;
            tmp.w=temp;
            edg.push_back(tmp);
        }
    }
    sort(edg.begin(),edg.end(),cmp);
    for(int i=0;i<edg.size();i++)
    {
        if(findd(edg[i].a)!=findd(edg[i].b))
        {
            unionn(edg[i].a,edg[i].b);
            A[br]=edg[i].a;
            B[br]=edg[i].b;
            W[br]=edg[i].w;
            br++;
        }
    }
	return;
}

Compilation message

citymapping.cpp: In function 'void find_roads(int, int, int*, int*, int*)':
citymapping.cpp:58:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<edg.size();i++)
                 ~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 9820 KB Correct: 498501 out of 500000 queries used.
2 Correct 119 ms 9820 KB Correct: 499500 out of 500000 queries used.
3 Correct 95 ms 9820 KB Correct: 492528 out of 500000 queries used.
4 Correct 92 ms 9940 KB Correct: 494515 out of 500000 queries used.
5 Correct 111 ms 9820 KB Correct: 498501 out of 500000 queries used.

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 9820 KB Correct: 498501 out of 500000 queries used.
2 Correct 119 ms 9820 KB Correct: 499500 out of 500000 queries used.
3 Correct 95 ms 9820 KB Correct: 492528 out of 500000 queries used.
4 Correct 92 ms 9940 KB Correct: 494515 out of 500000 queries used.
5 Correct 111 ms 9820 KB Correct: 498501 out of 500000 queries used.
6 Correct 134 ms 9820 KB Correct: 495510 out of 500000 queries used.
7 Correct 133 ms 9820 KB Correct: 497503 out of 500000 queries used.
8 Correct 128 ms 9820 KB Correct: 497503 out of 500000 queries used.
9 Correct 125 ms 9828 KB Correct: 495510 out of 500000 queries used.
10 Correct 137 ms 9808 KB Correct: 496506 out of 500000 queries used.

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 1784 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 1784 KB Too many calls to get_distance().
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 9820 KB Correct: 498501 out of 500000 queries used.
2 Correct 119 ms 9820 KB Correct: 499500 out of 500000 queries used.
3 Correct 95 ms 9820 KB Correct: 492528 out of 500000 queries used.
4 Correct 92 ms 9940 KB Correct: 494515 out of 500000 queries used.
5 Correct 111 ms 9820 KB Correct: 498501 out of 500000 queries used.
6 Correct 134 ms 9820 KB Correct: 495510 out of 500000 queries used.
7 Correct 133 ms 9820 KB Correct: 497503 out of 500000 queries used.
8 Correct 128 ms 9820 KB Correct: 497503 out of 500000 queries used.
9 Correct 125 ms 9828 KB Correct: 495510 out of 500000 queries used.
10 Correct 137 ms 9808 KB Correct: 496506 out of 500000 queries used.
11 Incorrect 5 ms 1784 KB Too many calls to get_distance().
12 Halted 0 ms 0 KB -