oj.uz

Submission #22764

# Submission time Handle Problem Language Result Execution time Memory
22764 2017-04-30T07:18:49 Z dried chocochip on Daegu asphalt(#897, suzy, zych1751, Acka) Logistical Metropolis (KRIII5_LM) C++
2 / 7
 103 ms 4852 KB 
//
// Created by Acka on 2017. 4. 30..
//

#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

struct Edge{
    int u, v, c;
    Edge(){}
    Edge(int u, int v, int c):u(u), v(v), c(c){}
    bool operator <(const Edge &A)const{
        return c < A.c;
    }
};

int par[1001];
Edge edge[300000];
vector<Edge> adj[1001];

int find(int x){
    return x == par[x] ? x : par[x] = find(par[x]);
}

void link(int x, int y){
    par[find(y)] = find(x);
}

int main()
{
    int N, M; scanf("%d %d", &N, &M);
    for(int i = 0, x, y, c; i < M; i++){
        scanf("%d %d %d", &x, &y, &c);
        edge[i] = Edge(x, y, c);
        adj[x].push_back(Edge(0, y, c));
        adj[y].push_back(Edge(0, x, c));
    }

    sort(edge, edge + M);

    for(int o = 1; o <= N; o++){
        for(int i = 1; i <= N; i++)
            par[i] = i;

        int sum = 0;
        for(int i = 0; i < adj[o].size(); i++){
            link(o, adj[o][i].v);
            sum += adj[o][i].c;
        }

        for(int i = 0; i < M; i++){
            int pu = find(edge[i].u), pv = find(edge[i].v);
            if(pu == pv) continue;
            link(pu, pv);
            sum += edge[i].c;
        }

        printf("%d\n", sum);
    }

    return 0;
}

Compilation message

LM.cpp: In function 'int main()':
LM.cpp:48:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < adj[o].size(); i++){
                          ^
LM.cpp:33:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int N, M; scanf("%d %d", &N, &M);
                                     ^
LM.cpp:35:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &x, &y, &c);
                                      ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4852 KB Output is correct
2 Correct 76 ms 4852 KB Output is correct
3 Correct 76 ms 4852 KB Output is correct
4 Correct 76 ms 4852 KB Output is correct
5 Correct 76 ms 4852 KB Output is correct
6 Correct 79 ms 4852 KB Output is correct
7 Correct 76 ms 4852 KB Output is correct
8 Correct 83 ms 4852 KB Output is correct
9 Correct 83 ms 4852 KB Output is correct
10 Correct 76 ms 4852 KB Output is correct
11 Correct 76 ms 4852 KB Output is correct
12 Correct 83 ms 4852 KB Output is correct
13 Correct 93 ms 4852 KB Output is correct
14 Correct 83 ms 4852 KB Output is correct
15 Correct 103 ms 4852 KB Output is correct
16 Correct 43 ms 4852 KB Output is correct
17 Correct 43 ms 4852 KB Output is correct
18 Correct 39 ms 4852 KB Output is correct
19 Correct 43 ms 4852 KB Output is correct
20 Correct 39 ms 4852 KB Output is correct
21 Correct 63 ms 4852 KB Output is correct
22 Correct 43 ms 4852 KB Output is correct
23 Correct 43 ms 4852 KB Output is correct
24 Correct 43 ms 4852 KB Output is correct
25 Correct 0 ms 4720 KB Output is correct
26 Correct 0 ms 4720 KB Output is correct
27 Correct 0 ms 4720 KB Output is correct
28 Correct 9 ms 4720 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 4720 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -