oj.uz

답안 #995739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995739 2024-06-09T20:40:09 Z MilosMilutinovic Pipes (BOI13_pipes) C++14
74.0741 / 100
 105 ms 19448 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<vector<array<int, 2>>> g(n);
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    g[x].push_back({y, i});
    g[y].push_back({x, i});
  }
  if (m > n) {
    cout << 0 << '\n';
    return 0;
  }
  if (n == 1) {
    cout << 2 * a[0] << '\n';
    return 0;
  }
  if (m < n) {
    vector<long long> res(m);
    function<void(int, int)> Dfs = [&](int v, int pv) {
      for (auto& e : g[v]) {
        int u = e[0];
        if (u == pv) {
          continue;
        }
        Dfs(u, v);
        if (a[u] != 0) {
          res[e[1]] = 2 * a[u];
          a[v] -= a[u];
        }
      }
    };
    Dfs(0, 0);
    if (a[0] != 0) {
      cout << 0 << '\n';
      return 0;
    }
    for (int i = 0; i < m; i++) {
      cout << res[i] << '\n';
    }
    return 0;
  }
  vector<int> deg(n);
  for (int i = 0; i < n; i++) {
    deg[i] = (int) g[i].size();
  }
  vector<int> que;
  for (int i = 0; i < n; i++) {
    if (deg[i] == 1) {
      que.push_back(i);
    }
  }
  auto orig = a;
  vector<long long> res(m);
  for (int b = 0; b < (int) que.size(); b++) {
    int i = que[b];
    for (auto& e : g[i]) {
      int j = e[0];
      deg[j] -= 1;
      if (deg[j] == 1) {
        que.push_back(j);
        res[e[1]] = 2 * a[i];
        a[j] -= a[i];
      }
    }
  }
  vector<int> cyc;
  for (int i = 0; i < n; i++) {
    if (deg[i] > 1) {
      cyc.push_back(i);
    }
  }
  if ((int) cyc.size() % 2 == 0) {
    cout << 0 << '\n';
    return 0;
  }
  vector<bool> was(n);
  vector<long long> vals;
  vector<int> ids;
  function<void(int)> Dfs = [&](int v) {
    was[v] = true;
    vals.push_back(a[v]);
    int back = -1;
    bool found = false;
    for (auto& e : g[v]) {
      int u = e[0];
      int i = e[1];
      if (u == cyc[0]) {
        back = i;
      }
      if (was[u] || deg[u] <= 1) {
        continue;
      }
      found = true;
      ids.push_back(i);
      Dfs(u);
    }
    if (!found) {
      ids.push_back(back);
    }
  }; 
  Dfs(cyc[0]);
  long long total = 0;
  for (int i = 0; i < (int) vals.size(); i++) {
    total = vals[i] - total;
  }
  if (ids.empty()) {
    while (true) {

    }
  }
  res[ids.back()] = 2 * total;
  for (int i = 0; i < n; i++) {
    for (auto& p : g[i]) {
      if (p[1] == ids.back()) {
        a[i] -= total;
      }
    }
  }
  was = vector<bool>(n, false);
  Dfs = [&](int v) {
    was[v] = true;
    for (auto& p : g[v]) {
      int u = p[0];
      int i = p[1];
      if (deg[u] <= 1 || was[u]) {
        continue;
      }
      Dfs(u);
      res[i] = 2 * a[u];
      a[v] -= a[u];
    }
  };
  Dfs(cyc.back());
  if (a != vector<long long>(n, 0LL)) {
    cout << 0 << '\n';
    return 0;
  }
  for (int i = 0; i < m; i++) {
    cout << res[i] << '\n';
  }
  return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 32 ms 8284 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 33 ms 6732 KB Output is correct
14 Correct 32 ms 8028 KB Output is correct
15 Correct 34 ms 8416 KB Output is correct
16 Correct 29 ms 7252 KB Output is correct
17 Correct 33 ms 8340 KB Output is correct
18 Correct 35 ms 8476 KB Output is correct
19 Correct 37 ms 12368 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 33 ms 8420 KB Output is correct
23 Correct 25 ms 6748 KB Output is correct
24 Correct 39 ms 8384 KB Output is correct
25 Correct 31 ms 6992 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Correct 26 ms 9036 KB Output is correct
4 Correct 30 ms 6748 KB Output is correct
5 Correct 26 ms 6992 KB Output is correct
6 Correct 101 ms 17236 KB Output is correct
7 Incorrect 1 ms 344 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 1 ms 604 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Incorrect 1 ms 348 KB Output isn't correct
23 Incorrect 32 ms 13936 KB Output isn't correct
24 Incorrect 38 ms 15952 KB Output isn't correct
25 Correct 26 ms 9048 KB Output is correct
26 Correct 29 ms 6736 KB Output is correct
27 Correct 24 ms 6744 KB Output is correct
28 Correct 26 ms 7172 KB Output is correct
29 Correct 105 ms 14680 KB Output is correct
30 Incorrect 39 ms 14664 KB Output isn't correct
31 Incorrect 41 ms 19448 KB Output isn't correct
32 Incorrect 33 ms 12244 KB Output isn't correct
33 Correct 29 ms 9496 KB Output is correct
34 Correct 23 ms 6740 KB Output is correct
35 Correct 26 ms 6804 KB Output is correct
36 Correct 26 ms 7004 KB Output is correct
37 Correct 94 ms 17272 KB Output is correct
38 Incorrect 36 ms 14928 KB Output isn't correct
39 Incorrect 37 ms 11596 KB Output isn't correct
40 Incorrect 46 ms 15436 KB Output isn't correct
41 Correct 25 ms 9424 KB Output is correct
42 Correct 23 ms 6592 KB Output is correct
43 Correct 23 ms 6512 KB Output is correct
44 Correct 24 ms 7004 KB Output is correct
45 Correct 72 ms 14420 KB Output is correct
46 Incorrect 36 ms 14408 KB Output isn't correct
47 Incorrect 36 ms 15436 KB Output isn't correct
48 Incorrect 39 ms 19148 KB Output isn't correct
49 Correct 31 ms 9232 KB Output is correct
50 Correct 23 ms 6748 KB Output is correct
51 Correct 24 ms 7000 KB Output is correct
52 Correct 24 ms 6748 KB Output is correct
53 Correct 78 ms 14420 KB Output is correct
54 Incorrect 38 ms 13900 KB Output isn't correct