oj.uz

Submission #564862

# Submission time Handle Problem Language Result Execution time Memory
564862 2022-05-19T20:26:55 Z farhan132 Event Hopping 2 (JOI21_event2) C++17
100 / 100
 396 ms 52768 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
//const int inf = numeric_limits<int>::max()-1;
const int inf = 1e9;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e5 + 5;

struct seg_tree{

  struct typo{
    ii p;
    void setup(ll n){
      p = {n, 0};
    }
  };

  vector < typo > b;
  ll n;

  void init(ll l, ll r, ll node){
    b[node].setup(n);
    return;
  }

  typo merge(typo a, typo b){
    typo c;
    c.p = min(a.p , b.p);
    return c;
  }

  void build(ll l, ll r, ll node){
    if(l == r){
      init(l,r,node);
      return;
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    build(l, mid , n1);
    build(mid+1, r, n2);
    b[node] = merge(b[n1] , b[n2]);
    return;
  }

  void build(ll _n){
    n = _n;
    b.resize(4*n);
    build(1,n,1); // optional
  }

  void up(ll l, ll r, ll node, ll x, ll y, ii v){
    if(y < l || x > r) return;
    if(x <= l && y >= r){
      b[node].p = min(b[node].p, v);
      return;
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    up(l , mid , n1 , x , y , v);
    up(mid + 1, r, n2, x, y , v);
    b[node] = merge(b[n1] , b[n2]);
    return;
  }

  void up(ll x, ii v){
    up(1,n,1,x,x,v);
    return;
  }
  
  typo get(ll l, ll r, ll node, ll x, ll y){
    if(y < l || x > r) return {{n, 0}};
    if(x <= l && y >= r){
      return b[node];
    }
    ll mid = (l + r)/2;
    ll n1 = 2*node;
    ll n2 = n1 + 1;
    return merge(get(l , mid , n1 , x , y) , get(mid + 1, r , n2 , x , y));
  }

  ll get(ll l, ll r){
    return get(1,n,1,l,r).p.ss;
  }

  /* Final Check!!!
     1. Typo, Okay?
     2. Init Okay? (Build!!)
     3. Merge, Okay?
     4. Lazy Needed ? YES | NO (if NO, REMOVE anything related to lazy prop)
     5. Dummy?
     6. Check Update, Get, etc function's Merge, Lazy Prop , Init :D
     7, Even after a WA, check for possible Out Of Bound/MLE/RE cases
  */

}T;



ll par[20][N];
ll l[N], r[N];

ll range(ll x, ll y){
  if(y < x) return 0;
  ll ans = 0;
  auto cur = T.get(x, y);
  if(!cur || r[cur] > y) return 0;
  ans++;
  for(ll i = 19; i >= 0; i--){
    if(r[par[i][cur]] <= y) ans += (1 << i), cur = par[i][cur];    
  }
  return ans;
}

void solve(){

  ll n , k;
  cin >> n >> k;

  vector < tuple < ll , ll , ll > > v;
  vector < ll > idx;

  for(ll i = 1; i <= n; i++){
    cin >> l[i] >> r[i];
    r[i]--;
    idx.pb(l[i]);
    idx.pb(r[i]);
    idx.pb(r[i]+1);
  }

  idx.pb(1e9 + 10);
  sort(idx.begin(), idx.end());
  idx.erase(unique(idx.begin(), idx.end()), idx.end());
  ll m = idx.size();
  T.build(m);
  l[n+1] = r[n+1] = 1e9 + 10;
  for(ll i = 1; i <= n+1; i++){
    l[i] = lower_bound(idx.begin(), idx.end(), l[i]) - idx.begin() + 1;
    r[i] = lower_bound(idx.begin(), idx.end(), r[i]) - idx.begin() + 1;
    if(i == n + 1) continue;
    v.pb({l[i], 1, i});
    v.pb({r[i]+1, 0, i});
    T.up(l[i], {r[i], i});
  }


  sort(v.rbegin(), v.rend());

  par[0][n+1] = n + 1;
  set < ii > s; s.in({r[n+1], n+1});

  for(auto [val, t, i] : v){
    if(t) s.in({r[i] , i});
    else{
      par[0][i] = (*s.begin()).ss;
    }
  }
  set < tuple < ll , ll , ll > > t;

  for(ll i = 1; i < 20; i++){
    for(ll j = 1; j <= n+1; j++){
      par[i][j] = par[i-1][par[i-1][j]];
    }
  }
  ll ans = 1; 
  s.clear();
  auto cur = T.get(1, m);
  for(ll i = 19; i >= 0; i--){
    if(r[par[i][cur]] < m) ans += (1 << i), cur = par[i][cur];    
  }

  if(ans < k){
    cout << "-1\n"; return;
  }
  s.in({1, m-1});
  vector < ll > res;
  for(ll i = 1; i <= n; i++){
    auto pp = s.upper_bound({l[i], 1e9});
    if(pp == s.begin()) continue;
    pp--;
    auto [L , R] = *pp;
    if(!(L <= l[i] && r[i] <= R)) continue;
    ans += range(L, l[i]-1) + range(r[i]+1, R) - range(L, R) + 1;
    if(ans < k){
      ans -= range(L, l[i]-1) + range(r[i]+1, R) - range(L, R) + 1;
      continue;
    }

    s.erase({L, R});
    if(L <= l[i]-1) s.in({L, l[i]-1});
    if(r[i]+1 <= R) s.in({r[i]+1, R});
    res.pb(i); 
  }
  while(res.size() > k) res.pop_back();
  for(auto u : res) cout << u << '\n';

  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

event2.cpp: In function 'void solve()':
event2.cpp:255:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  255 |   while(res.size() > k) res.pop_back();
      |         ~~~~~~~~~~~^~~
event2.cpp: In function 'int main()':
event2.cpp:272:15: warning: unused variable 'CT' [-Wunused-variable]
  272 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 221 ms 50660 KB Output is correct
5 Correct 231 ms 52688 KB Output is correct
6 Correct 224 ms 52648 KB Output is correct
7 Correct 222 ms 52656 KB Output is correct
8 Correct 227 ms 52644 KB Output is correct
9 Correct 223 ms 52612 KB Output is correct
10 Correct 226 ms 52624 KB Output is correct
11 Correct 230 ms 52636 KB Output is correct
12 Correct 177 ms 51892 KB Output is correct
13 Correct 178 ms 51844 KB Output is correct
14 Correct 185 ms 51776 KB Output is correct
15 Correct 176 ms 51880 KB Output is correct
16 Correct 126 ms 51632 KB Output is correct
17 Correct 125 ms 51644 KB Output is correct
18 Correct 124 ms 51592 KB Output is correct
19 Correct 120 ms 51528 KB Output is correct
20 Correct 115 ms 51508 KB Output is correct
21 Correct 112 ms 51536 KB Output is correct
22 Correct 122 ms 51512 KB Output is correct
23 Correct 123 ms 51580 KB Output is correct
24 Correct 124 ms 51508 KB Output is correct
25 Correct 131 ms 51496 KB Output is correct
26 Correct 135 ms 51512 KB Output is correct
27 Correct 135 ms 51508 KB Output is correct
28 Correct 95 ms 51548 KB Output is correct
29 Correct 96 ms 51520 KB Output is correct
30 Correct 101 ms 51516 KB Output is correct
31 Correct 108 ms 51584 KB Output is correct
32 Correct 120 ms 51636 KB Output is correct
33 Correct 130 ms 51576 KB Output is correct
34 Correct 171 ms 51756 KB Output is correct
35 Correct 171 ms 51632 KB Output is correct
36 Correct 176 ms 51644 KB Output is correct
37 Correct 167 ms 51840 KB Output is correct
38 Correct 173 ms 51756 KB Output is correct
39 Correct 171 ms 51764 KB Output is correct
40 Correct 172 ms 51776 KB Output is correct
41 Correct 171 ms 51828 KB Output is correct
42 Correct 118 ms 51504 KB Output is correct
43 Correct 189 ms 51848 KB Output is correct
44 Correct 184 ms 51748 KB Output is correct
45 Correct 187 ms 51728 KB Output is correct
46 Correct 181 ms 51776 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 472 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 472 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 5 ms 2004 KB Output is correct
29 Correct 6 ms 2016 KB Output is correct
30 Correct 5 ms 2004 KB Output is correct
31 Correct 5 ms 2012 KB Output is correct
32 Correct 5 ms 2004 KB Output is correct
33 Correct 5 ms 2004 KB Output is correct
34 Correct 5 ms 2004 KB Output is correct
35 Correct 8 ms 2040 KB Output is correct
36 Correct 8 ms 2004 KB Output is correct
37 Correct 7 ms 2004 KB Output is correct
38 Correct 4 ms 2004 KB Output is correct
39 Correct 7 ms 2004 KB Output is correct
40 Correct 8 ms 2004 KB Output is correct
41 Correct 7 ms 2052 KB Output is correct
42 Correct 4 ms 2008 KB Output is correct
43 Correct 5 ms 2012 KB Output is correct
44 Correct 5 ms 2004 KB Output is correct
45 Correct 5 ms 1976 KB Output is correct
46 Correct 4 ms 2012 KB Output is correct
47 Correct 5 ms 2004 KB Output is correct
48 Correct 5 ms 2004 KB Output is correct
49 Correct 4 ms 2008 KB Output is correct
50 Correct 4 ms 1972 KB Output is correct
51 Correct 5 ms 2004 KB Output is correct
52 Correct 5 ms 2012 KB Output is correct
53 Correct 5 ms 2012 KB Output is correct
54 Correct 4 ms 2004 KB Output is correct
55 Correct 5 ms 1748 KB Output is correct
56 Correct 5 ms 1752 KB Output is correct
57 Correct 6 ms 1748 KB Output is correct
58 Correct 5 ms 1748 KB Output is correct
59 Correct 5 ms 1756 KB Output is correct
60 Correct 5 ms 1876 KB Output is correct
61 Correct 5 ms 1748 KB Output is correct
62 Correct 5 ms 1808 KB Output is correct
63 Correct 5 ms 1876 KB Output is correct
64 Correct 3 ms 1748 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 221 ms 50660 KB Output is correct
5 Correct 231 ms 52688 KB Output is correct
6 Correct 224 ms 52648 KB Output is correct
7 Correct 222 ms 52656 KB Output is correct
8 Correct 227 ms 52644 KB Output is correct
9 Correct 223 ms 52612 KB Output is correct
10 Correct 226 ms 52624 KB Output is correct
11 Correct 230 ms 52636 KB Output is correct
12 Correct 177 ms 51892 KB Output is correct
13 Correct 178 ms 51844 KB Output is correct
14 Correct 185 ms 51776 KB Output is correct
15 Correct 176 ms 51880 KB Output is correct
16 Correct 126 ms 51632 KB Output is correct
17 Correct 125 ms 51644 KB Output is correct
18 Correct 124 ms 51592 KB Output is correct
19 Correct 120 ms 51528 KB Output is correct
20 Correct 115 ms 51508 KB Output is correct
21 Correct 112 ms 51536 KB Output is correct
22 Correct 122 ms 51512 KB Output is correct
23 Correct 123 ms 51580 KB Output is correct
24 Correct 124 ms 51508 KB Output is correct
25 Correct 131 ms 51496 KB Output is correct
26 Correct 135 ms 51512 KB Output is correct
27 Correct 135 ms 51508 KB Output is correct
28 Correct 95 ms 51548 KB Output is correct
29 Correct 96 ms 51520 KB Output is correct
30 Correct 101 ms 51516 KB Output is correct
31 Correct 108 ms 51584 KB Output is correct
32 Correct 120 ms 51636 KB Output is correct
33 Correct 130 ms 51576 KB Output is correct
34 Correct 171 ms 51756 KB Output is correct
35 Correct 171 ms 51632 KB Output is correct
36 Correct 176 ms 51644 KB Output is correct
37 Correct 167 ms 51840 KB Output is correct
38 Correct 173 ms 51756 KB Output is correct
39 Correct 171 ms 51764 KB Output is correct
40 Correct 172 ms 51776 KB Output is correct
41 Correct 171 ms 51828 KB Output is correct
42 Correct 118 ms 51504 KB Output is correct
43 Correct 189 ms 51848 KB Output is correct
44 Correct 184 ms 51748 KB Output is correct
45 Correct 187 ms 51728 KB Output is correct
46 Correct 181 ms 51776 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 472 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 460 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 5 ms 2004 KB Output is correct
75 Correct 6 ms 2016 KB Output is correct
76 Correct 5 ms 2004 KB Output is correct
77 Correct 5 ms 2012 KB Output is correct
78 Correct 5 ms 2004 KB Output is correct
79 Correct 5 ms 2004 KB Output is correct
80 Correct 5 ms 2004 KB Output is correct
81 Correct 8 ms 2040 KB Output is correct
82 Correct 8 ms 2004 KB Output is correct
83 Correct 7 ms 2004 KB Output is correct
84 Correct 4 ms 2004 KB Output is correct
85 Correct 7 ms 2004 KB Output is correct
86 Correct 8 ms 2004 KB Output is correct
87 Correct 7 ms 2052 KB Output is correct
88 Correct 4 ms 2008 KB Output is correct
89 Correct 5 ms 2012 KB Output is correct
90 Correct 5 ms 2004 KB Output is correct
91 Correct 5 ms 1976 KB Output is correct
92 Correct 4 ms 2012 KB Output is correct
93 Correct 5 ms 2004 KB Output is correct
94 Correct 5 ms 2004 KB Output is correct
95 Correct 4 ms 2008 KB Output is correct
96 Correct 4 ms 1972 KB Output is correct
97 Correct 5 ms 2004 KB Output is correct
98 Correct 5 ms 2012 KB Output is correct
99 Correct 5 ms 2012 KB Output is correct
100 Correct 4 ms 2004 KB Output is correct
101 Correct 5 ms 1748 KB Output is correct
102 Correct 5 ms 1752 KB Output is correct
103 Correct 6 ms 1748 KB Output is correct
104 Correct 5 ms 1748 KB Output is correct
105 Correct 5 ms 1756 KB Output is correct
106 Correct 5 ms 1876 KB Output is correct
107 Correct 5 ms 1748 KB Output is correct
108 Correct 5 ms 1808 KB Output is correct
109 Correct 5 ms 1876 KB Output is correct
110 Correct 3 ms 1748 KB Output is correct
111 Correct 211 ms 51544 KB Output is correct
112 Correct 194 ms 51496 KB Output is correct
113 Correct 200 ms 51500 KB Output is correct
114 Correct 194 ms 51476 KB Output is correct
115 Correct 202 ms 51512 KB Output is correct
116 Correct 181 ms 51580 KB Output is correct
117 Correct 194 ms 51464 KB Output is correct
118 Correct 379 ms 52768 KB Output is correct
119 Correct 396 ms 52632 KB Output is correct
120 Correct 301 ms 51748 KB Output is correct
121 Correct 155 ms 51580 KB Output is correct
122 Correct 312 ms 51884 KB Output is correct
123 Correct 288 ms 51980 KB Output is correct
124 Correct 296 ms 51796 KB Output is correct
125 Correct 157 ms 51460 KB Output is correct
126 Correct 230 ms 51628 KB Output is correct
127 Correct 216 ms 51568 KB Output is correct
128 Correct 210 ms 51632 KB Output is correct
129 Correct 153 ms 51568 KB Output is correct
130 Correct 214 ms 51612 KB Output is correct
131 Correct 193 ms 51572 KB Output is correct
132 Correct 187 ms 51500 KB Output is correct
133 Correct 159 ms 51548 KB Output is correct
134 Correct 210 ms 51500 KB Output is correct
135 Correct 192 ms 51588 KB Output is correct
136 Correct 178 ms 51464 KB Output is correct
137 Correct 171 ms 51532 KB Output is correct
138 Correct 194 ms 51500 KB Output is correct
139 Correct 187 ms 51588 KB Output is correct
140 Correct 196 ms 51588 KB Output is correct
141 Correct 176 ms 51508 KB Output is correct
142 Correct 161 ms 45840 KB Output is correct
143 Correct 147 ms 45888 KB Output is correct
144 Correct 152 ms 45888 KB Output is correct
145 Correct 158 ms 45856 KB Output is correct
146 Correct 169 ms 45828 KB Output is correct
147 Correct 164 ms 45852 KB Output is correct
148 Correct 186 ms 45752 KB Output is correct
149 Correct 157 ms 45804 KB Output is correct
150 Correct 159 ms 45808 KB Output is correct
151 Correct 157 ms 45756 KB Output is correct
152 Correct 97 ms 45384 KB Output is correct
153 Correct 160 ms 45836 KB Output is correct
154 Correct 171 ms 45812 KB Output is correct
155 Correct 177 ms 45872 KB Output is correct
156 Correct 162 ms 45868 KB Output is correct
157 Correct 156 ms 45752 KB Output is correct
158 Correct 159 ms 45832 KB Output is correct
159 Correct 156 ms 45676 KB Output is correct
160 Correct 95 ms 45280 KB Output is correct
161 Correct 294 ms 48676 KB Output is correct
162 Correct 298 ms 48708 KB Output is correct
163 Correct 323 ms 48652 KB Output is correct
164 Correct 285 ms 48580 KB Output is correct
165 Correct 282 ms 48720 KB Output is correct
166 Correct 109 ms 51544 KB Output is correct
167 Correct 180 ms 51760 KB Output is correct
168 Correct 173 ms 51812 KB Output is correct
169 Correct 168 ms 51828 KB Output is correct
170 Correct 174 ms 51756 KB Output is correct
171 Correct 157 ms 44896 KB Output is correct
172 Correct 152 ms 45704 KB Output is correct
173 Correct 292 ms 45608 KB Output is correct
174 Correct 276 ms 45600 KB Output is correct
175 Correct 267 ms 45484 KB Output is correct
176 Correct 247 ms 45620 KB Output is correct