oj.uz

답안 #486403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486403 2021-11-11T15:00:45 Z BERNARB01 Graph (BOI20_graph) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m;
float a[16], vals[] = {-2, -1.5, -1, -.5, 0, .5, 1, 1.5, 2};
tuple<int, int, float> ed[16];

void sol(int i) {
  if (i == n) {
    bool bl = true;
    for (int j = 0; j < m; j++) {
      auto [u, v, w] = ed[j];
      if (a[u] + a[v] != w) {
        bl = false;
        break;
      }
    }
    if (bl) {
      cout << "YES" << '\n';
      for (int k = 0; k < n; k++) {
        if (k > 0) {
          cout << " ";
        }
        cout << a[k];
      }
      cout << '\n';
      exit(0);
    }
    return;
  }
  for (float x : vals) {
    a[i] = x;
    sol(i + 1);
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    float w;
    cin >> u >> v >> w;
    --u; --v;
    ed[i] = {u, v, w};
  }
  sol(0);
  cout << "NO" << '\n';
  return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB answer = YES
2 Incorrect 1 ms 204 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB answer = YES
2 Incorrect 1 ms 204 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB answer = YES
2 Incorrect 1 ms 204 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB answer = YES
2 Incorrect 1 ms 204 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB answer = YES
2 Incorrect 1 ms 204 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -