oj.uz

Submission #564916

# Submission time Handle Problem Language Result Execution time Memory
564916 2022-05-20T01:57:20 Z Kanon Fountain Parks (IOI21_parks) C++17
100 / 100
 2749 ms 149592 KB 
#include <bits/stdc++.h>
#include "parks.h"

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);

class matching {
  public:
  vector< vector<int> > g;
  vector<int> pa;
  vector<int> pb;
  vector<int> was;
  int n, m;
  int res;
  int iter;

  matching(int _n, int _m) : n(_n), m(_m) {
    assert(0 <= n && 0 <= m);
    pa = vector<int>(n, -1);
    pb = vector<int>(m, -1);
    was = vector<int>(n, 0);
    g.resize(n);
    res = 0;
    iter = 0;
  }

  void add(int from, int to) {
    assert(0 <= from && from < n && 0 <= to && to < m);
    g[from].push_back(to);
  }

  bool dfs(int v) {
    was[v] = iter;
    for (int u : g[v]) {
      if (pb[u] == -1) {
        pa[v] = u;
        pb[u] = v;
        return true;
      }
    }
    for (int u : g[v]) {
      if (was[pb[u]] != iter && dfs(pb[u])) {
        pa[v] = u;
        pb[u] = v;
        return true;
      }
    }
    return false;
  }

  int solve() {
    while (true) {
      iter++;
      int add = 0;
      for (int i = 0; i < n; i++) {
        if (pa[i] == -1 && dfs(i)) {
          add++;
        }
      }
      if (add == 0) {
        break;
      }
      res += add;
    }
    return res;
  }

  int run_one(int v) {
    if (pa[v] != -1) {
      return 0;
    }
    iter++;
    return (int) dfs(v);
  }
};

class dsu {
 public:
  vector<int> p;
  int n;

  dsu(){};

  dsu(int _n) : n(_n) {
    p.resize(n);
    iota(p.begin(), p.end(), 0);
  }

  inline int get(int x) {
    return (x == p[x] ? x : (p[x] = get(p[x])));
  }

  inline bool unite(int x, int y) {
    x = get(x);
    y = get(y);
    if (x != y) {
      p[x] = y;
      return true;
    }
    return false;
  }
};

int construct_roads (vector<int> xvec, vector<int> yvec) {
  int N = xvec.size();

  map<pair<int, int>, int> to_v;
  for (int i = 0; i < N; i++) {
    to_v[make_pair(xvec[i], yvec[i])] = i;
  }

  auto get_v = [&](int X, int Y) {
    if (to_v.count(make_pair(X, Y))) {
      return to_v[make_pair(X, Y)];
    }
    return -1;
  };

  int n = 0;
  vector<vector<int>> g;
  map<pair<int, int>, int> to_face;
  vector<pair<int, int>> bench;
  auto get_face = [&](int X, int Y) {
    if (to_face.count(make_pair(X, Y))) {
      return to_face[make_pair(X, Y)];
    }
    bench.push_back({X, Y});
    g.push_back({});
    return to_face[make_pair(X, Y)] = n++;
  };

  int m = 0;
  vector<int> node1, node2, face1, face2;
  dsu fountain(N);
  int is_connected = N;
  auto make_edge = [&] (int x, int y, int X, int Y) {
    int u = get_v(x, y), v = get_v(X, Y);
    if (v == -1) {
      return;
    }
    node1.push_back(u);
    node2.push_back(v);
    is_connected -= fountain.unite(u, v);

    int f1, f2;
    if (x == X) {
      f1 = get_face(x + 1, (y + Y) / 2);
      f2 = get_face(x - 1, (y + Y) / 2);
    } else {
      f1 = get_face((x + X) / 2, y + 1);
      f2 = get_face((x + X) / 2, y - 1);
    }

    g[f1].push_back(m);
    g[f2].push_back(m);
    face1.push_back(f1);
    face2.push_back(f2);
    m++;
  };

  for (int i = 0; i < N; i++) {
    int x = xvec[i], y = yvec[i];
    make_edge(x, y, x + 2, y);
    make_edge(x, y, x, y + 2);
  }

  if (is_connected > 1) {
    return 0;
  }

  vector<int> removal(m);
  vector<int> is_deg4(n);
  for (int i = 0; i < n; i++) {
    is_deg4[i] = g[i].size() == 4;
  }
  vector<vector<int>> nodes;

  {
    vector<set<int>> graph(n + 1);
    for (int e = 0; e < m; e++) {
      int u = face1[e], v = face2[e];
      graph[u].insert(v);
      graph[v].insert(u);
    }
    for (int i = 0; i < n; i++) {
      if (graph[i].size() & 1) {
        graph[i].insert(n);
        graph[n].insert(i);
      }
    }
    vector<int> way;
    function<void(int)> dfs = [&](int v) {
      vector<int> que = {v};
      while (que.size()) {
        int u = que.back();
        if (graph[u].empty()) {
          way.push_back(u);
          que.pop_back();
        } else {
          int b = *graph[u].begin();
          graph[u].erase(b);
          graph[b].erase(u);
          que.push_back(b);
        }
      }
    };

    vector<int> que;
    vector<int> in_queue(n + 1);
    for (int i = n; i >= 0; i--) {
      if (graph[i].empty()) {
        continue;
      }
      way.clear();
      dfs(i);
      for (int v : way) {
        if (in_queue[v]) {
          nodes.push_back({});
          while (que.back() != v) {
            nodes.back().push_back(que.back());
            in_queue[que.back()] = 0;
            que.pop_back();
          }
          nodes.back().push_back(v);
        } else {
          que.push_back(v);
          in_queue[v] = 1;
        }
      }
      que.pop_back();
      in_queue[i] = 0;
    }
  }

  int sz = nodes.size();
  vector<vector<int>> edges;
  {
    map<pair<int, int>, int> cur;
    for (int e = 0; e < m; e++) {
      int u = face1[e], v = face2[e];
      cur[make_pair(u, v)] = e;
      cur[make_pair(v, u)] = e;
    }
    for (auto &p : nodes) {
      edges.push_back({});
      for (int i = 0; i < (int) p.size(); i++) {
        int u = p[i], v = p[(i + 1) % p.size()];
        if (cur.count(make_pair(u, v))) {
          edges.back().push_back(cur[make_pair(u, v)]);
        }
      }
      if (p.back() == n) {
        p.pop_back();
      }
    }
  }
  vector<int> que;
  vector<vector<int>> relaxed(n);
  vector<int> was(sz);

  for (int i = 0; i < sz; i++) {
    for (int j : nodes[i]) {
      relaxed[j].push_back(i);
    }
    bool ok = false;
    for (int j : nodes[i]) {
      if (!is_deg4[j]) {
        ok = true;
      }
    }
    if (ok) {
      que.push_back(i);
      was[i] = 1;
    }
  }

  for (int b = 0; b < (int) que.size(); b++) {
    int i = que[b];
    for (int j = 0; j < (int) edges[i].size(); j++) {
      int v = nodes[i][j], e = edges[i][j];
      if (is_deg4[v]) {
        removal[e] = 1;
        is_deg4[v] = 0;
        for (int t : relaxed[v]) {
          if (!was[t]) {
            que.push_back(t);
            was[t] = 1;
          }
        }
      }
    }
  }
  vector<int> paired(m, -1);
  matching mt(m, n);
  int cnt = m;
  for (int e = 0; e < m; e++) {
    if (removal[e]) {
      cnt--;
      continue;
    }
    mt.add(e, face1[e]);
    mt.add(e, face2[e]);
  }
  vector<int> visited(n);

  function<void(int, int)> dfs = [&] (int v, int ed) {
    visited[v] = 1;
    if (ed != -1) {
      assert(mt.pa[ed] == -1);
      mt.pa[ed] = v;
      mt.pb[v] = ed;
      mt.res++;
    }
    for (int e : g[v]) {
      if (removal[e]) {
        continue;
      }
      int u = face1[e] ^ face2[e] ^ v;
      if (visited[u]) {
        continue;
      }
      dfs(u, e);
    }
  };

  for (int i = 0; i < n; i++) {
    if (visited[i]) {
      continue;
    }
    dfs(i, -1);
  }

  assert(mt.solve() == cnt);

  for (int e = 0; e < m; e++) {
    if (removal[e]) {
      continue;
    }
    paired[e] = mt.pa[e];
  }

  vector<int> ru, rv, rx, ry;
  for (int e = 0; e < m; e++) {
    if (removal[e]) {
      continue;
    }
    ru.push_back(node1[e]);
    rv.push_back(node2[e]);
    int id = paired[e];
    rx.push_back(bench[id].first);
    ry.push_back(bench[id].second);
  }
  build(ru, rv, rx, ry);
  return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2357 ms 127460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 6 ms 1028 KB Output is correct
26 Correct 7 ms 1236 KB Output is correct
27 Correct 10 ms 1492 KB Output is correct
28 Correct 718 ms 50884 KB Output is correct
29 Correct 1195 ms 77436 KB Output is correct
30 Correct 1785 ms 102088 KB Output is correct
31 Correct 2257 ms 128040 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 7 ms 1236 KB Output is correct
45 Correct 752 ms 54500 KB Output is correct
46 Correct 1071 ms 79440 KB Output is correct
47 Correct 1099 ms 79320 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2357 ms 127460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 6 ms 1028 KB Output is correct
26 Correct 7 ms 1236 KB Output is correct
27 Correct 10 ms 1492 KB Output is correct
28 Correct 718 ms 50884 KB Output is correct
29 Correct 1195 ms 77436 KB Output is correct
30 Correct 1785 ms 102088 KB Output is correct
31 Correct 2257 ms 128040 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 7 ms 1236 KB Output is correct
45 Correct 752 ms 54500 KB Output is correct
46 Correct 1071 ms 79440 KB Output is correct
47 Correct 1099 ms 79320 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 2529 ms 119512 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 9 ms 1348 KB Output is correct
58 Correct 31 ms 3792 KB Output is correct
59 Correct 25 ms 3392 KB Output is correct
60 Correct 1073 ms 59636 KB Output is correct
61 Correct 1557 ms 81164 KB Output is correct
62 Correct 1998 ms 99480 KB Output is correct
63 Correct 2626 ms 119692 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1506 ms 149504 KB Output is correct
68 Correct 1501 ms 149448 KB Output is correct
69 Correct 1423 ms 148740 KB Output is correct
70 Correct 9 ms 1364 KB Output is correct
71 Correct 18 ms 2420 KB Output is correct
72 Correct 709 ms 54588 KB Output is correct
73 Correct 1199 ms 82560 KB Output is correct
74 Correct 1676 ms 108632 KB Output is correct
75 Correct 1854 ms 122672 KB Output is correct
76 Correct 1457 ms 149452 KB Output is correct
77 Correct 10 ms 1716 KB Output is correct
78 Correct 22 ms 2824 KB Output is correct
79 Correct 733 ms 57936 KB Output is correct
80 Correct 1195 ms 86276 KB Output is correct
81 Correct 1787 ms 115596 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1305 ms 96608 KB Output is correct
21 Correct 1499 ms 89268 KB Output is correct
22 Correct 1301 ms 89456 KB Output is correct
23 Correct 1171 ms 128240 KB Output is correct
24 Correct 395 ms 16720 KB Output is correct
25 Correct 936 ms 70092 KB Output is correct
26 Correct 924 ms 70072 KB Output is correct
27 Correct 1390 ms 149100 KB Output is correct
28 Correct 1363 ms 148956 KB Output is correct
29 Correct 1391 ms 148920 KB Output is correct
30 Correct 1393 ms 149164 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 59 ms 7648 KB Output is correct
33 Correct 136 ms 8512 KB Output is correct
34 Correct 1408 ms 94916 KB Output is correct
35 Correct 22 ms 2832 KB Output is correct
36 Correct 151 ms 12872 KB Output is correct
37 Correct 380 ms 25328 KB Output is correct
38 Correct 497 ms 41372 KB Output is correct
39 Correct 717 ms 55832 KB Output is correct
40 Correct 975 ms 71084 KB Output is correct
41 Correct 1276 ms 86896 KB Output is correct
42 Correct 1595 ms 101988 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 308 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 6 ms 1208 KB Output is correct
56 Correct 611 ms 54568 KB Output is correct
57 Correct 1004 ms 79584 KB Output is correct
58 Correct 1032 ms 79560 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1421 ms 149376 KB Output is correct
63 Correct 1351 ms 149592 KB Output is correct
64 Correct 1350 ms 148796 KB Output is correct
65 Correct 7 ms 1364 KB Output is correct
66 Correct 19 ms 2428 KB Output is correct
67 Correct 622 ms 54624 KB Output is correct
68 Correct 1116 ms 82560 KB Output is correct
69 Correct 1526 ms 108860 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct
17 Correct 1403 ms 149368 KB Output is correct
18 Correct 1348 ms 149308 KB Output is correct
19 Correct 1363 ms 97456 KB Output is correct
20 Correct 1808 ms 117104 KB Output is correct
21 Correct 1362 ms 121864 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 150 ms 17720 KB Output is correct
24 Correct 53 ms 5764 KB Output is correct
25 Correct 278 ms 19092 KB Output is correct
26 Correct 575 ms 33148 KB Output is correct
27 Correct 733 ms 56400 KB Output is correct
28 Correct 964 ms 70448 KB Output is correct
29 Correct 1221 ms 84812 KB Output is correct
30 Correct 1472 ms 98500 KB Output is correct
31 Correct 1787 ms 112776 KB Output is correct
32 Correct 1753 ms 122632 KB Output is correct
33 Correct 1389 ms 149508 KB Output is correct
34 Correct 10 ms 1748 KB Output is correct
35 Correct 19 ms 2832 KB Output is correct
36 Correct 683 ms 57864 KB Output is correct
37 Correct 1163 ms 86200 KB Output is correct
38 Correct 1662 ms 115664 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 682 ms 74932 KB Output is correct
10 Correct 46 ms 7884 KB Output is correct
11 Correct 258 ms 40440 KB Output is correct
12 Correct 79 ms 11396 KB Output is correct
13 Correct 99 ms 15776 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 980 KB Output is correct
16 Correct 714 ms 74804 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2357 ms 127460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 6 ms 1028 KB Output is correct
26 Correct 7 ms 1236 KB Output is correct
27 Correct 10 ms 1492 KB Output is correct
28 Correct 718 ms 50884 KB Output is correct
29 Correct 1195 ms 77436 KB Output is correct
30 Correct 1785 ms 102088 KB Output is correct
31 Correct 2257 ms 128040 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 7 ms 1236 KB Output is correct
45 Correct 752 ms 54500 KB Output is correct
46 Correct 1071 ms 79440 KB Output is correct
47 Correct 1099 ms 79320 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 2529 ms 119512 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 9 ms 1348 KB Output is correct
58 Correct 31 ms 3792 KB Output is correct
59 Correct 25 ms 3392 KB Output is correct
60 Correct 1073 ms 59636 KB Output is correct
61 Correct 1557 ms 81164 KB Output is correct
62 Correct 1998 ms 99480 KB Output is correct
63 Correct 2626 ms 119692 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1506 ms 149504 KB Output is correct
68 Correct 1501 ms 149448 KB Output is correct
69 Correct 1423 ms 148740 KB Output is correct
70 Correct 9 ms 1364 KB Output is correct
71 Correct 18 ms 2420 KB Output is correct
72 Correct 709 ms 54588 KB Output is correct
73 Correct 1199 ms 82560 KB Output is correct
74 Correct 1676 ms 108632 KB Output is correct
75 Correct 1854 ms 122672 KB Output is correct
76 Correct 1457 ms 149452 KB Output is correct
77 Correct 10 ms 1716 KB Output is correct
78 Correct 22 ms 2824 KB Output is correct
79 Correct 733 ms 57936 KB Output is correct
80 Correct 1195 ms 86276 KB Output is correct
81 Correct 1787 ms 115596 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1305 ms 96608 KB Output is correct
86 Correct 1499 ms 89268 KB Output is correct
87 Correct 1301 ms 89456 KB Output is correct
88 Correct 1171 ms 128240 KB Output is correct
89 Correct 395 ms 16720 KB Output is correct
90 Correct 936 ms 70092 KB Output is correct
91 Correct 924 ms 70072 KB Output is correct
92 Correct 1390 ms 149100 KB Output is correct
93 Correct 1363 ms 148956 KB Output is correct
94 Correct 1391 ms 148920 KB Output is correct
95 Correct 1393 ms 149164 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 59 ms 7648 KB Output is correct
98 Correct 136 ms 8512 KB Output is correct
99 Correct 1408 ms 94916 KB Output is correct
100 Correct 22 ms 2832 KB Output is correct
101 Correct 151 ms 12872 KB Output is correct
102 Correct 380 ms 25328 KB Output is correct
103 Correct 497 ms 41372 KB Output is correct
104 Correct 717 ms 55832 KB Output is correct
105 Correct 975 ms 71084 KB Output is correct
106 Correct 1276 ms 86896 KB Output is correct
107 Correct 1595 ms 101988 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 0 ms 212 KB Output is correct
110 Correct 1 ms 300 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 1 ms 308 KB Output is correct
115 Correct 1 ms 212 KB Output is correct
116 Correct 1 ms 212 KB Output is correct
117 Correct 1 ms 212 KB Output is correct
118 Correct 1 ms 212 KB Output is correct
119 Correct 4 ms 852 KB Output is correct
120 Correct 6 ms 1208 KB Output is correct
121 Correct 611 ms 54568 KB Output is correct
122 Correct 1004 ms 79584 KB Output is correct
123 Correct 1032 ms 79560 KB Output is correct
124 Correct 1 ms 212 KB Output is correct
125 Correct 1 ms 212 KB Output is correct
126 Correct 1 ms 212 KB Output is correct
127 Correct 1421 ms 149376 KB Output is correct
128 Correct 1351 ms 149592 KB Output is correct
129 Correct 1350 ms 148796 KB Output is correct
130 Correct 7 ms 1364 KB Output is correct
131 Correct 19 ms 2428 KB Output is correct
132 Correct 622 ms 54624 KB Output is correct
133 Correct 1116 ms 82560 KB Output is correct
134 Correct 1526 ms 108860 KB Output is correct
135 Correct 1403 ms 149368 KB Output is correct
136 Correct 1348 ms 149308 KB Output is correct
137 Correct 1363 ms 97456 KB Output is correct
138 Correct 1808 ms 117104 KB Output is correct
139 Correct 1362 ms 121864 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 150 ms 17720 KB Output is correct
142 Correct 53 ms 5764 KB Output is correct
143 Correct 278 ms 19092 KB Output is correct
144 Correct 575 ms 33148 KB Output is correct
145 Correct 733 ms 56400 KB Output is correct
146 Correct 964 ms 70448 KB Output is correct
147 Correct 1221 ms 84812 KB Output is correct
148 Correct 1472 ms 98500 KB Output is correct
149 Correct 1787 ms 112776 KB Output is correct
150 Correct 1753 ms 122632 KB Output is correct
151 Correct 1389 ms 149508 KB Output is correct
152 Correct 10 ms 1748 KB Output is correct
153 Correct 19 ms 2832 KB Output is correct
154 Correct 683 ms 57864 KB Output is correct
155 Correct 1163 ms 86200 KB Output is correct
156 Correct 1662 ms 115664 KB Output is correct
157 Correct 1 ms 212 KB Output is correct
158 Correct 0 ms 212 KB Output is correct
159 Correct 0 ms 212 KB Output is correct
160 Correct 0 ms 212 KB Output is correct
161 Correct 2571 ms 109092 KB Output is correct
162 Correct 1399 ms 93056 KB Output is correct
163 Correct 1661 ms 102928 KB Output is correct
164 Correct 1696 ms 102244 KB Output is correct
165 Correct 2205 ms 102412 KB Output is correct
166 Correct 2370 ms 107816 KB Output is correct
167 Correct 353 ms 24976 KB Output is correct
168 Correct 102 ms 7584 KB Output is correct
169 Correct 361 ms 21020 KB Output is correct
170 Correct 983 ms 39416 KB Output is correct
171 Correct 1379 ms 50268 KB Output is correct
172 Correct 1196 ms 54500 KB Output is correct
173 Correct 1649 ms 64964 KB Output is correct
174 Correct 2005 ms 78092 KB Output is correct
175 Correct 2273 ms 88428 KB Output is correct
176 Correct 2749 ms 98604 KB Output is correct
177 Correct 2662 ms 108932 KB Output is correct