oj.uz

답안 #802916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802916 2023-08-02T15:49:17 Z tch1cherin Pipes (BOI13_pipes) C++17
74.0741 / 100
 1000 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 (1);
    while (cycle.empty());
    while (cycle.size() != cycle_edges.size());
    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 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 37 ms 8568 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 37 ms 6872 KB Output is correct
14 Correct 34 ms 8108 KB Output is correct
15 Correct 37 ms 8576 KB Output is correct
16 Correct 30 ms 7276 KB Output is correct
17 Correct 38 ms 8528 KB Output is correct
18 Correct 37 ms 8640 KB Output is correct
19 Correct 36 ms 7848 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 37 ms 8528 KB Output is correct
23 Correct 29 ms 6832 KB Output is correct
24 Correct 37 ms 8660 KB Output is correct
25 Correct 30 ms 7196 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 120 ms 131072 KB Execution killed with signal 9
2 Runtime error 120 ms 131072 KB Execution killed with signal 9
3 Correct 26 ms 7444 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 133 ms 131072 KB Execution killed with signal 9
8 Runtime error 124 ms 131072 KB Execution killed with signal 9
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Runtime error 121 ms 131072 KB Execution killed with signal 9
15 Runtime error 121 ms 131072 KB Execution killed with signal 9
16 Runtime error 143 ms 131072 KB Execution killed with signal 9
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 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 123 ms 131072 KB Execution killed with signal 9
23 Runtime error 148 ms 131072 KB Execution killed with signal 9
24 Runtime error 143 ms 131072 KB Execution killed with signal 9
25 Correct 26 ms 7368 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 142 ms 131072 KB Execution killed with signal 9
31 Runtime error 155 ms 131072 KB Execution killed with signal 9
32 Runtime error 148 ms 131072 KB Execution killed with signal 9
33 Correct 28 ms 7636 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 143 ms 131072 KB Execution killed with signal 9
39 Runtime error 155 ms 131072 KB Execution killed with signal 9
40 Runtime error 144 ms 131072 KB Execution killed with signal 9
41 Correct 27 ms 7396 KB Output is correct
42 Correct 0 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 144 ms 131072 KB Execution killed with signal 9
47 Execution timed out 1075 ms 8268 KB Time limit exceeded
48 Runtime error 145 ms 131072 KB Execution killed with signal 9
49 Correct 29 ms 7640 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 150 ms 131072 KB Execution killed with signal 9