oj.uz

답안 #802911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802911 2023-08-02T15:47:08 Z tch1cherin Pipes (BOI13_pipes) C++17
75.3704 / 100
 194 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  if (M > N) {
    cout << 0 << "\n";
    exit(0);
  }
  vector<int64_t> c(N);
  for (auto &v : c) {
    cin >> v;
  }
  vector<vector<pair<int, int>>> G(N);
  vector<int> d(N);
  for (int i = 0; i < M; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    d[u]++, d[v]++;
    G[u].push_back({v, i});
    G[v].push_back({u, i});
  }
  vector<int> x(M);
  queue<int> q;
  for (int i = 0; i < N; i++) {
    if (d[i] == 1) {
      q.push(i);
    }
  }
  vector<bool> used(N);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    used[u] = true;
    for (auto [v, i] : G[u]) {
      if (!used[v]) {
        x[i] = c[u];
        c[v] -= c[u];
        d[v]--;
        if (d[v] == 1) {
          q.push(v);
        }
      }
    }
  }
  if (count(used.begin(), used.end(), false) % 2 == 0 && N == M) {
    cout << "0\n";
    exit(0);
  }
  if (N == M) {
    vector<int> cycle, cycle_edges;
    for (int i = 0; i < N; i++) {
      if (!used[i]) {
        int j = i, last = -1;
        while (j != i || last == -1) {
          cycle.push_back(j);
          for (auto [v, i] : G[j]) {
            if (v != last) {
              cycle_edges.push_back(i);
              last = j;
              j = v;
              break;
            }
          }
        }
        break;
      }
    }
    while (cycle.empty());
    int k = (int)cycle.size();
    int64_t sum = 0;
    for (int i = 0; i < k; i++) {
      sum += c[cycle[i]] * (i % 2 ? -1 : 1);
    }
    sum /= 2;
    x[cycle_edges.back()] = sum;
    int64_t last = sum;
    for (int i = 0; i < k - 1; i++) {
      x[cycle_edges[i]] = c[cycle[i]] - last;
      last = x[cycle_edges[i]];
    }
  }
  for (int i = 0; i < M; i++) {
    cout << x[i] * 2 << "\n"; 
  }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 36 ms 8536 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 36 ms 6860 KB Output is correct
14 Correct 36 ms 8088 KB Output is correct
15 Correct 39 ms 8620 KB Output is correct
16 Correct 33 ms 7260 KB Output is correct
17 Correct 38 ms 8580 KB Output is correct
18 Correct 37 ms 8584 KB Output is correct
19 Correct 35 ms 7844 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 46 ms 8532 KB Output is correct
23 Correct 29 ms 6868 KB Output is correct
24 Correct 37 ms 8636 KB Output is correct
25 Correct 30 ms 7168 KB Output is correct

Subtask #2
45.3703703704 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 120 ms 131072 KB Execution killed with signal 9
2 Runtime error 123 ms 131072 KB Execution killed with signal 9
3 Correct 26 ms 7432 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Runtime error 142 ms 131072 KB Execution killed with signal 9
8 Runtime error 125 ms 131072 KB Execution killed with signal 9
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 216 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Runtime error 125 ms 131072 KB Execution killed with signal 9
15 Runtime error 130 ms 131072 KB Execution killed with signal 9
16 Runtime error 121 ms 131072 KB Execution killed with signal 9
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Runtime error 124 ms 131072 KB Execution killed with signal 9
23 Runtime error 144 ms 131072 KB Execution killed with signal 9
24 Runtime error 153 ms 131072 KB Execution killed with signal 9
25 Correct 27 ms 7372 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Runtime error 147 ms 131072 KB Execution killed with signal 9
31 Runtime error 152 ms 131072 KB Execution killed with signal 9
32 Runtime error 164 ms 131072 KB Execution killed with signal 9
33 Correct 29 ms 7684 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Runtime error 152 ms 131072 KB Execution killed with signal 9
39 Runtime error 157 ms 131072 KB Execution killed with signal 9
40 Runtime error 143 ms 131072 KB Execution killed with signal 9
41 Correct 26 ms 7492 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Runtime error 194 ms 131072 KB Execution killed with signal 9
47 Correct 55 ms 8352 KB Output is correct
48 Runtime error 186 ms 131072 KB Execution killed with signal 9
49 Correct 39 ms 7600 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Runtime error 182 ms 131072 KB Execution killed with signal 9