Submission #1012246


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n, m;

struct uni {
  vector<int> p;
  uni(int n) :
      p(n, -1) {}
  int root(int a) {
    return p[a] < 0 ? a : (p[a] = root(p[a]));
  }
  bool find(int a, int b) {
    return root(a) == root(b);
  }
  bool merge(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) return false;
    p[a] = b;
    return true;
  }
};

struct edge {
  int f, t, c;
  edge() {}
  edge(int f, int t, int c) :
      f(f), t(t), c(c) {}
  bool operator<(const edge& e) const {
    return c < e.c;
  }
};

edge e[444444];
vector<edge> g[4444];
int res[4444][4444];

void solve(int f, int v, int p, int c) {
  res[f][v] = c;
  for (int i = 0; i < int(g[v].size()); i++) {
    if (g[v][i].t == p) continue;
    solve(f, g[v][i].t, v, max(c, g[v][i].c));
  }
}

int main(void) {
  scanf("%d%d", &n, &m);
  uni u(n);
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d", &e[i].f, &e[i].t, &e[i].c);
    --e[i].f;
    --e[i].t;
  }
  sort(e, e+m);
  long long c = 0;
  for (int i = 0; i < m; i++) {
    if (u.merge(e[i].f, e[i].t)) {
      c += e[i].c;
      g[e[i].f].push_back(edge(e[i].f, e[i].t, e[i].c));
      g[e[i].t].push_back(edge(e[i].t, e[i].f, e[i].c));
    }
  }
  for (int i = 0; i < n; i++) {
    solve(i, i, -1, 0);
  }
  int q; scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int s, t; scanf("%d%d", &s, &t); --s; --t;
    printf("%lld\n", c-res[s][t]);
  }
  return 0;
}

Submission Info

Submission Time
Task A - Graph
User roxion1377
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1543 Byte
Status AC
Exec Time 600 ms
Memory 75904 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &m);
                        ^
./Main.cpp:54:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &e[i].f, &e[i].t, &e[i].c);
                                               ^
./Main.cpp:70:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int q; scanf("%d", &q);
                         ^
./Main.cpp:72:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int s, t; scanf("%d%d", &s, &t); --s; --t;
                                    ^

Judge Result

Set Name Sample subtask1 subtask2 All
Score / Max Score 0 / 0 200 / 200 300 / 300 200 / 200
Status
AC × 2
AC × 12
AC × 21
AC × 29
Set Name Test Cases
Sample sample_1.txt, sample_2.txt
subtask1 sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt
All sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt
Case Name Status Exec Time Memory
sample_1.txt AC 3 ms 384 KB
sample_2.txt AC 3 ms 384 KB
subtask_1_1.txt AC 3 ms 768 KB
subtask_1_10.txt AC 496 ms 72320 KB
subtask_1_11.txt AC 3 ms 384 KB
subtask_1_2.txt AC 446 ms 70400 KB
subtask_1_3.txt AC 558 ms 74624 KB
subtask_1_4.txt AC 411 ms 70016 KB
subtask_1_5.txt AC 447 ms 70016 KB
subtask_1_6.txt AC 468 ms 71168 KB
subtask_1_7.txt AC 559 ms 74624 KB
subtask_1_8.txt AC 396 ms 70016 KB
subtask_1_9.txt AC 450 ms 70016 KB
subtask_2_1.txt AC 566 ms 74624 KB
subtask_2_2.txt AC 557 ms 74624 KB
subtask_2_3.txt AC 567 ms 74624 KB
subtask_2_4.txt AC 567 ms 74624 KB
subtask_2_5.txt AC 402 ms 70016 KB
subtask_2_6.txt AC 453 ms 70272 KB
subtask_2_7.txt AC 465 ms 71168 KB
subtask_2_8.txt AC 559 ms 74624 KB
subtask_3_1.txt AC 595 ms 75776 KB
subtask_3_2.txt AC 596 ms 75776 KB
subtask_3_3.txt AC 444 ms 71424 KB
subtask_3_4.txt AC 479 ms 71296 KB
subtask_3_5.txt AC 537 ms 73472 KB
subtask_3_6.txt AC 563 ms 74624 KB
subtask_3_7.txt AC 597 ms 75776 KB
subtask_3_8.txt AC 600 ms 75904 KB