test/verify/aoj-0304.test.cpp

View this file on GitHub
Last update: 2026-08-10 15:36:17+00:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0304

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0304
// clang-format on

#include <algorithm>
#include <cctype>
#include <iostream>
#include <limits>
#include <string>
#include <vector>

#include "../../graph/shortest-path/bellman-ford.hpp"

using namespace std;

int main() {
  int N, C;
  int A[200], O[200], B[200], S[200], D[200];

  cin >> N >> C;
  vector<int> undefined;
  for (int i = 0; i < C; i++) {
    string str;
    cin >> str;
    int tail = 0, a = 0, b = 0, o, s, d = 0;
    while (isdigit(str[tail])) a = a * 10 + str[tail++] - '0';
    if (str[tail] == '*')
      o = 2;
    else if (str[tail] == '<')
      o = 0, ++tail;
    else
      o = 1, ++tail;
    ++tail;
    while (isdigit(str[tail])) b = b * 10 + str[tail++] - '0';
    if (str[tail] == '+')
      s = 0;
    else
      s = 1;
    ++tail;
    while (tail < str.size()) d = d * 10 + str[tail++] - '0';
    A[i] = --a, B[i] = --b, O[i] = o, S[i] = s, D[i] = d;
    if (o == 2) undefined.push_back(i);
  }
  int ret = -1;
  for (int i = 0; i < (1 << undefined.size()); i++) {
    for (int j = 0; j < undefined.size(); j++) O[undefined[j]] = (i >> j) & 1;

    Edges<> es;
    for (int k = 0; k < C; k++) {
      if (O[k] == 1) swap(A[k], B[k]);
      es.emplace_back(B[k], A[k], 0);
      if (S[k] == 0)
        es.emplace_back(B[k], A[k], -D[k]);
      else
        es.emplace_back(A[k], B[k], D[k]);
      if (O[k] == 1) swap(A[k], B[k]);
    }
    auto dists = bellman_ford(es, N, 0);
    if (dists.empty() || *min_element(begin(dists), end(dists)) < 0) continue;
    ret = max(ret, *max_element(begin(dists), end(dists)));
  }

  if (ret >= numeric_limits<int>::max())
    cout << "inf" << endl;
  else
    cout << ret << endl;
}

#line 1 "test/verify/aoj-0304.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0304
// clang-format on

#include <algorithm>
#include <cctype>
#include <iostream>
#include <limits>
#include <string>
#include <vector>

#line 2 "graph/shortest-path/bellman-ford.hpp"

#line 6 "graph/shortest-path/bellman-ford.hpp"

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 8 "graph/shortest-path/bellman-ford.hpp"

template <typename T>
std::vector<T> bellman_ford(const Edges<T>& edges, int n, int s) {
  const auto INF = std::numeric_limits<T>::max();
  const auto M_INF = std::numeric_limits<T>::min();
  std::vector<T> dist(n, INF);
  dist[s] = 0;
  for (int i = 0; i < n - 1; i++) {
    for (auto& e : edges) {
      if (dist[e.from] == INF) continue;
      dist[e.to] = std::min(dist[e.to], dist[e.from] + e.cost);
    }
  }
  std::vector<bool> negative(n);
  for (int i = 0; i < n; i++) {
    for (auto& e : edges) {
      if (dist[e.from] == INF) continue;
      if (dist[e.from] + e.cost < dist[e.to]) {
        dist[e.to] = dist[e.from] + e.cost;
        negative[e.to] = true;
      }
      if (negative[e.from]) {
        negative[e.to] = true;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (negative[i]) dist[i] = M_INF;
  }
  return dist;
}
#line 13 "test/verify/aoj-0304.test.cpp"

using namespace std;

int main() {
  int N, C;
  int A[200], O[200], B[200], S[200], D[200];

  cin >> N >> C;
  vector<int> undefined;
  for (int i = 0; i < C; i++) {
    string str;
    cin >> str;
    int tail = 0, a = 0, b = 0, o, s, d = 0;
    while (isdigit(str[tail])) a = a * 10 + str[tail++] - '0';
    if (str[tail] == '*')
      o = 2;
    else if (str[tail] == '<')
      o = 0, ++tail;
    else
      o = 1, ++tail;
    ++tail;
    while (isdigit(str[tail])) b = b * 10 + str[tail++] - '0';
    if (str[tail] == '+')
      s = 0;
    else
      s = 1;
    ++tail;
    while (tail < str.size()) d = d * 10 + str[tail++] - '0';
    A[i] = --a, B[i] = --b, O[i] = o, S[i] = s, D[i] = d;
    if (o == 2) undefined.push_back(i);
  }
  int ret = -1;
  for (int i = 0; i < (1 << undefined.size()); i++) {
    for (int j = 0; j < undefined.size(); j++) O[undefined[j]] = (i >> j) & 1;

    Edges<> es;
    for (int k = 0; k < C; k++) {
      if (O[k] == 1) swap(A[k], B[k]);
      es.emplace_back(B[k], A[k], 0);
      if (S[k] == 0)
        es.emplace_back(B[k], A[k], -D[k]);
      else
        es.emplace_back(A[k], B[k], D[k]);
      if (O[k] == 1) swap(A[k], B[k]);
    }
    auto dists = bellman_ford(es, N, 0);
    if (dists.empty() || *min_element(begin(dists), end(dists)) < 0) continue;
    ret = max(ret, *max_element(begin(dists), end(dists)));
  }

  if (ret >= numeric_limits<int>::max())
    cout << "inf" << endl;
  else
    cout << ret << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	3 ms	3 MB
g++	00_sample_01	AC	2 ms	4 MB
g++	00_sample_02	AC	2 ms	3 MB
g++	02_case_00	AC	2 ms	3 MB
g++	02_case_01	AC	2 ms	4 MB
g++	02_case_02	AC	2 ms	4 MB
g++	02_case_03	AC	2 ms	4 MB
g++	02_case_04	AC	2 ms	4 MB
g++	02_case_05	AC	2 ms	3 MB
g++	02_case_06	AC	2 ms	4 MB
g++	02_case_07	AC	2 ms	4 MB
g++	02_case_08	AC	2 ms	4 MB
g++	02_case_09	AC	2 ms	3 MB
g++	02_case_10	AC	2 ms	4 MB
g++	02_case_11	AC	2 ms	4 MB
g++	02_case_12	AC	2 ms	4 MB
g++	03_critical_00	AC	2 ms	4 MB
g++	03_critical_01	AC	2 ms	4 MB
g++	04_large_00	AC	2 ms	3 MB
g++	04_large_01	AC	8 ms	4 MB
g++	04_large_02	AC	12 ms	4 MB
g++	04_large_03	AC	15 ms	4 MB
clang++	00_sample_00	AC	3 ms	4 MB
clang++	00_sample_01	AC	2 ms	4 MB
clang++	00_sample_02	AC	2 ms	4 MB
clang++	02_case_00	AC	2 ms	4 MB
clang++	02_case_01	AC	2 ms	4 MB
clang++	02_case_02	AC	2 ms	4 MB
clang++	02_case_03	AC	2 ms	4 MB
clang++	02_case_04	AC	2 ms	4 MB
clang++	02_case_05	AC	2 ms	4 MB
clang++	02_case_06	AC	2 ms	4 MB
clang++	02_case_07	AC	2 ms	4 MB
clang++	02_case_08	AC	2 ms	4 MB
clang++	02_case_09	AC	2 ms	4 MB
clang++	02_case_10	AC	2 ms	4 MB
clang++	02_case_11	AC	2 ms	4 MB
clang++	02_case_12	AC	2 ms	4 MB
clang++	03_critical_00	AC	2 ms	4 MB
clang++	03_critical_01	AC	2 ms	4 MB
clang++	04_large_00	AC	2 ms	4 MB
clang++	04_large_01	AC	8 ms	4 MB
clang++	04_large_02	AC	11 ms	4 MB
clang++	04_large_03	AC	15 ms	4 MB