oj.uz

Submission #1070089

# Submission time Handle Problem Language Result Execution time Memory
1070089 2024-08-22T11:36:04 Z bleahbleah Beech Tree (IOI23_beechtree) C++17
66 / 100
 2000 ms 136284 KB 
#include "beechtree.h"
#include <bits/stdc++.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<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 3e5 + 5;

const int mod = 998244853;
struct Mint {
  int val;
  Mint(ll x = 0): val((x % mod + mod) % mod) {;}
  Mint operator +(const Mint& x) const { return Mint(val + x.val); }
  Mint operator -(const Mint& x) const { return Mint(val - x.val); }
  Mint operator *(const Mint& x) const { return Mint((ll)val * x.val); }
  Mint operator +=(const Mint& x) { return *this = Mint(val + x.val); }
  Mint operator -=(const Mint& x) { return *this = Mint(val - x.val); }
  Mint operator *=(const Mint& x) { return *this = Mint((ll)val * x.val); }
  Mint operator ^(const int& _b) const {
    Mint accum = 1, a = *this;
    int b = _b;
    while(b) {
      accum = (b & 1? accum * a : accum);
      a *= a;
      b >>= 1;
    }
    return accum;
  }
  Mint operator /(const Mint& x) { return Mint((ll)val * (x ^ (mod - 2)).val); }
  Mint operator /=(const Mint& x) { return *this = Mint((ll)val * (x ^ (mod - 2)).val); }
};

Mint p[2][nmax];

#define hash bjsefdjhsdsfhoi
struct hash {
   Mint v[2];
   int len;
   hash(Mint a = 0, Mint b = 0, int c = 0) { v[0] = a; v[1] = b; len = c; }
   hash operator +(const hash& x) const {
      return hash(v[0] * p[0][x.len] + x.v[0], v[1] * p[1][x.len] + x.v[1], len + x.len);
   }
   hash operator -(const hash& x) const {
      return hash(v[0] - p[0][len - x.len] * x.v[0], v[1] - p[1][len - x.len] * x.v[1], len - x.len); 
   }
   bool operator !=(const hash& x) const {
      return v[0].val != x.v[0].val || v[1].val != x.v[1].val || len != x.len;
   }
   ll operator()() const { return (ll)v[0].val * mod + v[1].val; }
};



vector<pii> g[nmax];
vector<int> P, C;

unordered_set<int> colors[nmax], play[nmax];
bool isanc(unordered_set<int>& A, unordered_set<int>& B) {
   if(sz(A) < sz(B)) return 0;
   for(auto &x : B)
      if(!A.count(x)) return 0;
   return 1;
}

vector<int> sol;
int h[nmax];

int area[nmax];
hash subarb[nmax];

bool superimposable(int x, int y) { // x peste y 
   if(sz(g[x]) == 0 || x == y) return 1;
   if(subarb[x]() == subarb[y]()) return 1;
   //if(calc[x][y]) return SI[x][y];
   map<int, int> gy;
   for(auto [a, c] : g[y]) gy[c] = a;
   //calc[x][y] = 1;
   //SI[x][y] = 1; 
   for(auto [a, c] : g[x]) {
      if(gy.count(c) == 0) { return 0; }
      if(!superimposable(a, gy[c])) { return 0; }
   }
   return 1;
}

void insert(int& works, map<int, int>& st, int node) {
   if(!works) return;
   auto it = st.upper_bound(area[node]);
   if(it == st.end());
   else if(!superimposable(node, it -> second)) { works = 0; return; }
   if(it == st.begin()); 
   else if(!superimposable(prev(it) -> second, node)) { works = 0; return; }
   st[area[node]] = node;
   return;
}

map<int, int> dfs(int node) {
   map<int, int> here;
   sol[node] = 1;
   area[node] = 1;
   
   vector<hash> fils;
   
   for(auto [x, c] : g[node]) {
      auto T = dfs(x);
      fils.emplace_back(hash(c) + subarb[x]);
      area[node] += area[x];
      sol[node] &= sol[x];
      if(sz(T) > sz(here)) swap(here, T);
      for(auto [a, x] : T) insert(sol[node], here, x);
   }
   
   sort(all(fils), [&](auto a, auto b) { return a() < b(); });
   subarb[node] = hash(node);
   for(auto x : fils) subarb[node] = subarb[node] + x;
   subarb[node] = subarb[node] + hash(12);
   
   insert(sol[node], here, node);
   if(sz(g[node]) != sz(colors[node])) sol[node] = 0;
   return here;
}

std::vector<int> beechtree(int N, int M, std::vector<int> P_, std::vector<int> C_) {
   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
   p[0][0] = p[1][0] = 1;
   p[0][1] = rng() % (mod - 1000) + 503;
   p[1][1] = rng() % (mod - 1200) + 505;
   for(int i = 2; i < nmax; i++)
      p[0][i] = p[0][i - 1] * p[0][1],
      p[1][i] = p[1][i - 1] * p[1][1];
      
   P = P_;
   C = C_;
   for(int i = 1; i < N; i++) {
      g[P[i]].emplace_back(i, C[i]);
      colors[P[i]].emplace(C[i]);
   }
   sol.assign(N, 0);
   dfs(0);
   
   
   return sol;
}

/**
      Töte es durch genaue Untersuchung\Töte es kann es nur noch schlimmer machen\Es lässt es irgendwie atmen
--
*/

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 48472 KB Output is correct
2 Correct 11 ms 48476 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48476 KB Output is correct
2 Correct 11 ms 48572 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 11 ms 48476 KB Output is correct
5 Correct 11 ms 48384 KB Output is correct
6 Correct 13 ms 48472 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48576 KB Output is correct
9 Correct 11 ms 48472 KB Output is correct
10 Correct 12 ms 48372 KB Output is correct
11 Correct 11 ms 48476 KB Output is correct
12 Correct 11 ms 48476 KB Output is correct
13 Correct 11 ms 48476 KB Output is correct
14 Correct 11 ms 48476 KB Output is correct
15 Correct 11 ms 48584 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48564 KB Output is correct
18 Correct 11 ms 48576 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48476 KB Output is correct
21 Correct 11 ms 48476 KB Output is correct
22 Correct 13 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48476 KB Output is correct
25 Correct 12 ms 48364 KB Output is correct
26 Correct 11 ms 48476 KB Output is correct
27 Correct 11 ms 48476 KB Output is correct
28 Correct 11 ms 48472 KB Output is correct
29 Correct 11 ms 48476 KB Output is correct
30 Correct 12 ms 48476 KB Output is correct
31 Correct 11 ms 48476 KB Output is correct
32 Correct 11 ms 48476 KB Output is correct
33 Correct 11 ms 48476 KB Output is correct
34 Correct 11 ms 48472 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48476 KB Output is correct
2 Correct 11 ms 48572 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 11 ms 48476 KB Output is correct
5 Correct 11 ms 48384 KB Output is correct
6 Correct 13 ms 48472 KB Output is correct
7 Correct 118 ms 136020 KB Output is correct
8 Correct 135 ms 136020 KB Output is correct
9 Correct 11 ms 48476 KB Output is correct
10 Correct 11 ms 48472 KB Output is correct
11 Correct 11 ms 48476 KB Output is correct
12 Correct 11 ms 48476 KB Output is correct
13 Correct 94 ms 49568 KB Output is correct
14 Correct 53 ms 49536 KB Output is correct
15 Correct 13 ms 49240 KB Output is correct
16 Correct 12 ms 49244 KB Output is correct
17 Execution timed out 2093 ms 136092 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48472 KB Output is correct
2 Correct 12 ms 48576 KB Output is correct
3 Correct 11 ms 48472 KB Output is correct
4 Correct 11 ms 48472 KB Output is correct
5 Correct 11 ms 48476 KB Output is correct
6 Correct 11 ms 48476 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48476 KB Output is correct
9 Correct 11 ms 48576 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48596 KB Output is correct
12 Correct 11 ms 48476 KB Output is correct
13 Correct 12 ms 48628 KB Output is correct
14 Correct 11 ms 48476 KB Output is correct
15 Correct 85 ms 57336 KB Output is correct
16 Correct 82 ms 56772 KB Output is correct
17 Correct 84 ms 56912 KB Output is correct
18 Correct 86 ms 57164 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48476 KB Output is correct
2 Correct 11 ms 48572 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 11 ms 48576 KB Output is correct
5 Correct 118 ms 136020 KB Output is correct
6 Correct 135 ms 136020 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48476 KB Output is correct
9 Correct 12 ms 48732 KB Output is correct
10 Correct 17 ms 48604 KB Output is correct
11 Correct 112 ms 73300 KB Output is correct
12 Correct 113 ms 64348 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 48472 KB Output is correct
2 Correct 11 ms 48476 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 12 ms 48476 KB Output is correct
5 Correct 11 ms 48572 KB Output is correct
6 Correct 11 ms 48476 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48384 KB Output is correct
9 Correct 13 ms 48472 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48576 KB Output is correct
12 Correct 11 ms 48472 KB Output is correct
13 Correct 12 ms 48372 KB Output is correct
14 Correct 11 ms 48476 KB Output is correct
15 Correct 11 ms 48476 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48476 KB Output is correct
18 Correct 11 ms 48584 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48564 KB Output is correct
21 Correct 11 ms 48576 KB Output is correct
22 Correct 11 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48476 KB Output is correct
25 Correct 13 ms 48476 KB Output is correct
26 Correct 11 ms 48476 KB Output is correct
27 Correct 11 ms 48476 KB Output is correct
28 Correct 12 ms 48364 KB Output is correct
29 Correct 11 ms 48476 KB Output is correct
30 Correct 11 ms 48476 KB Output is correct
31 Correct 11 ms 48472 KB Output is correct
32 Correct 11 ms 48476 KB Output is correct
33 Correct 12 ms 48476 KB Output is correct
34 Correct 11 ms 48476 KB Output is correct
35 Correct 11 ms 48476 KB Output is correct
36 Correct 11 ms 48476 KB Output is correct
37 Correct 11 ms 48472 KB Output is correct
38 Correct 11 ms 48476 KB Output is correct
39 Correct 11 ms 48472 KB Output is correct
40 Correct 11 ms 48476 KB Output is correct
41 Correct 11 ms 48476 KB Output is correct
42 Correct 12 ms 48472 KB Output is correct
43 Correct 12 ms 48576 KB Output is correct
44 Correct 11 ms 48472 KB Output is correct
45 Correct 11 ms 48472 KB Output is correct
46 Correct 11 ms 48476 KB Output is correct
47 Correct 11 ms 48476 KB Output is correct
48 Correct 11 ms 48476 KB Output is correct
49 Correct 11 ms 48476 KB Output is correct
50 Correct 11 ms 48576 KB Output is correct
51 Correct 11 ms 48476 KB Output is correct
52 Correct 11 ms 48476 KB Output is correct
53 Correct 11 ms 48476 KB Output is correct
54 Correct 11 ms 48472 KB Output is correct
55 Correct 11 ms 48368 KB Output is correct
56 Correct 11 ms 48476 KB Output is correct
57 Correct 11 ms 48476 KB Output is correct
58 Correct 11 ms 48608 KB Output is correct
59 Correct 11 ms 48476 KB Output is correct
60 Correct 13 ms 48476 KB Output is correct
61 Correct 11 ms 48476 KB Output is correct
62 Correct 11 ms 48576 KB Output is correct
63 Correct 11 ms 48476 KB Output is correct
64 Correct 11 ms 48472 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48476 KB Output is correct
2 Correct 11 ms 48572 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 11 ms 48576 KB Output is correct
5 Correct 11 ms 48472 KB Output is correct
6 Correct 12 ms 48372 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48476 KB Output is correct
9 Correct 11 ms 48476 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48584 KB Output is correct
12 Correct 11 ms 48476 KB Output is correct
13 Correct 11 ms 48564 KB Output is correct
14 Correct 11 ms 48576 KB Output is correct
15 Correct 11 ms 48476 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48476 KB Output is correct
18 Correct 13 ms 48476 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48476 KB Output is correct
21 Correct 12 ms 48364 KB Output is correct
22 Correct 11 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48472 KB Output is correct
25 Correct 94 ms 49548 KB Output is correct
26 Correct 55 ms 49488 KB Output is correct
27 Correct 36 ms 49500 KB Output is correct
28 Correct 14 ms 49240 KB Output is correct
29 Correct 93 ms 49500 KB Output is correct
30 Correct 20 ms 48984 KB Output is correct
31 Correct 14 ms 48880 KB Output is correct
32 Correct 13 ms 48732 KB Output is correct
33 Correct 12 ms 48728 KB Output is correct
34 Correct 15 ms 48732 KB Output is correct
35 Correct 13 ms 48732 KB Output is correct
36 Correct 12 ms 48732 KB Output is correct
37 Correct 29 ms 48984 KB Output is correct
38 Correct 24 ms 48988 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 48472 KB Output is correct
2 Correct 11 ms 48476 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 12 ms 48476 KB Output is correct
5 Correct 11 ms 48572 KB Output is correct
6 Correct 11 ms 48476 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48384 KB Output is correct
9 Correct 13 ms 48472 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48576 KB Output is correct
12 Correct 11 ms 48472 KB Output is correct
13 Correct 12 ms 48372 KB Output is correct
14 Correct 11 ms 48476 KB Output is correct
15 Correct 11 ms 48476 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48476 KB Output is correct
18 Correct 11 ms 48584 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48564 KB Output is correct
21 Correct 11 ms 48576 KB Output is correct
22 Correct 11 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48476 KB Output is correct
25 Correct 13 ms 48476 KB Output is correct
26 Correct 11 ms 48476 KB Output is correct
27 Correct 11 ms 48476 KB Output is correct
28 Correct 12 ms 48364 KB Output is correct
29 Correct 11 ms 48476 KB Output is correct
30 Correct 11 ms 48476 KB Output is correct
31 Correct 11 ms 48472 KB Output is correct
32 Correct 11 ms 48476 KB Output is correct
33 Correct 12 ms 48476 KB Output is correct
34 Correct 11 ms 48476 KB Output is correct
35 Correct 11 ms 48476 KB Output is correct
36 Correct 11 ms 48476 KB Output is correct
37 Correct 11 ms 48472 KB Output is correct
38 Correct 11 ms 48476 KB Output is correct
39 Correct 11 ms 48472 KB Output is correct
40 Correct 11 ms 48476 KB Output is correct
41 Correct 11 ms 48476 KB Output is correct
42 Correct 94 ms 49568 KB Output is correct
43 Correct 53 ms 49536 KB Output is correct
44 Correct 13 ms 49240 KB Output is correct
45 Correct 12 ms 49244 KB Output is correct
46 Correct 12 ms 48472 KB Output is correct
47 Correct 12 ms 48576 KB Output is correct
48 Correct 11 ms 48472 KB Output is correct
49 Correct 11 ms 48472 KB Output is correct
50 Correct 11 ms 48476 KB Output is correct
51 Correct 11 ms 48476 KB Output is correct
52 Correct 11 ms 48476 KB Output is correct
53 Correct 11 ms 48476 KB Output is correct
54 Correct 11 ms 48576 KB Output is correct
55 Correct 11 ms 48476 KB Output is correct
56 Correct 11 ms 48596 KB Output is correct
57 Correct 11 ms 48476 KB Output is correct
58 Correct 12 ms 48628 KB Output is correct
59 Correct 11 ms 48476 KB Output is correct
60 Correct 11 ms 48476 KB Output is correct
61 Correct 11 ms 48476 KB Output is correct
62 Correct 12 ms 48732 KB Output is correct
63 Correct 17 ms 48604 KB Output is correct
64 Correct 11 ms 48472 KB Output is correct
65 Correct 11 ms 48368 KB Output is correct
66 Correct 11 ms 48476 KB Output is correct
67 Correct 11 ms 48476 KB Output is correct
68 Correct 11 ms 48608 KB Output is correct
69 Correct 11 ms 48476 KB Output is correct
70 Correct 13 ms 48476 KB Output is correct
71 Correct 11 ms 48476 KB Output is correct
72 Correct 11 ms 48576 KB Output is correct
73 Correct 11 ms 48476 KB Output is correct
74 Correct 11 ms 48472 KB Output is correct
75 Correct 94 ms 49548 KB Output is correct
76 Correct 55 ms 49488 KB Output is correct
77 Correct 36 ms 49500 KB Output is correct
78 Correct 14 ms 49240 KB Output is correct
79 Correct 93 ms 49500 KB Output is correct
80 Correct 20 ms 48984 KB Output is correct
81 Correct 14 ms 48880 KB Output is correct
82 Correct 13 ms 48732 KB Output is correct
83 Correct 12 ms 48728 KB Output is correct
84 Correct 15 ms 48732 KB Output is correct
85 Correct 13 ms 48732 KB Output is correct
86 Correct 12 ms 48732 KB Output is correct
87 Correct 29 ms 48984 KB Output is correct
88 Correct 24 ms 48988 KB Output is correct
89 Correct 56 ms 49240 KB Output is correct
90 Correct 17 ms 48984 KB Output is correct
91 Correct 14 ms 48700 KB Output is correct
92 Correct 12 ms 48732 KB Output is correct
93 Correct 13 ms 48732 KB Output is correct
94 Correct 12 ms 48728 KB Output is correct
95 Correct 12 ms 48732 KB Output is correct
96 Correct 12 ms 48732 KB Output is correct
97 Correct 30 ms 49008 KB Output is correct
98 Correct 21 ms 48984 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 48476 KB Output is correct
2 Correct 11 ms 48572 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 11 ms 48576 KB Output is correct
5 Correct 11 ms 48472 KB Output is correct
6 Correct 12 ms 48372 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48476 KB Output is correct
9 Correct 11 ms 48476 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48584 KB Output is correct
12 Correct 11 ms 48476 KB Output is correct
13 Correct 11 ms 48564 KB Output is correct
14 Correct 11 ms 48576 KB Output is correct
15 Correct 11 ms 48476 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48476 KB Output is correct
18 Correct 13 ms 48476 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48476 KB Output is correct
21 Correct 12 ms 48364 KB Output is correct
22 Correct 11 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48472 KB Output is correct
25 Correct 94 ms 49548 KB Output is correct
26 Correct 55 ms 49488 KB Output is correct
27 Correct 36 ms 49500 KB Output is correct
28 Correct 14 ms 49240 KB Output is correct
29 Correct 93 ms 49500 KB Output is correct
30 Correct 20 ms 48984 KB Output is correct
31 Correct 14 ms 48880 KB Output is correct
32 Correct 13 ms 48732 KB Output is correct
33 Correct 12 ms 48728 KB Output is correct
34 Correct 15 ms 48732 KB Output is correct
35 Correct 13 ms 48732 KB Output is correct
36 Correct 12 ms 48732 KB Output is correct
37 Correct 29 ms 48984 KB Output is correct
38 Correct 24 ms 48988 KB Output is correct
39 Execution timed out 2033 ms 136284 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 48472 KB Output is correct
2 Correct 11 ms 48476 KB Output is correct
3 Correct 11 ms 48476 KB Output is correct
4 Correct 12 ms 48476 KB Output is correct
5 Correct 11 ms 48572 KB Output is correct
6 Correct 11 ms 48476 KB Output is correct
7 Correct 11 ms 48476 KB Output is correct
8 Correct 11 ms 48384 KB Output is correct
9 Correct 13 ms 48472 KB Output is correct
10 Correct 11 ms 48476 KB Output is correct
11 Correct 11 ms 48576 KB Output is correct
12 Correct 11 ms 48472 KB Output is correct
13 Correct 12 ms 48372 KB Output is correct
14 Correct 11 ms 48476 KB Output is correct
15 Correct 11 ms 48476 KB Output is correct
16 Correct 11 ms 48476 KB Output is correct
17 Correct 11 ms 48476 KB Output is correct
18 Correct 11 ms 48584 KB Output is correct
19 Correct 11 ms 48476 KB Output is correct
20 Correct 11 ms 48564 KB Output is correct
21 Correct 11 ms 48576 KB Output is correct
22 Correct 11 ms 48476 KB Output is correct
23 Correct 11 ms 48476 KB Output is correct
24 Correct 11 ms 48476 KB Output is correct
25 Correct 13 ms 48476 KB Output is correct
26 Correct 11 ms 48476 KB Output is correct
27 Correct 11 ms 48476 KB Output is correct
28 Correct 12 ms 48364 KB Output is correct
29 Correct 11 ms 48476 KB Output is correct
30 Correct 11 ms 48476 KB Output is correct
31 Correct 11 ms 48472 KB Output is correct
32 Correct 11 ms 48476 KB Output is correct
33 Correct 12 ms 48476 KB Output is correct
34 Correct 11 ms 48476 KB Output is correct
35 Correct 11 ms 48476 KB Output is correct
36 Correct 11 ms 48476 KB Output is correct
37 Correct 11 ms 48472 KB Output is correct
38 Correct 118 ms 136020 KB Output is correct
39 Correct 135 ms 136020 KB Output is correct
40 Correct 11 ms 48476 KB Output is correct
41 Correct 11 ms 48472 KB Output is correct
42 Correct 11 ms 48476 KB Output is correct
43 Correct 11 ms 48476 KB Output is correct
44 Correct 94 ms 49568 KB Output is correct
45 Correct 53 ms 49536 KB Output is correct
46 Correct 13 ms 49240 KB Output is correct
47 Correct 12 ms 49244 KB Output is correct
48 Execution timed out 2093 ms 136092 KB Time limit exceeded
49 Halted 0 ms 0 KB -