oj.uz

답안 #900170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900170 2024-01-07T19:59:55 Z cadmiumsky 봉쇄 시간 (IOI23_closing) C++17
75 / 100
 677 ms 71040 KB 
#include <bits/stdc++.h>
#include "closing.h"
#define all(x) (x).begin(),(x).end()
using namespace std;
 
using ll = long long;
using ld = long double;
 
#define int ll
#define sz(x) ((int)(x).size())
 
using pii = pair<ll,ll>;
using tii = tuple<int,int,int>;
 
const int nmax = 3e3 + 5;
 
vector<pii> g[nmax];
 
vector<ll> dX, dY;
vector<int> occX;
 
vector<int> chain;
 
void dfs(int node, int f, vector<ll>& d, ll accum) {
  d[node] = accum;
  for(auto [x, c] : g[node])
    if(x != f)
      dfs(x, node, d, accum + c);
  
  return;
}
 
void findchain(int node, int f, int Y) {
  if(sz(chain) && chain.back() == Y) return;
  chain.emplace_back(node);
  for(auto [x, e] : g[node]) {
    if(x == f) continue;
    findchain(x, node, Y);
  }
  if(chain.back() == Y) return;
  chain.pop_back();
}
 
int disjointed(int n, ll K, int X, int Y) {
  priority_queue<pii, vector<pii>, greater<pii>> heap;
  
  vector<int> occY(n, 0);
  
  heap.emplace(0, Y);
  heap.emplace(0, X);
  
  int scorefromY = 0;
  
  while(!heap.empty()) {
    auto [C, node] = heap.top();
    K -= C;
    
    if(K < 0) break;
    
    heap.pop();
    occY[node] = 1;
    scorefromY++;
    
    for(auto [x, e] : g[node]) {
      if(occY[x]) continue;
      heap.emplace(C + e, x);
    }
  }
  
  return scorefromY;
} 

const ll inf = ((ll)1e18) + 5;

int X, Y;

ll A[nmax], B[nmax];
 
namespace DP {
  
  int foutu[nmax];
  
  vector<ll> dp[nmax][2];
  int dim[nmax][2];
  
  void clear(int n) {
    for(int i = 0; i < n; i++) {
      dim[i][0] = dim[i][1] = 0;
      dp[i][0].clear();
      dp[i][1].clear();
      foutu[i] = A[i] = B[i] = 0;
    }
  }
  
  void convolute(vector<ll> a, vector<ll> b, vector<ll>& c) {
    c.resize(max(sz(c), sz(a) + sz(b) - 1), inf);
    //cerr << sz(a) << ' ' << sz(b) << ' ' << sz(c) << '\n';
    for(int i = 0; i < sz(a); i++)
      for(int j = 0; j < sz(b); j++)
        c[i + j] = min(c[i + j], a[i] + b[j]);
    return;
  }
  
  void getdp(int node, int f) { // vectori???
    dp[node][0].resize(2, A[node]);
    dp[node][1].resize(3, B[node]);
    
    //cerr << node << '\n';
    
    for(auto [x, e] : g[node]) {
      if(x == f) continue;
      getdp(x, node);
    }
    
    for(auto [x, e] : g[node]) {
      if(x == f) continue;
      
      vector<ll> tmp;
      
      tmp = dp[node][0];
      convolute(dp[node][0], dp[x][0], tmp);
      dp[node][0] = move(tmp);
      
      tmp = dp[node][1];
      convolute(dp[node][1], dp[x][1], tmp);
      convolute(dp[node][1], dp[x][0], tmp);
      dp[node][1] = move(tmp);
    }
    
    
    vector<ll> idk;
    for(int i = 2; i < sz(dp[node][1]); i++)
      if(max({dp[node][1][i], dp[node][1][i - 1]}) < inf)
        idk.emplace_back(dp[node][1][i] - dp[node][1][i - 1]);
    //for(int i = 1; i < sz(idk); i++)
      //assert(idk[i] >= idk[i - 1]);
      
    return;
  }
  
  int getRestraint(int n, int root, ll K) {
    clear(n);
    
    for(auto x : chain)
      K -= min(dX[x], dY[x]);
    
    for(int i = 0; i < n; i++)
      A[i] = min(dX[i], dY[i]),
      B[i] = max(dX[i], dY[i]);
    for(auto x : chain)
      A[x] = 0,
      B[x] = max(dX[x], dY[x]) - min(dX[x], dY[x]);
    
    
    if(K < 0) return 0;
    
    getdp(root, root);
    //cerr << "! " << sz(dp[root][1]) << '\n';
    for(int i = sz(dp[root][1]) - 1; i >= 0; i--)
      if(dp[root][1][i] <= K) return i;
    return 0;
  }
}
 
#undef int
int max_score(int n, int _X, int _Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  X = _X;
  Y = _Y;
  #define int ll
  for(int i = 0; i < n; i++) g[i].clear();
  chain.clear();
  dX.clear();
  dY.clear();
  occX.clear();
  
  for(int i = 0; i < n - 1; i++)
    g[U[i]].emplace_back(V[i], W[i]),
    g[V[i]].emplace_back(U[i], W[i]);
    
  dX.resize(n);
  dY.resize(n);
  
  dfs(X, X, dX, 0);
  dfs(Y, Y, dY, 0);
  
  findchain(X, X, Y);

  int maxscore = disjointed(n, K, X, Y);
  
  int prv = X;
  for(auto x : chain) {
    if(dX[x] > dY[x]) { maxscore = max(maxscore, DP::getRestraint(n, prv, K)); break; }
    prv = x;
  }
  
  prv = Y;
  reverse(all(chain));
  for(auto x : chain) {
    if(dY[x] > dX[x]) { maxscore = max(maxscore, DP::getRestraint(n, prv, K)); break; }
    prv = x;
  }
  
  return maxscore;
}
#undef int

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 46 ms 10324 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 656 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 5 ms 2908 KB Output is correct
20 Correct 6 ms 3928 KB Output is correct
21 Correct 4 ms 2392 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 656 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 5 ms 2908 KB Output is correct
20 Correct 6 ms 3928 KB Output is correct
21 Correct 4 ms 2392 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 5 ms 604 KB Output is correct
26 Correct 141 ms 71040 KB Output is correct
27 Correct 121 ms 62468 KB Output is correct
28 Correct 111 ms 55632 KB Output is correct
29 Correct 120 ms 59744 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 2 ms 1112 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 656 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 0 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 652 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 656 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 5 ms 2908 KB Output is correct
21 Correct 6 ms 3928 KB Output is correct
22 Correct 4 ms 2392 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 0 ms 600 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 652 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 2 ms 860 KB Output is correct
61 Correct 2 ms 856 KB Output is correct
62 Correct 2 ms 860 KB Output is correct
63 Correct 3 ms 1116 KB Output is correct
64 Correct 4 ms 1116 KB Output is correct
65 Correct 3 ms 860 KB Output is correct
66 Correct 3 ms 1072 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 5 ms 2140 KB Output is correct
69 Correct 4 ms 2396 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 1 ms 604 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 2 ms 860 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 2 ms 604 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 656 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 5 ms 2908 KB Output is correct
21 Correct 6 ms 3928 KB Output is correct
22 Correct 4 ms 2392 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 5 ms 604 KB Output is correct
27 Correct 141 ms 71040 KB Output is correct
28 Correct 121 ms 62468 KB Output is correct
29 Correct 111 ms 55632 KB Output is correct
30 Correct 120 ms 59744 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 0 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 600 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 0 ms 600 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 652 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 1 ms 600 KB Output is correct
67 Correct 2 ms 604 KB Output is correct
68 Correct 2 ms 860 KB Output is correct
69 Correct 2 ms 856 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1116 KB Output is correct
72 Correct 4 ms 1116 KB Output is correct
73 Correct 3 ms 860 KB Output is correct
74 Correct 3 ms 1072 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 5 ms 2140 KB Output is correct
77 Correct 4 ms 2396 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 2 ms 860 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 2 ms 604 KB Output is correct
84 Correct 4 ms 604 KB Output is correct
85 Correct 9 ms 1000 KB Output is correct
86 Correct 7 ms 860 KB Output is correct
87 Correct 9 ms 1064 KB Output is correct
88 Correct 8 ms 860 KB Output is correct
89 Correct 59 ms 6988 KB Output is correct
90 Correct 53 ms 6708 KB Output is correct
91 Correct 57 ms 6028 KB Output is correct
92 Correct 54 ms 8020 KB Output is correct
93 Correct 2 ms 860 KB Output is correct
94 Correct 107 ms 48496 KB Output is correct
95 Correct 140 ms 53076 KB Output is correct
96 Correct 2 ms 1112 KB Output is correct
97 Correct 81 ms 24436 KB Output is correct
98 Correct 53 ms 2432 KB Output is correct
99 Correct 56 ms 4064 KB Output is correct
100 Correct 32 ms 2100 KB Output is correct
101 Correct 12 ms 1300 KB Output is correct

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 656 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 5 ms 2908 KB Output is correct
21 Correct 6 ms 3928 KB Output is correct
22 Correct 4 ms 2392 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 5 ms 604 KB Output is correct
27 Correct 141 ms 71040 KB Output is correct
28 Correct 121 ms 62468 KB Output is correct
29 Correct 111 ms 55632 KB Output is correct
30 Correct 120 ms 59744 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 0 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 600 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 0 ms 600 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 0 ms 604 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 652 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 1 ms 600 KB Output is correct
67 Correct 2 ms 604 KB Output is correct
68 Correct 2 ms 860 KB Output is correct
69 Correct 2 ms 856 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1116 KB Output is correct
72 Correct 4 ms 1116 KB Output is correct
73 Correct 3 ms 860 KB Output is correct
74 Correct 3 ms 1072 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 5 ms 2140 KB Output is correct
77 Correct 4 ms 2396 KB Output is correct
78 Correct 1 ms 604 KB Output is correct
79 Correct 1 ms 604 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 2 ms 860 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 2 ms 604 KB Output is correct
84 Correct 4 ms 604 KB Output is correct
85 Correct 9 ms 1000 KB Output is correct
86 Correct 7 ms 860 KB Output is correct
87 Correct 9 ms 1064 KB Output is correct
88 Correct 8 ms 860 KB Output is correct
89 Correct 59 ms 6988 KB Output is correct
90 Correct 53 ms 6708 KB Output is correct
91 Correct 57 ms 6028 KB Output is correct
92 Correct 54 ms 8020 KB Output is correct
93 Correct 2 ms 860 KB Output is correct
94 Correct 107 ms 48496 KB Output is correct
95 Correct 140 ms 53076 KB Output is correct
96 Correct 2 ms 1112 KB Output is correct
97 Correct 81 ms 24436 KB Output is correct
98 Correct 53 ms 2432 KB Output is correct
99 Correct 56 ms 4064 KB Output is correct
100 Correct 32 ms 2100 KB Output is correct
101 Correct 12 ms 1300 KB Output is correct
102 Correct 348 ms 3532 KB Output is correct
103 Correct 677 ms 3704 KB Output is correct
104 Runtime error 42 ms 10600 KB Execution killed with signal 11
105 Halted 0 ms 0 KB -