oj.uz

답안 #802907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802907 2023-08-02T15:45:11 Z tch1cherin Pipes (BOI13_pipes) C++17
74.0741 / 100
 56 ms 17704 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) {
          cycle.push_back(j);
          for (auto [v, i] : G[j]) {
            if (v != last) {
              cycle_edges.push_back(i);
              last = j;
              j = v;
              break;
            }
          }
        }
        break;
      }
    }
    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 1 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 39 ms 10116 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 37 ms 8088 KB Output is correct
14 Correct 38 ms 9620 KB Output is correct
15 Correct 39 ms 10184 KB Output is correct
16 Correct 35 ms 8708 KB Output is correct
17 Correct 38 ms 10092 KB Output is correct
18 Correct 48 ms 10164 KB Output is correct
19 Correct 40 ms 9420 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 43 ms 10140 KB Output is correct
23 Correct 45 ms 8080 KB Output is correct
24 Correct 38 ms 10180 KB Output is correct
25 Correct 31 ms 8524 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Runtime error 1 ms 596 KB Execution killed with signal 11
3 Correct 27 ms 8856 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Runtime error 2 ms 468 KB Execution killed with signal 11
8 Runtime error 1 ms 468 KB Execution killed with signal 11
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 ms 468 KB Execution killed with signal 11
15 Runtime error 2 ms 588 KB Execution killed with signal 11
16 Runtime error 1 ms 596 KB Execution killed with signal 11
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Runtime error 1 ms 596 KB Execution killed with signal 11
23 Runtime error 38 ms 13932 KB Execution killed with signal 11
24 Runtime error 56 ms 17012 KB Execution killed with signal 11
25 Correct 36 ms 8960 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Runtime error 36 ms 16072 KB Execution killed with signal 11
31 Runtime error 33 ms 16460 KB Execution killed with signal 11
32 Runtime error 40 ms 17656 KB Execution killed with signal 11
33 Correct 41 ms 9200 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Runtime error 43 ms 16672 KB Execution killed with signal 11
39 Runtime error 52 ms 17704 KB Execution killed with signal 11
40 Runtime error 38 ms 17156 KB Execution killed with signal 11
41 Correct 27 ms 8984 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Runtime error 36 ms 16328 KB Execution killed with signal 11
47 Runtime error 36 ms 17192 KB Execution killed with signal 11
48 Runtime error 33 ms 16588 KB Execution killed with signal 11
49 Correct 28 ms 9164 KB Output is correct
50 Correct 0 ms 328 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Runtime error 36 ms 16632 KB Execution killed with signal 11