답안 #412598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412598 2021-05-27T06:52:40 Z 조영욱(#7650) Travelling Merchant (CCO21_day2problem1) C++17
0 / 25
255 ms 15988 KB
#include <bits/stdc++.h>
using namespace std;

int p[200000];
typedef pair<int,int> P;
typedef pair<int,P> iP;
vector<iP> edge;
vector<int> adj[200000];
int arr[200000];
int val;

int find(int a) {
    if (p[a]<0) {
        return a;
    }
    return p[a]=find(p[a]);
}

void merge(int a,int b) {
    a=find(a);
    b=find(b);
    if (a==b) {
        return;
    }
    p[b]=a;
}

void dfs(int v,int prev) {
    arr[v]=val;
    for(int i=0;i<adj[v].size();i++) {
        int nt=adj[v][i];
        if (nt==prev) {
            continue;
        }
        dfs(nt,v);
    }
}

int main(void) {
    memset(p,-1,sizeof(p));
    memset(arr,-1,sizeof(arr));
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++) {
        int a,b,r,p;
        scanf("%d %d %d %d",&a,&b,&r,&p);
        a--;
        b--;
        edge.push_back(iP(r,P(a,b)));
    }
    sort(edge.begin(),edge.end());
    for(int i=0;i<edge.size();i++) {
        val=edge[i].first;
        int u=edge[i].second.first;
        int v=edge[i].second.second;
        if (find(u)==find(v)) {
            if (arr[u]==-1) {
                dfs(u,-1);
            }
            continue;
        }
        merge(u,v);
        adj[u].push_back(v);
        adj[v].push_back(u);
        if (arr[u]==-1&&arr[v]==-1) {

        }
        else if (arr[u]==-1) {
            dfs(u,v);
        }
        else if (arr[v]==-1) {
            dfs(v,u);
        }
    }
    for(int i=0;i<n;i++) {
        printf("%d ",arr[i]);
    }
}

Compilation message

Main.cpp: In function 'void dfs(int, int)':
Main.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<adj[v].size();i++) {
      |                 ~^~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=0;i<edge.size();i++) {
      |                 ~^~~~~~~~~~~~
Main.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
Main.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         scanf("%d %d %d %d",&a,&b,&r,&p);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 6604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 255 ms 15988 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 6604 KB Output isn't correct
2 Halted 0 ms 0 KB -