oj.uz

Submission #882987

# Submission time Handle Problem Language Result Execution time Memory
882987 2023-12-04T10:55:38 Z MilosMilutinovic Wild Boar (JOI18_wild_boar) C++14
100 / 100
 10186 ms 1009888 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int readint() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' && ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
  while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
  return x * f;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n = readint();
  int m = readint();
  int t = readint();
  int l = readint();
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < m; i++) {
    int x = readint();
    int y = readint();
    int z = readint();
    --x; --y;
    g[x].emplace_back(y, z);
    g[y].emplace_back(x, z);
  }
  vector<int> seq(l);
  for (int i = 0; i < l; i++) {
    seq[i] = readint();
    --seq[i];
  }
  vector<int> deg(n);
  for (int i = 0; i < n; i++) {
    deg[i] = (int) g[i].size();
  }
  vector<vector<int>> idx(n, vector<int>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < deg[i]; j++) {
      idx[i][g[i][j].first] = j;
    }
  }
  const long long inf = (long long) 1e18;
  vector<vector<vector<vector<long long>>>> dist(n, vector<vector<vector<long long>>>(n));
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (i == j) {
        continue;
      }
      dist[i][j].resize(deg[i]);
      for (int k = 0; k < deg[i]; k++) {
        dist[i][j][k] = vector<long long>(deg[j], inf);
      }
    }
  }
  vector<vector<long long>> d(n);
  for (int i = 0; i < n; i++) {
    d[i].resize(deg[i]);
  }
  vector<int> ia(n), ib(n);
  set<tuple<long long, int, int>> que;
  for (int ver = 0; ver < n; ver++) {
    for (int e = 0; e < deg[ver]; e++) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < deg[i]; j++) {
          d[i][j] = inf;
        }
        ia[i] = -1;
        ib[i] = -1;
      }
      int to = g[ver][e].first;
      int w = g[ver][e].second;
      d[to][idx[to][ver]] = w;
      que.clear();
      que.emplace(d[to][idx[to][ver]], to, idx[to][ver]);
      ia[to] = idx[to][ver];
      auto Update = [&](int x, int y, long long z) {
        if (ia[x] == y || ib[x] == y) {
          que.erase(que.find({d[x][y], x, y}));
        }
        d[x][y] = z;
        if (ia[x] == y) {
          return;
        }
        if (ib[x] == y) {
          if (d[x][y] < d[x][ia[x]]) {
            swap(ia[x], ib[x]);
          }
          return;
        }
        if (ia[x] == -1) {
          ia[x] = y;
          que.emplace(d[x][y], x, y);
          return;
        }
        if (ib[x] == -1) {
          if (d[x][y] < d[x][ia[x]]) {
            swap(ia[x], ib[x]);
            ia[x] = y;
          } else {
            ib[x] = y;
          }
          que.emplace(d[x][y], x, y);
          return;
        }
        if (d[x][y] >= d[x][ia[x]] && d[x][y] < d[x][ib[x]]) {
          que.erase(que.find({d[x][ib[x]], x, ib[x]}));
          ib[x] = y;
          que.emplace(d[x][y], x, y);
          return;
        }
        if (d[x][y] < d[x][ia[x]]) {
          que.erase(que.find({d[x][ib[x]], x, ib[x]}));
          swap(ia[x], ib[x]);
          ia[x] = y;
          que.emplace(d[x][y], x, y);
        }
      };
      while (!que.empty()) {
        auto it = que.begin();
        int v = get<1>(*it);
        int lst = get<2>(*it);
        que.erase(it);
        for (int i = 0; i < deg[v]; i++) {
          if (i == lst) {
            continue;
          }
          int to = g[v][i].first;
          int w = g[v][i].second;
          if (d[to][idx[to][v]] > d[v][lst] + w) {
            Update(to, idx[to][v], d[v][lst] + w);
            assert((int) que.size() <= 2 * n);
          }
        }
      }
      for (int i = ver + 1; i < n; i++) {
        if (i == ver) {
          continue;
        }
        for (int j = 0; j < deg[i]; j++) {
          dist[ver][i][e][j] = d[i][j];
        }
      }
    }
  }
  vector<vector<vector<vector<int>>>> good(n, vector<vector<vector<int>>>(n, vector<vector<int>>(2)));
  vector<vector<int>> cc(n, vector<int>(2));
  for (int from = 0; from < n; from++) {
    for (int to = 0; to < n; to++) {
      if (from == to) {
        continue;
      }
      vector<pair<int, int>> order;
      for (int i = 0; i < deg[from]; i++) {
        for (int j = 0; j < deg[to]; j++) {
          order.emplace_back(i, j);
        }
      }
      if (from <= to) {
        sort(order.begin(), order.end(), [&](pair<int, int> a, pair<int, int> b) {
          return dist[from][to][a.first][a.second] < dist[from][to][b.first][b.second];
        });
      } else {
        sort(order.begin(), order.end(), [&](pair<int, int> a, pair<int, int> b) {
          return dist[to][from][a.second][a.first] < dist[to][from][b.second][b.first];
        });
      }
      int total = 0;
      for (auto& p : order) {
        if (cc[p.first][0] >= 2 || cc[p.second][1] >= 2) {
          continue;
        }
        good[from][to][0].push_back(p.first);
        good[from][to][1].push_back(p.second);
        cc[p.first][0] += 1;
        cc[p.second][1] += 1;
        total += 1;
        if (total >= 5) {
          break;
        }
      }
      for (int t = 0; t < 2; t++) {
        sort(good[from][to][t].begin(), good[from][to][t].end());
        good[from][to][t].erase(unique(good[from][to][t].begin(), good[from][to][t].end()), good[from][to][t].end());
      }
      for (int i = 0; i < deg[from]; i++) {
        cc[i][0] = 0;
      }
      for (int i = 0; i < deg[to]; i++) {
        cc[i][1] = 0;
      }
    }
  }
  vector<vector<vector<int>>> f(l, vector<vector<int>>(2));
  auto Update = [&](int i) {
    f[i][0].clear();
    f[i][1].clear();
    if (i > 0) {
      for (int j : good[seq[i - 1]][seq[i]][1]) {
        f[i][0].push_back(j);
      }
    }
    if (i + 1 < l) {
      for (int j : good[seq[i]][seq[i + 1]][0]) {
        f[i][1].push_back(j);
      }
    }
  };
  vector<vector<vector<long long>>> st(4 * l);
  auto Pull = [&](int x, int l, int r) {
    int mid = l + r >> 1;
    st[x].clear();
    for (int ll = 0; ll < (int) st[x * 2].size(); ll++) {
      for (int lr = 0; lr < (int) st[x * 2][ll].size(); lr++) {
        if (st[x].empty()) {
          st[x].resize((int) st[x * 2].size());
        }
        for (int rl = 0; rl < (int) st[x * 2 + 1].size(); rl++) {
          if (st[x][ll].empty()) {
            st[x][ll] = vector<long long>((int) st[x * 2 + 1][rl].size(), inf);
          }
          if (f[mid + 1][0][lr] == f[mid + 1][1][rl]) {
            continue;
          }
          if (st[x * 2][ll][lr] != inf) {
            for (int rr = 0; rr < (int) st[x * 2 + 1][rl].size(); rr++) {
              st[x][ll][rr] = min(st[x][ll][rr], st[x * 2][ll][lr] + st[x * 2 + 1][rl][rr]);
            }
          }
        }
      }
    }
  };
  function<void(int, int, int)> Build = [&](int x, int l, int r) {
    if (l == r) {
      st[x].resize(f[l][1].size());
      for (int i = 0; i < f[l][1].size(); i++) {
        st[x][i] = vector<long long>(f[l + 1][0].size(), inf);
      }
      for (int i = 0; i < f[l][1].size(); i++) {
        for (int j = 0; j < f[l + 1][0].size(); j++) {
          if (seq[l] <= seq[l + 1]) {
            st[x][i][j] = min(st[x][i][j], dist[seq[l]][seq[l + 1]][f[l][1][i]][f[l + 1][0][j]]);
          } else {
            st[x][i][j] = min(st[x][i][j], dist[seq[l + 1]][seq[l]][f[l + 1][0][j]][f[l][1][i]]);
          }
        }
      }
      return;
    }
    int mid = l + r >> 1;
    Build(x * 2, l, mid);
    Build(x * 2 + 1, mid + 1, r);
    Pull(x, l, r);
  };
  function<void(int, int, int, int)> Modify = [&](int x, int l, int r, int p) {
    if (l == r) {
      st[x].resize(f[l][1].size());
      for (int i = 0; i < f[l][1].size(); i++) {
        st[x][i] = vector<long long>(f[l + 1][0].size(), inf);
      }
      for (int i = 0; i < f[l][1].size(); i++) {
        for (int j = 0; j < f[l + 1][0].size(); j++) {
          if (seq[l] <= seq[l + 1]) {
            st[x][i][j] = min(st[x][i][j], dist[seq[l]][seq[l + 1]][f[l][1][i]][f[l + 1][0][j]]);
          } else {
            st[x][i][j] = min(st[x][i][j], dist[seq[l + 1]][seq[l]][f[l + 1][0][j]][f[l][1][i]]);
          }
        }
      }
      return;
    }
    int mid = l + r >> 1;
    if (p <= mid) {
      Modify(x * 2, l, mid, p);
    } else {
      Modify(x * 2 + 1, mid + 1, r, p);
    }
    Pull(x, l, r);
  };
  for (int i = 0; i < l; i++) {
    Update(i);
  }
  Build(1, 0, l - 2);
  auto Solve = [&]() {
    long long res = inf;
    for (int i = 0; i < st[1].size(); i++) {
      for (int j = 0; j < st[1][i].size(); j++) {
        res = min(res, st[1][i][j]);
      }
    }
    return (res == inf ? -1LL : res);
  };
  while (t--) {
    int p = readint();
    int x = readint();
    --p; --x;
    seq[p] = x;
    Update(p);
    if (p > 0) {
      Update(p - 1);
    }
    if (p + 1 < l) {
      Update(p + 1);
    }
    if (p <= l - 2) {
      Modify(1, 0, l - 2, p);
    }
    if (p + 1 <= l - 2) {
      Modify(1, 0, l - 2, p + 1);
    }
    if (p > 0) {
      Modify(1, 0, l - 2, p - 1);
    }
    printf("%lld\n", Solve());
  }
  return 0;
}

Compilation message

wild_boar.cpp: In lambda function:
wild_boar.cpp:211:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  211 |     int mid = l + r >> 1;
      |               ~~^~~
wild_boar.cpp: In lambda function:
wild_boar.cpp:237:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  237 |       for (int i = 0; i < f[l][1].size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~
wild_boar.cpp:240:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |       for (int i = 0; i < f[l][1].size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~
wild_boar.cpp:241:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  241 |         for (int j = 0; j < f[l + 1][0].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:251:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  251 |     int mid = l + r >> 1;
      |               ~~^~~
wild_boar.cpp: In lambda function:
wild_boar.cpp:259:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  259 |       for (int i = 0; i < f[l][1].size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~
wild_boar.cpp:262:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  262 |       for (int i = 0; i < f[l][1].size(); i++) {
      |                       ~~^~~~~~~~~~~~~~~~
wild_boar.cpp:263:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  263 |         for (int j = 0; j < f[l + 1][0].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:273:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  273 |     int mid = l + r >> 1;
      |               ~~^~~
wild_boar.cpp: In lambda function:
wild_boar.cpp:287:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  287 |     for (int i = 0; i < st[1].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
wild_boar.cpp:288:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  288 |       for (int j = 0; j < st[1][i].size(); j++) {
      |                       ~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 500 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 500 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 116 ms 48772 KB Output is correct
28 Correct 115 ms 48732 KB Output is correct
29 Correct 250 ms 71028 KB Output is correct
30 Correct 292 ms 84196 KB Output is correct
31 Correct 336 ms 97552 KB Output is correct
32 Correct 319 ms 94936 KB Output is correct
33 Correct 244 ms 68440 KB Output is correct
34 Correct 249 ms 68184 KB Output is correct
35 Correct 372 ms 108272 KB Output is correct
36 Correct 376 ms 105548 KB Output is correct
37 Correct 248 ms 69752 KB Output is correct
38 Correct 232 ms 66896 KB Output is correct
39 Correct 343 ms 101368 KB Output is correct
40 Correct 242 ms 67336 KB Output is correct
41 Correct 232 ms 67156 KB Output is correct
42 Correct 339 ms 106580 KB Output is correct
43 Correct 236 ms 68188 KB Output is correct
44 Correct 232 ms 68180 KB Output is correct
45 Correct 232 ms 71892 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 500 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 116 ms 48772 KB Output is correct
28 Correct 115 ms 48732 KB Output is correct
29 Correct 250 ms 71028 KB Output is correct
30 Correct 292 ms 84196 KB Output is correct
31 Correct 336 ms 97552 KB Output is correct
32 Correct 319 ms 94936 KB Output is correct
33 Correct 244 ms 68440 KB Output is correct
34 Correct 249 ms 68184 KB Output is correct
35 Correct 372 ms 108272 KB Output is correct
36 Correct 376 ms 105548 KB Output is correct
37 Correct 248 ms 69752 KB Output is correct
38 Correct 232 ms 66896 KB Output is correct
39 Correct 343 ms 101368 KB Output is correct
40 Correct 242 ms 67336 KB Output is correct
41 Correct 232 ms 67156 KB Output is correct
42 Correct 339 ms 106580 KB Output is correct
43 Correct 236 ms 68188 KB Output is correct
44 Correct 232 ms 68180 KB Output is correct
45 Correct 232 ms 71892 KB Output is correct
46 Correct 179 ms 16176 KB Output is correct
47 Correct 3033 ms 254240 KB Output is correct
48 Correct 3296 ms 349964 KB Output is correct
49 Correct 3601 ms 440348 KB Output is correct
50 Correct 3582 ms 434220 KB Output is correct
51 Correct 3551 ms 426200 KB Output is correct
52 Correct 3655 ms 400112 KB Output is correct
53 Correct 3661 ms 399700 KB Output is correct
54 Correct 3660 ms 399928 KB Output is correct
55 Correct 3646 ms 398272 KB Output is correct
56 Correct 3810 ms 443800 KB Output is correct
57 Correct 4002 ms 493648 KB Output is correct
58 Correct 4246 ms 542832 KB Output is correct
59 Correct 4366 ms 596508 KB Output is correct
60 Correct 4566 ms 652616 KB Output is correct
61 Correct 4739 ms 713132 KB Output is correct
62 Correct 4995 ms 779080 KB Output is correct
63 Correct 4992 ms 848008 KB Output is correct
64 Correct 3397 ms 1005836 KB Output is correct
65 Correct 3552 ms 1005700 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 500 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 116 ms 48772 KB Output is correct
28 Correct 115 ms 48732 KB Output is correct
29 Correct 250 ms 71028 KB Output is correct
30 Correct 292 ms 84196 KB Output is correct
31 Correct 336 ms 97552 KB Output is correct
32 Correct 319 ms 94936 KB Output is correct
33 Correct 244 ms 68440 KB Output is correct
34 Correct 249 ms 68184 KB Output is correct
35 Correct 372 ms 108272 KB Output is correct
36 Correct 376 ms 105548 KB Output is correct
37 Correct 248 ms 69752 KB Output is correct
38 Correct 232 ms 66896 KB Output is correct
39 Correct 343 ms 101368 KB Output is correct
40 Correct 242 ms 67336 KB Output is correct
41 Correct 232 ms 67156 KB Output is correct
42 Correct 339 ms 106580 KB Output is correct
43 Correct 236 ms 68188 KB Output is correct
44 Correct 232 ms 68180 KB Output is correct
45 Correct 232 ms 71892 KB Output is correct
46 Correct 179 ms 16176 KB Output is correct
47 Correct 3033 ms 254240 KB Output is correct
48 Correct 3296 ms 349964 KB Output is correct
49 Correct 3601 ms 440348 KB Output is correct
50 Correct 3582 ms 434220 KB Output is correct
51 Correct 3551 ms 426200 KB Output is correct
52 Correct 3655 ms 400112 KB Output is correct
53 Correct 3661 ms 399700 KB Output is correct
54 Correct 3660 ms 399928 KB Output is correct
55 Correct 3646 ms 398272 KB Output is correct
56 Correct 3810 ms 443800 KB Output is correct
57 Correct 4002 ms 493648 KB Output is correct
58 Correct 4246 ms 542832 KB Output is correct
59 Correct 4366 ms 596508 KB Output is correct
60 Correct 4566 ms 652616 KB Output is correct
61 Correct 4739 ms 713132 KB Output is correct
62 Correct 4995 ms 779080 KB Output is correct
63 Correct 4992 ms 848008 KB Output is correct
64 Correct 3397 ms 1005836 KB Output is correct
65 Correct 3552 ms 1005700 KB Output is correct
66 Correct 122 ms 63060 KB Output is correct
67 Correct 1012 ms 242264 KB Output is correct
68 Correct 2913 ms 960408 KB Output is correct
69 Correct 3301 ms 961652 KB Output is correct
70 Correct 4232 ms 1009888 KB Output is correct
71 Correct 7133 ms 250528 KB Output is correct
72 Correct 10186 ms 368260 KB Output is correct
73 Correct 6009 ms 407244 KB Output is correct
74 Correct 5956 ms 407540 KB Output is correct
75 Correct 6070 ms 405828 KB Output is correct
76 Correct 7717 ms 436904 KB Output is correct
77 Correct 9696 ms 449860 KB Output is correct
78 Correct 9954 ms 451560 KB Output is correct
79 Correct 6295 ms 499012 KB Output is correct
80 Correct 6258 ms 550764 KB Output is correct
81 Correct 8607 ms 640544 KB Output is correct
82 Correct 6221 ms 658692 KB Output is correct
83 Correct 9712 ms 767156 KB Output is correct
84 Correct 6353 ms 851728 KB Output is correct
85 Correct 4638 ms 1007284 KB Output is correct