oj.uz

Submission #1057499

# Submission time Handle Problem Language Result Execution time Memory
1057499 2024-08-13T20:40:01 Z mychecksedad Radio Towers (IOI22_towers) C++17
100 / 100
 915 ms 64996 KB 
#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define en cout << '\n'
#define pii pair<int,int>
#define vi vector<int> 
#define ff first
#define ss second
const int N = 300005, K = 20;

struct Node{
  Node *L, *R;
  int sum, mostleft, mostright;
  Node(){
    L=R=nullptr;
    sum=0;
    mostleft=mostright=0;
  }
  Node(Node*l, Node*r): L(l), R(r){
    sum = 0;
    mostleft = 100000000;
    mostright = -1;
    if(l != nullptr) sum += l->sum, mostleft = min(mostleft, l->mostleft), mostright = max(mostright, l->mostright);
    if(r != nullptr) sum += r->sum, mostleft = min(mostleft, r->mostleft), mostright = max(mostright, r->mostright);
  }
  Node(int s, int pos): sum(s){
    if(s == 1)
      mostleft = mostright = pos;
    else 
      mostleft = 100000000, mostright = -1;
    L=R=nullptr;
  }
};
vector<bool> is_peak(300005);

Node *build(int l, int r){
  if(l == r){
    return new Node(is_peak[l], l);
  }
  int m = l+r>>1;
  return new Node(build(l, m), build(m+1, r));
}

Node *upd(Node *v, int l, int r, int p, int val){
  if(l == r){
    return new Node(val, l);
  }
  int m = l+r>>1;
  if(p <= m) return new Node(upd(v->L, l, m, p, val), v->R);
  return new Node(v->L, upd(v->R, m+1, r, p, val));
}

array<int, 3> get(Node *v, int l, int r, int ql, int qr){
  if(ql > r || l > qr) return {0, 100000000, -1};
  if(ql <= l && r <= qr){
    return {v->sum, v->mostleft, v->mostright};
  }
  int m = l+r>>1;

  auto x = get(v->L, l, m, ql, qr);
  auto y = get(v->R, m+1, r, ql, qr);
  return {x[0] + y[0], min(x[1], y[1]), max(x[2], y[2])};
}
int rmq[N][K];
int getmin(int l, int r){
  int k = int(log2(r-l+1));
  return min(rmq[l][k], rmq[r-(1<<k)+1][k]);
}

void op(vector<int> &a, vector<int> &A, vector<int> &B){
  if(a.size() <= 1){
    A = a;
    B.pb(0);
    return;
  }
  A.pb(a[0]);
  A.pb(a[1]);
  B.pb(0);
  B.pb(1);
  for(int i = 2; i < a.size(); ++i){
    if(a[i] > A.back() && A.back() > A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else if(a[i] < A.back() && A.back() < A[int(A.size()) - 2]){
      A.pop_back();
      B.pop_back();
      A.pb(a[i]);
      B.pb(i);
    }else{
      A.pb(a[i]);
      B.pb(i);
    }
  }
  
}
int n;
vector<int> A, B, a;
vector<pair<int, int>> ans;
vector<pair<int, Node*>> roots;
void init(int nn, vector<int> aa) { n=nn;a=aa;
  if(n == 1) return;
  op(a, A, B);

  for(int i = 0; i < n; ++i) rmq[i][0] = a[i];
  for(int j = 1; j < K; ++j){
    for(int i = 0; i + (1<<j) <= n; ++i){
      rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1<<(j-1))][j - 1]);
    }
  }

  if(A[0] > A[1]) A.erase(A.begin()), B.erase(B.begin());
  if(A.size()==1) return;
  if(A.back() > A[A.size() - 2]) A.pop_back(), B.pop_back();
  if(A.size()==1) return;

  set<array<int, 3>> S;
  priority_queue<array<int, 3>> Q;

  int m = A.size();
  for(int i = 0; i < m; ++i){
    S.insert({i, A[i], B[i]});
    if(i%2) is_peak[B[i]] = 1;
    if(i + 1 < m && A[i + 1] > A[i]) Q.push({-(A[i + 1] - A[i]), i, i + 1});
    if(i > 0 && A[i - 1] > A[i]) Q.push({-(A[i - 1] - A[i]), i, i - 1});
  }
  roots.pb({0, build(0, n - 1)});

  ans.pb({0, A.size() / 2 + 1});

  vector<bool> rem(A.size());
  while(!Q.empty()){
    auto V = Q.top();
    int v = V[1], u = V[2];
    int val = V[0];
    Q.pop();
    if(rem[u] || rem[v]) continue;
    S.erase({v, A[v], B[v]});
    S.erase({u, A[u], B[u]});
    rem[u] = rem[v] = 1;
    int mx = max(u, v);
    auto it = S.lower_bound(array<int,3>{mx, -1, -1});
    if(it != S.begin() && it != S.end()){
      auto it2 = prev(it);
      auto x = *it;
      auto y = *it2;
      Q.push({-abs(x[1] - y[1]), x[0], y[0]});
    }
    if(ans.back().ff == -val){
      roots.back().ss = upd(roots.back().ss, 0, n - 1, (A[v] > A[u] ? B[v] : B[u]), 0);
      ans.back().ss = S.size() / 2 + 1;
    }else{
      roots.pb({-val, upd(roots.back().ss, 0, n - 1, (A[v] > A[u] ? B[v] : B[u]), 0)});
      ans.pb({-val, S.size() / 2 + 1});
    }
  }

}

int max_towers(int L, int R, int D) {
  if(n == 1 || L == R || A.size() == 1) return 1;
  int pos = upper_bound(all(ans), pii{D, -1}) - ans.begin() - 1;
  if(pos == ans.size()) return 1;
  auto F = get(roots[pos].ss, 0, n - 1, L, R);
  int l = F[1], r = F[2], cur = F[0];
  if(cur == 0) return 1;
  if(L < l){
    cur += getmin(L, l-1) <= a[F[1]] - D;
  }
  if(r < R){
    cur += getmin(r + 1, R) <= a[F[2]] - D;
  }
  return max(1, cur - 1);
    // if(D==1) return ans[0].ss;
  // return max(pos == ans.size() ? 1 : ans[pos].ss, 1);
}

Compilation message

towers.cpp: In function 'Node* build(int, int)':
towers.cpp:43:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'Node* upd(Node*, int, int, int, int)':
towers.cpp:51:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'std::array<int, 3> get(Node*, int, int, int, int)':
towers.cpp:61:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |   int m = l+r>>1;
      |           ~^~
towers.cpp: In function 'void op(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
towers.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   for(int i = 2; i < a.size(); ++i){
      |                  ~~^~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:167:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |   if(pos == ans.size()) return 1;
      |      ~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 12888 KB Output is correct
2 Correct 584 ms 19288 KB Output is correct
3 Correct 543 ms 19308 KB Output is correct
4 Correct 466 ms 9816 KB Output is correct
5 Correct 397 ms 9844 KB Output is correct
6 Correct 643 ms 19308 KB Output is correct
7 Correct 525 ms 9816 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 2 ms 1368 KB Output is correct
7 Correct 2 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1368 KB Output is correct
17 Correct 2 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1368 KB Output is correct
22 Correct 2 ms 1368 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 2 ms 1368 KB Output is correct
7 Correct 2 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1368 KB Output is correct
17 Correct 2 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1368 KB Output is correct
22 Correct 2 ms 1368 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 50 ms 32548 KB Output is correct
37 Correct 85 ms 49716 KB Output is correct
38 Correct 94 ms 49592 KB Output is correct
39 Correct 121 ms 64492 KB Output is correct
40 Correct 126 ms 64572 KB Output is correct
41 Correct 125 ms 64748 KB Output is correct
42 Correct 119 ms 64740 KB Output is correct
43 Correct 10 ms 9816 KB Output is correct
44 Correct 10 ms 9944 KB Output is correct
45 Correct 15 ms 19288 KB Output is correct
46 Correct 15 ms 19248 KB Output is correct
47 Correct 88 ms 49664 KB Output is correct
48 Correct 128 ms 64520 KB Output is correct
49 Correct 124 ms 64492 KB Output is correct
50 Correct 10 ms 9816 KB Output is correct
51 Correct 15 ms 19308 KB Output is correct
52 Correct 83 ms 49600 KB Output is correct
53 Correct 121 ms 64492 KB Output is correct
54 Correct 137 ms 64748 KB Output is correct
55 Correct 10 ms 9816 KB Output is correct
56 Correct 20 ms 19420 KB Output is correct
57 Correct 84 ms 48052 KB Output is correct
58 Correct 83 ms 49644 KB Output is correct
59 Correct 86 ms 49652 KB Output is correct
60 Correct 122 ms 64640 KB Output is correct
61 Correct 136 ms 64660 KB Output is correct
62 Correct 135 ms 64492 KB Output is correct
63 Correct 123 ms 64504 KB Output is correct
64 Correct 10 ms 9816 KB Output is correct
65 Correct 10 ms 9944 KB Output is correct
66 Correct 15 ms 19300 KB Output is correct
67 Correct 15 ms 19288 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 49440 KB Output is correct
2 Correct 662 ms 49572 KB Output is correct
3 Correct 701 ms 49648 KB Output is correct
4 Correct 690 ms 64492 KB Output is correct
5 Correct 710 ms 64492 KB Output is correct
6 Correct 725 ms 64492 KB Output is correct
7 Correct 756 ms 64492 KB Output is correct
8 Correct 508 ms 9812 KB Output is correct
9 Correct 469 ms 9816 KB Output is correct
10 Correct 591 ms 19288 KB Output is correct
11 Correct 622 ms 19280 KB Output is correct
12 Correct 582 ms 19288 KB Output is correct
13 Correct 469 ms 9816 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 86 ms 49712 KB Output is correct
18 Correct 143 ms 64632 KB Output is correct
19 Correct 123 ms 64744 KB Output is correct
20 Correct 10 ms 9816 KB Output is correct
21 Correct 15 ms 19312 KB Output is correct
22 Correct 90 ms 49648 KB Output is correct
23 Correct 128 ms 64496 KB Output is correct
24 Correct 121 ms 64572 KB Output is correct
25 Correct 10 ms 9816 KB Output is correct
26 Correct 22 ms 19280 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 2 ms 1368 KB Output is correct
34 Correct 1 ms 1368 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 0 ms 600 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 11608 KB Output is correct
2 Correct 633 ms 49644 KB Output is correct
3 Correct 616 ms 49756 KB Output is correct
4 Correct 653 ms 64660 KB Output is correct
5 Correct 649 ms 64748 KB Output is correct
6 Correct 665 ms 64732 KB Output is correct
7 Correct 668 ms 64748 KB Output is correct
8 Correct 492 ms 9816 KB Output is correct
9 Correct 514 ms 10036 KB Output is correct
10 Correct 541 ms 19288 KB Output is correct
11 Correct 525 ms 19288 KB Output is correct
12 Correct 88 ms 49640 KB Output is correct
13 Correct 122 ms 64492 KB Output is correct
14 Correct 142 ms 64616 KB Output is correct
15 Correct 16 ms 9816 KB Output is correct
16 Correct 15 ms 19168 KB Output is correct
17 Correct 81 ms 47924 KB Output is correct
18 Correct 91 ms 49640 KB Output is correct
19 Correct 86 ms 49664 KB Output is correct
20 Correct 120 ms 64660 KB Output is correct
21 Correct 122 ms 64672 KB Output is correct
22 Correct 123 ms 64752 KB Output is correct
23 Correct 118 ms 64744 KB Output is correct
24 Correct 10 ms 9816 KB Output is correct
25 Correct 10 ms 9816 KB Output is correct
26 Correct 15 ms 19280 KB Output is correct
27 Correct 18 ms 19284 KB Output is correct
28 Correct 2 ms 1112 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 2 ms 1108 KB Output is correct
36 Correct 2 ms 1368 KB Output is correct
37 Correct 2 ms 1368 KB Output is correct
38 Correct 2 ms 1368 KB Output is correct
39 Correct 1 ms 1368 KB Output is correct
40 Correct 0 ms 600 KB Output is correct
41 Correct 0 ms 600 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 0 ms 600 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 1 ms 1368 KB Output is correct
6 Correct 2 ms 1368 KB Output is correct
7 Correct 2 ms 1368 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1368 KB Output is correct
17 Correct 2 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1368 KB Output is correct
22 Correct 2 ms 1368 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1368 KB Output is correct
29 Correct 1 ms 1368 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 50 ms 32548 KB Output is correct
37 Correct 85 ms 49716 KB Output is correct
38 Correct 94 ms 49592 KB Output is correct
39 Correct 121 ms 64492 KB Output is correct
40 Correct 126 ms 64572 KB Output is correct
41 Correct 125 ms 64748 KB Output is correct
42 Correct 119 ms 64740 KB Output is correct
43 Correct 10 ms 9816 KB Output is correct
44 Correct 10 ms 9944 KB Output is correct
45 Correct 15 ms 19288 KB Output is correct
46 Correct 15 ms 19248 KB Output is correct
47 Correct 88 ms 49664 KB Output is correct
48 Correct 128 ms 64520 KB Output is correct
49 Correct 124 ms 64492 KB Output is correct
50 Correct 10 ms 9816 KB Output is correct
51 Correct 15 ms 19308 KB Output is correct
52 Correct 83 ms 49600 KB Output is correct
53 Correct 121 ms 64492 KB Output is correct
54 Correct 137 ms 64748 KB Output is correct
55 Correct 10 ms 9816 KB Output is correct
56 Correct 20 ms 19420 KB Output is correct
57 Correct 84 ms 48052 KB Output is correct
58 Correct 83 ms 49644 KB Output is correct
59 Correct 86 ms 49652 KB Output is correct
60 Correct 122 ms 64640 KB Output is correct
61 Correct 136 ms 64660 KB Output is correct
62 Correct 135 ms 64492 KB Output is correct
63 Correct 123 ms 64504 KB Output is correct
64 Correct 10 ms 9816 KB Output is correct
65 Correct 10 ms 9944 KB Output is correct
66 Correct 15 ms 19300 KB Output is correct
67 Correct 15 ms 19288 KB Output is correct
68 Correct 513 ms 49440 KB Output is correct
69 Correct 662 ms 49572 KB Output is correct
70 Correct 701 ms 49648 KB Output is correct
71 Correct 690 ms 64492 KB Output is correct
72 Correct 710 ms 64492 KB Output is correct
73 Correct 725 ms 64492 KB Output is correct
74 Correct 756 ms 64492 KB Output is correct
75 Correct 508 ms 9812 KB Output is correct
76 Correct 469 ms 9816 KB Output is correct
77 Correct 591 ms 19288 KB Output is correct
78 Correct 622 ms 19280 KB Output is correct
79 Correct 582 ms 19288 KB Output is correct
80 Correct 469 ms 9816 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 600 KB Output is correct
83 Correct 0 ms 600 KB Output is correct
84 Correct 86 ms 49712 KB Output is correct
85 Correct 143 ms 64632 KB Output is correct
86 Correct 123 ms 64744 KB Output is correct
87 Correct 10 ms 9816 KB Output is correct
88 Correct 15 ms 19312 KB Output is correct
89 Correct 90 ms 49648 KB Output is correct
90 Correct 128 ms 64496 KB Output is correct
91 Correct 121 ms 64572 KB Output is correct
92 Correct 10 ms 9816 KB Output is correct
93 Correct 22 ms 19280 KB Output is correct
94 Correct 2 ms 1112 KB Output is correct
95 Correct 1 ms 1368 KB Output is correct
96 Correct 1 ms 1368 KB Output is correct
97 Correct 0 ms 600 KB Output is correct
98 Correct 1 ms 600 KB Output is correct
99 Correct 2 ms 1112 KB Output is correct
100 Correct 2 ms 1368 KB Output is correct
101 Correct 1 ms 1368 KB Output is correct
102 Correct 0 ms 600 KB Output is correct
103 Correct 0 ms 600 KB Output is correct
104 Correct 590 ms 44596 KB Output is correct
105 Correct 675 ms 49644 KB Output is correct
106 Correct 697 ms 49816 KB Output is correct
107 Correct 723 ms 64492 KB Output is correct
108 Correct 750 ms 64492 KB Output is correct
109 Correct 752 ms 64744 KB Output is correct
110 Correct 724 ms 64744 KB Output is correct
111 Correct 512 ms 9816 KB Output is correct
112 Correct 500 ms 9816 KB Output is correct
113 Correct 609 ms 19288 KB Output is correct
114 Correct 575 ms 19288 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 12888 KB Output is correct
2 Correct 584 ms 19288 KB Output is correct
3 Correct 543 ms 19308 KB Output is correct
4 Correct 466 ms 9816 KB Output is correct
5 Correct 397 ms 9844 KB Output is correct
6 Correct 643 ms 19308 KB Output is correct
7 Correct 525 ms 9816 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 2 ms 1368 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 2 ms 1368 KB Output is correct
17 Correct 2 ms 1368 KB Output is correct
18 Correct 0 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 1112 KB Output is correct
26 Correct 1 ms 1368 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1368 KB Output is correct
32 Correct 2 ms 1368 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 1112 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 1 ms 1368 KB Output is correct
39 Correct 1 ms 1368 KB Output is correct
40 Correct 2 ms 1368 KB Output is correct
41 Correct 2 ms 1368 KB Output is correct
42 Correct 0 ms 600 KB Output is correct
43 Correct 0 ms 600 KB Output is correct
44 Correct 1 ms 600 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 50 ms 32548 KB Output is correct
47 Correct 85 ms 49716 KB Output is correct
48 Correct 94 ms 49592 KB Output is correct
49 Correct 121 ms 64492 KB Output is correct
50 Correct 126 ms 64572 KB Output is correct
51 Correct 125 ms 64748 KB Output is correct
52 Correct 119 ms 64740 KB Output is correct
53 Correct 10 ms 9816 KB Output is correct
54 Correct 10 ms 9944 KB Output is correct
55 Correct 15 ms 19288 KB Output is correct
56 Correct 15 ms 19248 KB Output is correct
57 Correct 88 ms 49664 KB Output is correct
58 Correct 128 ms 64520 KB Output is correct
59 Correct 124 ms 64492 KB Output is correct
60 Correct 10 ms 9816 KB Output is correct
61 Correct 15 ms 19308 KB Output is correct
62 Correct 83 ms 49600 KB Output is correct
63 Correct 121 ms 64492 KB Output is correct
64 Correct 137 ms 64748 KB Output is correct
65 Correct 10 ms 9816 KB Output is correct
66 Correct 20 ms 19420 KB Output is correct
67 Correct 84 ms 48052 KB Output is correct
68 Correct 83 ms 49644 KB Output is correct
69 Correct 86 ms 49652 KB Output is correct
70 Correct 122 ms 64640 KB Output is correct
71 Correct 136 ms 64660 KB Output is correct
72 Correct 135 ms 64492 KB Output is correct
73 Correct 123 ms 64504 KB Output is correct
74 Correct 10 ms 9816 KB Output is correct
75 Correct 10 ms 9944 KB Output is correct
76 Correct 15 ms 19300 KB Output is correct
77 Correct 15 ms 19288 KB Output is correct
78 Correct 513 ms 49440 KB Output is correct
79 Correct 662 ms 49572 KB Output is correct
80 Correct 701 ms 49648 KB Output is correct
81 Correct 690 ms 64492 KB Output is correct
82 Correct 710 ms 64492 KB Output is correct
83 Correct 725 ms 64492 KB Output is correct
84 Correct 756 ms 64492 KB Output is correct
85 Correct 508 ms 9812 KB Output is correct
86 Correct 469 ms 9816 KB Output is correct
87 Correct 591 ms 19288 KB Output is correct
88 Correct 622 ms 19280 KB Output is correct
89 Correct 582 ms 19288 KB Output is correct
90 Correct 469 ms 9816 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 600 KB Output is correct
93 Correct 0 ms 600 KB Output is correct
94 Correct 86 ms 49712 KB Output is correct
95 Correct 143 ms 64632 KB Output is correct
96 Correct 123 ms 64744 KB Output is correct
97 Correct 10 ms 9816 KB Output is correct
98 Correct 15 ms 19312 KB Output is correct
99 Correct 90 ms 49648 KB Output is correct
100 Correct 128 ms 64496 KB Output is correct
101 Correct 121 ms 64572 KB Output is correct
102 Correct 10 ms 9816 KB Output is correct
103 Correct 22 ms 19280 KB Output is correct
104 Correct 2 ms 1112 KB Output is correct
105 Correct 1 ms 1368 KB Output is correct
106 Correct 1 ms 1368 KB Output is correct
107 Correct 0 ms 600 KB Output is correct
108 Correct 1 ms 600 KB Output is correct
109 Correct 2 ms 1112 KB Output is correct
110 Correct 2 ms 1368 KB Output is correct
111 Correct 1 ms 1368 KB Output is correct
112 Correct 0 ms 600 KB Output is correct
113 Correct 0 ms 600 KB Output is correct
114 Correct 166 ms 11608 KB Output is correct
115 Correct 633 ms 49644 KB Output is correct
116 Correct 616 ms 49756 KB Output is correct
117 Correct 653 ms 64660 KB Output is correct
118 Correct 649 ms 64748 KB Output is correct
119 Correct 665 ms 64732 KB Output is correct
120 Correct 668 ms 64748 KB Output is correct
121 Correct 492 ms 9816 KB Output is correct
122 Correct 514 ms 10036 KB Output is correct
123 Correct 541 ms 19288 KB Output is correct
124 Correct 525 ms 19288 KB Output is correct
125 Correct 88 ms 49640 KB Output is correct
126 Correct 122 ms 64492 KB Output is correct
127 Correct 142 ms 64616 KB Output is correct
128 Correct 16 ms 9816 KB Output is correct
129 Correct 15 ms 19168 KB Output is correct
130 Correct 81 ms 47924 KB Output is correct
131 Correct 91 ms 49640 KB Output is correct
132 Correct 86 ms 49664 KB Output is correct
133 Correct 120 ms 64660 KB Output is correct
134 Correct 122 ms 64672 KB Output is correct
135 Correct 123 ms 64752 KB Output is correct
136 Correct 118 ms 64744 KB Output is correct
137 Correct 10 ms 9816 KB Output is correct
138 Correct 10 ms 9816 KB Output is correct
139 Correct 15 ms 19280 KB Output is correct
140 Correct 18 ms 19284 KB Output is correct
141 Correct 2 ms 1112 KB Output is correct
142 Correct 1 ms 1368 KB Output is correct
143 Correct 2 ms 1368 KB Output is correct
144 Correct 1 ms 600 KB Output is correct
145 Correct 1 ms 600 KB Output is correct
146 Correct 1 ms 600 KB Output is correct
147 Correct 1 ms 1112 KB Output is correct
148 Correct 2 ms 1108 KB Output is correct
149 Correct 2 ms 1368 KB Output is correct
150 Correct 2 ms 1368 KB Output is correct
151 Correct 2 ms 1368 KB Output is correct
152 Correct 1 ms 1368 KB Output is correct
153 Correct 0 ms 600 KB Output is correct
154 Correct 0 ms 600 KB Output is correct
155 Correct 1 ms 600 KB Output is correct
156 Correct 0 ms 600 KB Output is correct
157 Correct 590 ms 44596 KB Output is correct
158 Correct 675 ms 49644 KB Output is correct
159 Correct 697 ms 49816 KB Output is correct
160 Correct 723 ms 64492 KB Output is correct
161 Correct 750 ms 64492 KB Output is correct
162 Correct 752 ms 64744 KB Output is correct
163 Correct 724 ms 64744 KB Output is correct
164 Correct 512 ms 9816 KB Output is correct
165 Correct 500 ms 9816 KB Output is correct
166 Correct 609 ms 19288 KB Output is correct
167 Correct 575 ms 19288 KB Output is correct
168 Correct 0 ms 344 KB Output is correct
169 Correct 452 ms 17980 KB Output is correct
170 Correct 824 ms 49388 KB Output is correct
171 Correct 844 ms 49644 KB Output is correct
172 Correct 915 ms 64996 KB Output is correct
173 Correct 849 ms 64720 KB Output is correct
174 Correct 911 ms 64492 KB Output is correct
175 Correct 913 ms 64508 KB Output is correct
176 Correct 556 ms 9844 KB Output is correct
177 Correct 512 ms 9848 KB Output is correct
178 Correct 606 ms 19284 KB Output is correct
179 Correct 625 ms 19288 KB Output is correct