oj.uz

답안 #709055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709055 2023-03-13T05:26:04 Z null_awe Graph (BOI20_graph) C++14
0 / 100
 1 ms 300 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

#define ll long long
#define pii pair<int, int>

const double EPS = 0.000001;

struct line {

  int m, b;

  line() {}

  line(int m, int b) : m(m), b(b) {}

  double combine(line other) {
    int mm = m - other.m, bb = other.b - b;
    if (mm == 0 && bb) {
      cout << "NO\n";
      exit(0);
    }
    if (mm == 0) return INT_MAX;
    return (double) bb / mm;
  }
};

int n, m;
vector<vector<pii>> adj;
vector<line> lines;
vector<bool> vis;
vector<double> all;

void solve(int fv) {
  if (vis[fv]) return;
  lines[fv] = line(1, 0);
  queue<int> q;
  vector<int> has;
  vis[fv] = true, q.push(fv), has.push_back(fv);
  double ans = 0;
  while (q.size()) {
    int v = q.front(); q.pop();
    for (pii p : adj[v]) {
      int u = p.first, c = p.second;
      line change(-lines[v].m, c - lines[v].b);
      if (!vis[u]) {
        vis[u] = true, q.push(u), has.push_back(u);
        lines[u] = change;
      } else {
        ans = lines[u].combine(change);
        if (ans < INT_MAX - 1) break;
      }
    }
  }
  if (ans > INT_MAX - 1) {
    ll mn = LLONG_MAX;
    int val = 0;
    for (int v : has) {
      line l = lines[v];
      int t = -l.b / l.m;
      ll sum = 0;
      for (int u : has) {
        line _l = lines[u];
        sum += abs(_l.m * t + _l.b);
      }
      if (sum < mn) mn = sum, ans = t;
    }
  }
  for (int v : has) vis[v] = false;
  all[fv] = ans;
  q = queue<int>();
  vis[fv] = true, q.push(fv);
  while (q.size()) {
    int v = q.front(); q.pop();
    for (pii p : adj[v]) {
      int u = p.first, c = p.second;
      if (vis[u]) continue;
      vis[u] = true, q.push(u);
      all[u] = c - all[v];
    }
  }
}

int main() {
  cin >> n >> m;
  adj.resize(n);
  for (int i = 0; i < m; ++i) {
    int a, b, c; cin >> a >> b >> c; --a, --b;
    adj[a].push_back({b, c}), adj[b].push_back({a, c});
  }
  lines = vector<line>(n);
  vis = vector<bool>(n);
  all.resize(n);
  for (int i = 0; i < n; ++i) solve(i);
  cout << "YES\n";
  for (double val : all) cout << val << ' ';
  cout << '\n';
  return 0;
}

Compilation message

Graph.cpp: In function 'void solve(int)':
Graph.cpp:60:9: warning: unused variable 'val' [-Wunused-variable]
   60 |     int val = 0;
      |         ^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB answer = YES
2 Correct 1 ms 212 KB answer = YES
3 Correct 1 ms 212 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 300 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 232 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Incorrect 1 ms 212 KB Sum of endpoints for edge (4; 2) differs from the expected value 1.
12 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB answer = YES
2 Correct 1 ms 212 KB answer = YES
3 Correct 1 ms 212 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 300 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 232 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Incorrect 1 ms 212 KB Sum of endpoints for edge (4; 2) differs from the expected value 1.
12 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB answer = YES
2 Correct 1 ms 212 KB answer = YES
3 Correct 1 ms 212 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 300 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 232 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Incorrect 1 ms 212 KB Sum of endpoints for edge (4; 2) differs from the expected value 1.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB answer = YES
2 Correct 1 ms 212 KB answer = YES
3 Correct 1 ms 212 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 300 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 232 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Incorrect 1 ms 212 KB Sum of endpoints for edge (4; 2) differs from the expected value 1.
12 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB answer = YES
2 Correct 1 ms 212 KB answer = YES
3 Correct 1 ms 212 KB answer = YES
4 Correct 1 ms 212 KB answer = NO
5 Correct 1 ms 300 KB answer = YES
6 Correct 1 ms 212 KB answer = YES
7 Correct 1 ms 232 KB answer = YES
8 Correct 1 ms 212 KB answer = YES
9 Correct 1 ms 212 KB answer = NO
10 Correct 1 ms 212 KB answer = YES
11 Incorrect 1 ms 212 KB Sum of endpoints for edge (4; 2) differs from the expected value 1.
12 Halted 0 ms 0 KB -