test/verify/yukicoder-1254.test.cpp

• View this file on GitHub
• Last update: 2024-07-28 19:56:12+09:00
• Problem: https://yukicoder.me/problems/no/1254

Depends on

• Graph Template(グラフテンプレート) (graph/graph-template.hpp)
• Namori Graph (graph/others/namori-graph.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1254

#include "../../template/template.hpp"

#include "../../graph/others/namori-graph.hpp"

int main() {
  int N;
  cin >> N;
  NamoriGraph< int > g(N);
  g.read(N);
  g.build();
  vector< int > ans;
  for(auto &e : g.loop_edges) {
    ans.emplace_back(e.idx + 1);
  }
  sort(begin(ans), end(ans));
  cout << ans.size() << "\n";
  cout << ans << "\n";
}

#line 1 "test/verify/yukicoder-1254.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1254

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/yukicoder-1254.test.cpp"

#line 2 "graph/others/namori-graph.hpp"

#line 2 "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 {
  vector<vector<Edge<T> > > g;
  int es;

  Graph() = default;

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

  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;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

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

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

template <typename T = int>
using Edges = vector<Edge<T> >;
#line 4 "graph/others/namori-graph.hpp"

/**
 * @brief Namori Graph
 *
 */
template <typename T = int>
struct NamoriGraph : Graph<T> {
 public:
  using Graph<T>::Graph;
  using Graph<T>::g;

  vector<Graph<T> > forest;
  Edges<T> loop_edges;

  struct Info {
    int tree_id, id;
  };

  Info operator[](const int &k) const { return (Info){mark_id[k], id[k]}; }

  int inv(int tree_id, int k) { return iv[tree_id][k]; }

  void build() {
    int n = (int)g.size();
    vector<int> deg(n), used(n);
    queue<int> que;
    for (int i = 0; i < n; i++) {
      deg[i] = (int)g[i].size();
      if (deg[i] == 1) {
        que.emplace(i);
        used[i] = true;
      }
    }
    while (not que.empty()) {
      int idx = que.front();
      que.pop();
      for (auto &e : g[idx]) {
        if (used[e.to]) {
          continue;
        }
        --deg[e.to];
        if (deg[e.to] == 1) {
          que.emplace(e.to);
          used[e.to] = true;
        }
      }
    }
    int mx = 0;
    for (auto &edges : g) {
      for (auto &e : edges) mx = max(mx, e.idx);
    }
    vector<int> edge_used(mx + 1);
    vector<int> loop;
    for (int v = 0; v < n; v++) {
      if (!used[v]) {
        for (bool update = true; update;) {
          update = false;
          loop.emplace_back(v);
          for (auto &e : g[v]) {
            if (used[e.to] or edge_used[e.idx]) {
              continue;
            }
            edge_used[e.idx] = true;
            loop_edges.emplace_back(v, e.to, e.cost, e.idx);
            v = e.to;
            update = true;
            break;
          }
        }
        break;
      }
    }
    loop.pop_back();
    mark_id.resize(n);
    id.resize(n);
    for (int i = 0; i < (int)loop.size(); i++) {
      int pre = loop[(i + loop.size() - 1) % loop.size()];
      int nxt = loop[(i + 1) % loop.size()];
      int sz = 0;
      mark_id[loop[i]] = i;
      iv.emplace_back();
      id[loop[i]] = sz++;
      iv.back().emplace_back(loop[i]);
      for (auto &e : g[loop[i]]) {
        if (e.to != pre and e.to != nxt) {
          mark_dfs(e.to, loop[i], i, sz);
        }
      }
      Graph<T> tree(sz);
      for (auto &e : g[loop[i]]) {
        if (e.to != pre and e.to != nxt) {
          tree.g[id[loop[i]]].emplace_back(id[loop[i]], id[e.to], e.cost,
                                           e.idx);
          tree.g[id[e.to]].emplace_back(id[e.to], id[loop[i]], e.cost, e.idx);
          build_dfs(e.to, loop[i], tree);
        }
      }
      forest.emplace_back(tree);
    }
  }

 private:
  vector<vector<int> > iv;
  vector<int> mark_id, id;

  void mark_dfs(int idx, int par, int k, int &l) {
    mark_id[idx] = k;
    id[idx] = l++;
    iv.back().emplace_back(idx);
    for (auto &e : g[idx]) {
      if (e.to != par) {
        mark_dfs(e.to, idx, k, l);
      }
    }
  }

  void build_dfs(int idx, int par, Graph<T> &tree) {
    for (auto &e : g[idx]) {
      if (e.to != par) {
        tree.g[id[idx]].emplace_back(id[idx], id[e.to], e.cost, e.idx);
        tree.g[id[e.to]].emplace_back(id[e.to], id[idx], e.cost, e.idx);
        build_dfs(e.to, idx, tree);
      }
    }
  }
};
#line 6 "test/verify/yukicoder-1254.test.cpp"

int main() {
  int N;
  cin >> N;
  NamoriGraph< int > g(N);
  g.read(N);
  g.build();
  vector< int > ans;
  for(auto &e : g.loop_edges) {
    ans.emplace_back(e.idx + 1);
  }
  sort(begin(ans), end(ans));
  cout << ans.size() << "\n";
  cout << ans << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	01_sample_01.txt	AC	6 ms	3 MB
g++	01_sample_02.txt	AC	5 ms	3 MB
g++	01_sample_03.txt	AC	5 ms	3 MB
g++	02_Tiny_1.txt	AC	5 ms	3 MB
g++	02_Tiny_10.txt	AC	5 ms	3 MB
g++	02_Tiny_2.txt	AC	6 ms	3 MB
g++	02_Tiny_3.txt	AC	5 ms	3 MB
g++	02_Tiny_4.txt	AC	5 ms	3 MB
g++	02_Tiny_5.txt	AC	5 ms	3 MB
g++	02_Tiny_6.txt	AC	5 ms	3 MB
g++	02_Tiny_7.txt	AC	5 ms	3 MB
g++	02_Tiny_8.txt	AC	5 ms	3 MB
g++	02_Tiny_9.txt	AC	5 ms	3 MB
g++	03_Small1.txt	AC	5 ms	3 MB
g++	03_Small10.txt	AC	5 ms	3 MB
g++	03_Small11.txt	AC	5 ms	3 MB
g++	03_Small12.txt	AC	5 ms	3 MB
g++	03_Small13.txt	AC	5 ms	3 MB
g++	03_Small14.txt	AC	5 ms	3 MB
g++	03_Small15.txt	AC	5 ms	3 MB
g++	03_Small2.txt	AC	5 ms	3 MB
g++	03_Small3.txt	AC	5 ms	3 MB
g++	03_Small4.txt	AC	5 ms	3 MB
g++	03_Small5.txt	AC	5 ms	3 MB
g++	03_Small6.txt	AC	5 ms	3 MB
g++	03_Small7.txt	AC	5 ms	3 MB
g++	03_Small8.txt	AC	5 ms	3 MB
g++	03_Small9.txt	AC	5 ms	3 MB
g++	03_Small_1.txt	AC	5 ms	4 MB
g++	03_Small_10.txt	AC	5 ms	4 MB
g++	03_Small_11.txt	AC	5 ms	3 MB
g++	03_Small_12.txt	AC	5 ms	3 MB
g++	03_Small_13.txt	AC	5 ms	3 MB
g++	03_Small_14.txt	AC	5 ms	3 MB
g++	03_Small_15.txt	AC	5 ms	3 MB
g++	03_Small_2.txt	AC	5 ms	3 MB
g++	03_Small_3.txt	AC	5 ms	3 MB
g++	03_Small_4.txt	AC	5 ms	4 MB
g++	03_Small_5.txt	AC	5 ms	3 MB
g++	03_Small_6.txt	AC	5 ms	4 MB
g++	03_Small_7.txt	AC	5 ms	3 MB
g++	03_Small_8.txt	AC	5 ms	4 MB
g++	03_Small_9.txt	AC	5 ms	4 MB
g++	04_Medium_1.txt	AC	6 ms	4 MB
g++	04_Medium_10.txt	AC	6 ms	4 MB
g++	04_Medium_11.txt	AC	5 ms	4 MB
g++	04_Medium_12.txt	AC	6 ms	4 MB
g++	04_Medium_13.txt	AC	5 ms	4 MB
g++	04_Medium_14.txt	AC	5 ms	4 MB
g++	04_Medium_15.txt	AC	5 ms	3 MB
g++	04_Medium_16.txt	AC	5 ms	4 MB
g++	04_Medium_17.txt	AC	5 ms	4 MB
g++	04_Medium_18.txt	AC	5 ms	4 MB
g++	04_Medium_19.txt	AC	6 ms	4 MB
g++	04_Medium_2.txt	AC	5 ms	4 MB
g++	04_Medium_20.txt	AC	5 ms	4 MB
g++	04_Medium_3.txt	AC	5 ms	4 MB
g++	04_Medium_4.txt	AC	6 ms	4 MB
g++	04_Medium_5.txt	AC	5 ms	4 MB
g++	04_Medium_6.txt	AC	6 ms	4 MB
g++	04_Medium_7.txt	AC	5 ms	4 MB
g++	04_Medium_8.txt	AC	6 ms	4 MB
g++	04_Medium_9.txt	AC	6 ms	4 MB
g++	05_Large_1.txt	AC	10 ms	6 MB
g++	05_Large_10.txt	AC	9 ms	5 MB
g++	05_Large_11.txt	AC	7 ms	4 MB
g++	05_Large_12.txt	AC	8 ms	5 MB
g++	05_Large_13.txt	AC	8 ms	4 MB
g++	05_Large_14.txt	AC	6 ms	4 MB
g++	05_Large_15.txt	AC	7 ms	4 MB
g++	05_Large_16.txt	AC	9 ms	5 MB
g++	05_Large_17.txt	AC	10 ms	5 MB
g++	05_Large_18.txt	AC	9 ms	5 MB
g++	05_Large_19.txt	AC	10 ms	5 MB
g++	05_Large_2.txt	AC	6 ms	4 MB
g++	05_Large_20.txt	AC	10 ms	5 MB
g++	05_Large_3.txt	AC	8 ms	4 MB
g++	05_Large_4.txt	AC	8 ms	4 MB
g++	05_Large_5.txt	AC	6 ms	4 MB
g++	05_Large_6.txt	AC	8 ms	5 MB
g++	05_Large_7.txt	AC	9 ms	5 MB
g++	05_Large_8.txt	AC	7 ms	4 MB
g++	05_Large_9.txt	AC	6 ms	4 MB
g++	06_Huge_1.txt	AC	53 ms	24 MB
g++	06_Huge_10.txt	AC	19 ms	9 MB
g++	06_Huge_11.txt	AC	45 ms	18 MB
g++	06_Huge_12.txt	AC	41 ms	19 MB
g++	06_Huge_13.txt	AC	41 ms	18 MB
g++	06_Huge_14.txt	AC	51 ms	23 MB
g++	06_Huge_15.txt	AC	27 ms	10 MB
g++	06_Huge_16.txt	AC	49 ms	19 MB
g++	06_Huge_17.txt	AC	35 ms	16 MB
g++	06_Huge_18.txt	AC	55 ms	25 MB
g++	06_Huge_19.txt	AC	18 ms	8 MB
g++	06_Huge_2.txt	AC	50 ms	19 MB
g++	06_Huge_20.txt	AC	12 ms	6 MB
g++	06_Huge_21.txt	AC	18 ms	8 MB
g++	06_Huge_22.txt	AC	23 ms	11 MB
g++	06_Huge_23.txt	AC	44 ms	18 MB
g++	06_Huge_24.txt	AC	29 ms	13 MB
g++	06_Huge_25.txt	AC	52 ms	25 MB
g++	06_Huge_26.txt	AC	52 ms	21 MB
g++	06_Huge_27.txt	AC	44 ms	17 MB
g++	06_Huge_28.txt	AC	41 ms	17 MB
g++	06_Huge_29.txt	AC	42 ms	17 MB
g++	06_Huge_3.txt	AC	35 ms	15 MB
g++	06_Huge_30.txt	AC	23 ms	10 MB
g++	06_Huge_31.txt	AC	39 ms	18 MB
g++	06_Huge_32.txt	AC	28 ms	13 MB
g++	06_Huge_33.txt	AC	13 ms	6 MB
g++	06_Huge_34.txt	AC	31 ms	14 MB
g++	06_Huge_35.txt	AC	23 ms	10 MB
g++	06_Huge_36.txt	AC	50 ms	21 MB
g++	06_Huge_37.txt	AC	35 ms	15 MB
g++	06_Huge_38.txt	AC	51 ms	22 MB
g++	06_Huge_39.txt	AC	21 ms	9 MB
g++	06_Huge_4.txt	AC	47 ms	20 MB
g++	06_Huge_40.txt	AC	32 ms	14 MB
g++	06_Huge_5.txt	AC	50 ms	20 MB
g++	06_Huge_6.txt	AC	14 ms	6 MB
g++	06_Huge_7.txt	AC	51 ms	21 MB
g++	06_Huge_8.txt	AC	37 ms	14 MB
g++	06_Huge_9.txt	AC	30 ms	12 MB
g++	07_Cycle_01.txt	AC	6 ms	3 MB
g++	07_Cycle_02.txt	AC	66 ms	28 MB
g++	07_Cycle_03.txt	AC	67 ms	28 MB
clang++	01_sample_01.txt	AC	7 ms	3 MB
clang++	01_sample_02.txt	AC	5 ms	3 MB
clang++	01_sample_03.txt	AC	5 ms	3 MB
clang++	02_Tiny_1.txt	AC	5 ms	3 MB
clang++	02_Tiny_10.txt	AC	5 ms	3 MB
clang++	02_Tiny_2.txt	AC	5 ms	3 MB
clang++	02_Tiny_3.txt	AC	5 ms	3 MB
clang++	02_Tiny_4.txt	AC	5 ms	3 MB
clang++	02_Tiny_5.txt	AC	5 ms	3 MB
clang++	02_Tiny_6.txt	AC	5 ms	3 MB
clang++	02_Tiny_7.txt	AC	5 ms	3 MB
clang++	02_Tiny_8.txt	AC	5 ms	3 MB
clang++	02_Tiny_9.txt	AC	5 ms	3 MB
clang++	03_Small1.txt	AC	5 ms	3 MB
clang++	03_Small10.txt	AC	5 ms	3 MB
clang++	03_Small11.txt	AC	5 ms	3 MB
clang++	03_Small12.txt	AC	5 ms	4 MB
clang++	03_Small13.txt	AC	5 ms	3 MB
clang++	03_Small14.txt	AC	5 ms	3 MB
clang++	03_Small15.txt	AC	5 ms	3 MB
clang++	03_Small2.txt	AC	5 ms	3 MB
clang++	03_Small3.txt	AC	5 ms	3 MB
clang++	03_Small4.txt	AC	5 ms	3 MB
clang++	03_Small5.txt	AC	5 ms	3 MB
clang++	03_Small6.txt	AC	5 ms	3 MB
clang++	03_Small7.txt	AC	5 ms	3 MB
clang++	03_Small8.txt	AC	5 ms	3 MB
clang++	03_Small9.txt	AC	5 ms	3 MB
clang++	03_Small_1.txt	AC	5 ms	3 MB
clang++	03_Small_10.txt	AC	5 ms	3 MB
clang++	03_Small_11.txt	AC	5 ms	4 MB
clang++	03_Small_12.txt	AC	5 ms	3 MB
clang++	03_Small_13.txt	AC	5 ms	3 MB
clang++	03_Small_14.txt	AC	5 ms	3 MB
clang++	03_Small_15.txt	AC	5 ms	3 MB
clang++	03_Small_2.txt	AC	5 ms	3 MB
clang++	03_Small_3.txt	AC	5 ms	3 MB
clang++	03_Small_4.txt	AC	5 ms	3 MB
clang++	03_Small_5.txt	AC	5 ms	3 MB
clang++	03_Small_6.txt	AC	5 ms	4 MB
clang++	03_Small_7.txt	AC	5 ms	4 MB
clang++	03_Small_8.txt	AC	6 ms	3 MB
clang++	03_Small_9.txt	AC	5 ms	3 MB
clang++	04_Medium_1.txt	AC	6 ms	4 MB
clang++	04_Medium_10.txt	AC	6 ms	4 MB
clang++	04_Medium_11.txt	AC	5 ms	4 MB
clang++	04_Medium_12.txt	AC	6 ms	4 MB
clang++	04_Medium_13.txt	AC	6 ms	4 MB
clang++	04_Medium_14.txt	AC	5 ms	4 MB
clang++	04_Medium_15.txt	AC	5 ms	3 MB
clang++	04_Medium_16.txt	AC	5 ms	4 MB
clang++	04_Medium_17.txt	AC	5 ms	4 MB
clang++	04_Medium_18.txt	AC	5 ms	4 MB
clang++	04_Medium_19.txt	AC	5 ms	4 MB
clang++	04_Medium_2.txt	AC	5 ms	4 MB
clang++	04_Medium_20.txt	AC	5 ms	4 MB
clang++	04_Medium_3.txt	AC	5 ms	4 MB
clang++	04_Medium_4.txt	AC	5 ms	4 MB
clang++	04_Medium_5.txt	AC	5 ms	4 MB
clang++	04_Medium_6.txt	AC	5 ms	4 MB
clang++	04_Medium_7.txt	AC	5 ms	3 MB
clang++	04_Medium_8.txt	AC	6 ms	4 MB
clang++	04_Medium_9.txt	AC	6 ms	4 MB
clang++	05_Large_1.txt	AC	10 ms	6 MB
clang++	05_Large_10.txt	AC	9 ms	5 MB
clang++	05_Large_11.txt	AC	7 ms	4 MB
clang++	05_Large_12.txt	AC	8 ms	5 MB
clang++	05_Large_13.txt	AC	8 ms	4 MB
clang++	05_Large_14.txt	AC	6 ms	4 MB
clang++	05_Large_15.txt	AC	7 ms	4 MB
clang++	05_Large_16.txt	AC	9 ms	5 MB
clang++	05_Large_17.txt	AC	10 ms	5 MB
clang++	05_Large_18.txt	AC	9 ms	5 MB
clang++	05_Large_19.txt	AC	9 ms	5 MB
clang++	05_Large_2.txt	AC	6 ms	4 MB
clang++	05_Large_20.txt	AC	9 ms	5 MB
clang++	05_Large_3.txt	AC	8 ms	4 MB
clang++	05_Large_4.txt	AC	9 ms	4 MB
clang++	05_Large_5.txt	AC	6 ms	4 MB
clang++	05_Large_6.txt	AC	8 ms	5 MB
clang++	05_Large_7.txt	AC	9 ms	5 MB
clang++	05_Large_8.txt	AC	7 ms	4 MB
clang++	05_Large_9.txt	AC	6 ms	4 MB
clang++	06_Huge_1.txt	AC	53 ms	24 MB
clang++	06_Huge_10.txt	AC	19 ms	9 MB
clang++	06_Huge_11.txt	AC	44 ms	18 MB
clang++	06_Huge_12.txt	AC	41 ms	19 MB
clang++	06_Huge_13.txt	AC	41 ms	18 MB
clang++	06_Huge_14.txt	AC	50 ms	24 MB
clang++	06_Huge_15.txt	AC	27 ms	10 MB
clang++	06_Huge_16.txt	AC	48 ms	19 MB
clang++	06_Huge_17.txt	AC	34 ms	16 MB
clang++	06_Huge_18.txt	AC	55 ms	25 MB
clang++	06_Huge_19.txt	AC	17 ms	8 MB
clang++	06_Huge_2.txt	AC	49 ms	19 MB
clang++	06_Huge_20.txt	AC	12 ms	6 MB
clang++	06_Huge_21.txt	AC	18 ms	8 MB
clang++	06_Huge_22.txt	AC	23 ms	11 MB
clang++	06_Huge_23.txt	AC	43 ms	18 MB
clang++	06_Huge_24.txt	AC	29 ms	13 MB
clang++	06_Huge_25.txt	AC	55 ms	26 MB
clang++	06_Huge_26.txt	AC	53 ms	21 MB
clang++	06_Huge_27.txt	AC	44 ms	17 MB
clang++	06_Huge_28.txt	AC	41 ms	17 MB
clang++	06_Huge_29.txt	AC	44 ms	17 MB
clang++	06_Huge_3.txt	AC	36 ms	15 MB
clang++	06_Huge_30.txt	AC	23 ms	9 MB
clang++	06_Huge_31.txt	AC	40 ms	18 MB
clang++	06_Huge_32.txt	AC	30 ms	13 MB
clang++	06_Huge_33.txt	AC	14 ms	6 MB
clang++	06_Huge_34.txt	AC	31 ms	14 MB
clang++	06_Huge_35.txt	AC	24 ms	10 MB
clang++	06_Huge_36.txt	AC	50 ms	21 MB
clang++	06_Huge_37.txt	AC	35 ms	15 MB
clang++	06_Huge_38.txt	AC	53 ms	22 MB
clang++	06_Huge_39.txt	AC	21 ms	8 MB
clang++	06_Huge_4.txt	AC	48 ms	20 MB
clang++	06_Huge_40.txt	AC	32 ms	14 MB
clang++	06_Huge_5.txt	AC	50 ms	19 MB
clang++	06_Huge_6.txt	AC	14 ms	6 MB
clang++	06_Huge_7.txt	AC	51 ms	21 MB
clang++	06_Huge_8.txt	AC	37 ms	14 MB
clang++	06_Huge_9.txt	AC	30 ms	12 MB
clang++	07_Cycle_01.txt	AC	6 ms	3 MB
clang++	07_Cycle_02.txt	AC	66 ms	28 MB
clang++	07_Cycle_03.txt	AC	68 ms	28 MB

Back to top page