oj.uz

Submission #928493

# Submission time Handle Problem Language Result Execution time Memory
928493 2024-02-16T13:24:50 Z cadmiumsky Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 29504 KB 
#pragma GCC optimize("Ofast,unroll-loops,O3")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,abm,mmx,popcnt")
#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 = 2e5 + 5;
 
pii segments[nmax];
 
struct Oper {
  char type;
  int a, b;
  int k;
};
 
namespace Precalc {
  multiset<pii> actives_sortfwr;
  
  auto cmp = [](const pii& a, const pii& b) -> bool { return a.second < b.second || (a.second == b.second && a.first < b.first); };
  multiset<pii, decltype(cmp)> actives_sortbckw(cmp);
  
  void rebatch(vector<Oper> opqueue) {
    for(auto [t, a, b, k] : opqueue) {
      if(t == 1)
        actives_sortfwr.insert(pii{a, b}),
        actives_sortbckw.insert(pii{a, b});
      else if(t == 2)
        actives_sortfwr.erase(actives_sortfwr.find(segments[a])),
        actives_sortbckw.erase(actives_sortbckw.find(segments[a]));
    }
    
    return;
  }
  struct Item {
    int link;
    int sum, own;
  };
  
  #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia
  #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv)
  
  set<pii> fwrpoz;
  set<pii> bckwpoz;
  int freq[nmax];
  Item fwr[nmax], bckw[nmax];
  pii atrf[nmax], atrb[nmax];
  map<int, int> norm_Ks;
  vector<int> currKs;
  
  int n;
  
  void contextualize(vector<int> Ks) {
    norm_Ks.clear();
    for(auto x : Ks) norm_Ks[x];
    int ptrnrm = 0;
    for(auto &[a, b] : norm_Ks) freq[ptrnrm] = 0, b = ptrnrm++;
    
    fwrpoz.clear(), bckwpoz.clear();
    
    { // forward links
      pii lst = {-1, -1};
      
      n = 0;
      for(auto [a, b] : actives_sortfwr) {
        int k = b - a + 1;
        if(k < Ks[0]) continue;
        if(pii{a, b} != lst) { n++; fwr[n].sum = fwr[n].own = 0; }
        atrf[n] = lst = pii{a, b};
        fwr[n].own++;
      }
      
      vector<int> counter_app(sz(Ks));
      
      for(int i = n, atrcoef = sz(Ks) - 1; i > 0; atrcoef = (atrcoef == 0? sz(Ks) - 1 : atrcoef - 1), i--) {
        auto [a, b] = atrf[i];
        
        int poz = distance(begin(Ks), prev(upper_bound(all(Ks), b - a + 1)));
        counter_app[poz] += fwr[i].own;
        
        fwr[i].link = atrcoef;
        fwr[i].sum = counter_app[atrcoef];
        
        fwrpoz.emplace(pii{a, i});
      }
    }
    // ---- 
    
    { // backward links
      pii lst = {-1, -1};
      
      n = 0;
      for(auto [a, b] : actives_sortbckw) {
        int k = b - a + 1;
        if(k < Ks[0]) continue;
        if(pii{a, b} != lst) { n++; bckw[n].sum = bckw[n].own = 0; }
        atrb[n] = lst = pii{a, b};
        bckw[n].own++;
      }
      
      vector<int> counter_app(sz(Ks));
      
      for(int i = 1, atrcoef = sz(Ks) - 1; i <= n; atrcoef = (atrcoef == 0? sz(Ks) - 1 : atrcoef - 1), i++) {
        auto [a, b] = atrb[i];
        
        int poz = distance(begin(Ks), prev(upper_bound(all(Ks), b - a + 1)));
        counter_app[poz] += bckw[i].own;
        
        bckw[i].link = atrcoef;
        bckw[i].sum = counter_app[atrcoef];
        
        bckwpoz.emplace(pii{b, i});
      }
    }
      
    for(auto [a, b] : actives_sortfwr) {
      int k = b - a + 1;
      if(k < Ks[0]) continue;
      freq[distance(begin(Ks), prev(upper_bound(all(Ks), k)))]++;
    }
    
    for(int i = sz(Ks) - 2; i >= 0; i--)
      freq[i] += freq[i + 1];
    currKs = move(Ks);
    
  }
  
  int query_K(int k) { 
    return freq[norm_Ks[k]];
  }
  int query_L(int L, int k) {
    k = norm_Ks[k];
    auto it = bckwpoz.upper_bound(pii{L + 1, - 1});
    if(it == bckwpoz.begin()) return 0;
    
    int poz = prev(it) -> second, l = max(k, bckw[poz].link), r = l - 1; 
    bool initially = l == k;
    int rez = 0;
    
    auto breakcondition = [&]() -> bool {
      if(initially) return r + 1 < sz(currKs);
      return k < l;
    };
    auto belongcondition = [&](int len) -> bool {
      return (currKs[k] <= len && len < currKs[l]) || (r + 1 < sz(currKs) && currKs[r + 1] <= len);
    };
    
    while(breakcondition() && poz > 0) {
      if(bckw[poz].link == r + 1) { rez += bckw[poz].sum; r++; }
      else if(bckw[poz].link == k) { rez += bckw[poz].sum; k++; }
      
      if(breakcondition() && belongcondition(atrb[poz].second - atrb[poz].first + 1)) rez += bckw[poz].own;
      poz--;
    }
    return rez;
  }
  
  int query_R(int R, int k) {
    k = norm_Ks[k];
    auto it = fwrpoz.upper_bound(pii{R, - 1});
    if(it == fwrpoz.end()) return 0;
    
    int poz = it -> second, l = max(k, fwr[poz].link), r = l - 1; 
    bool initially = l == k;
    int rez = 0;
    
    auto breakcondition = [&]() -> bool {
      if(initially) return r + 1 < sz(currKs);
      return k < l;
    };
    auto belongcondition = [&](int len) -> bool {
      return (currKs[k] <= len && len < currKs[l]) || (r + 1 < sz(currKs) && currKs[r + 1] <= len);
    };
    
    while(breakcondition() && poz <= n) {
      if(fwr[poz].link == r + 1) { rez += fwr[poz].sum; r++; }
      else if(fwr[poz].link == k) { rez += fwr[poz].sum; k++; }
      
      if(breakcondition() && belongcondition(atrf[poz].second - atrf[poz].first + 1)) rez += fwr[poz].own;
      poz++;
    }
    return rez;
  }
} 
 
//#error in loc sa ai pozitii care corespund unor segmente bune, doar pune suma partiala a alora congruenti cu (-pozitia) mod sz(Ks)
 
int segmpoz = 1;
 
int unitValue(int l, int r, int a, int b, int k) {
  return min(r, b) - max(l, a) + 1 >= k;
}

signed main() {
  cin.tie(0) -> sync_with_stdio(0);
  int n, t_offline;
  cin >> n >> t_offline;
  
  const int idealBuck = 625;
  const ll worstInner = (ll)idealBuck * n + 5;
  
  
  vector<Oper> operation_queue;
  operation_queue.reserve(n);
  vector<int> results;
  results.reserve(n);

  int lastans = 0;
  
  auto flush_queue = [&]() {
    vector<int> Ks;
    Ks.reserve(sz(operation_queue));
    for(auto [t, a, b, k] : operation_queue)
      if(t == 3) Ks.emplace_back(k);
    
    if(sz(Ks) == 0) return;
    
    sort(all(Ks));
    Ks.erase(unique(all(Ks)), Ks.end());
    
    Precalc::contextualize(Ks);
    
    for(int i = 0; i < sz(operation_queue); i++) {
      auto &[ti, ai, bi, ki] = operation_queue[i];
      if(ti == 1 || ti == 3) {
        ai = ai ^ (t_offline * lastans);
        bi = bi ^ (t_offline * lastans);
        if(ai > bi) swap(ai, bi);
      }
      
      if(ti == 1)
        segments[segmpoz++] = pii{ai, bi};
      
      if(ti == 3) {
        if(bi - ai + 1 < ki) {
          lastans = 0;
        }
        else {
          int rez = Precalc::query_K(ki) - Precalc::query_R(bi - ki + 1 + 1, ki) - Precalc::query_L(ai + ki - 1 - 1, ki);
          for(int j = i - 1; j >= 0; j--) {
            auto &[tj, aj, bj, kj] = operation_queue[j];
            
            if(tj == 3) continue;
            else if(tj == 2)
              rez -= unitValue(ai, bi, segments[aj].first, segments[aj].second, ki);
            else
              rez += unitValue(ai, bi, aj, bj, ki);
          }
          lastans = rez;
        }
        
        results.emplace_back(lastans);
      }
    }
    
    Precalc::rebatch(operation_queue);
    operation_queue.clear();
  };
  int cnt[2] = {1, 0};
  
  for(int t, a, b, k, tc = 0; tc < n; tc++) {
    cin >> t;
    if(t == 1) {
       cin >> a >> b;
       operation_queue.emplace_back(Oper{t, a, b, -1});
       cnt[0]++;
    }
    if(t == 2) {
       cin >> a;
       operation_queue.emplace_back(Oper{t, a, -1, -1});
       cnt[0]++;
    }
    if(t == 3) {
       cin >> a >> b >> k;
       operation_queue.emplace_back(Oper{t, a, b, k});
       cnt[1]++;
    }
    
    if(tc == n - 1 || (ll)cnt[1] * cnt[0] >= worstInner) {
      flush_queue();
      cnt[1] = 0;
      cnt[0] = sz(Precalc::actives_sortbckw);
    }
  }
  
  for(auto x : results) cout << x << '\n';
  return 0;
}
/**
  Anul asta nu se da centroid
  -- Rugaciunile mele
*/

Compilation message

segments.cpp:49:4: warning: #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia [-Wcpp]
   49 |   #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia
      |    ^~~~~~~
segments.cpp:50:4: warning: #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv) [-Wcpp]
   50 |   #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv)
      |    ^~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:274:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  274 |        operation_queue.emplace_back(Oper{t, a, b, -1});
      |                                          ^
segments.cpp:279:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  279 |        operation_queue.emplace_back(Oper{t, a, -1, -1});
      |                                          ^
segments.cpp:284:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  284 |        operation_queue.emplace_back(Oper{t, a, b, k});
      |                                          ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 8824 KB Output is correct
4 Correct 8 ms 8884 KB Output is correct
5 Correct 10 ms 9600 KB Output is correct
6 Correct 12 ms 9340 KB Output is correct
7 Correct 9 ms 8796 KB Output is correct
8 Correct 8 ms 2908 KB Output is correct
9 Correct 9 ms 9308 KB Output is correct
10 Correct 7 ms 2908 KB Output is correct
11 Correct 30 ms 9336 KB Output is correct
12 Correct 21 ms 9344 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 9 ms 9052 KB Output is correct
15 Correct 8 ms 8792 KB Output is correct
16 Correct 8 ms 8796 KB Output is correct
17 Correct 10 ms 9052 KB Output is correct
18 Correct 5 ms 2908 KB Output is correct
19 Correct 9 ms 9016 KB Output is correct
20 Correct 9 ms 9052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1906 ms 19964 KB Output is correct
2 Correct 1937 ms 19972 KB Output is correct
3 Correct 1948 ms 20168 KB Output is correct
4 Correct 2133 ms 20980 KB Output is correct
5 Correct 738 ms 28868 KB Output is correct
6 Correct 450 ms 29504 KB Output is correct
7 Correct 1943 ms 20076 KB Output is correct
8 Correct 1829 ms 20348 KB Output is correct
9 Correct 1900 ms 20064 KB Output is correct
10 Correct 2553 ms 13796 KB Output is correct
11 Correct 2167 ms 15788 KB Output is correct
12 Correct 1743 ms 24080 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 10152 KB Output is correct
2 Correct 523 ms 9712 KB Output is correct
3 Correct 545 ms 9932 KB Output is correct
4 Correct 546 ms 10572 KB Output is correct
5 Correct 1054 ms 24256 KB Output is correct
6 Correct 1112 ms 21980 KB Output is correct
7 Correct 1160 ms 23040 KB Output is correct
8 Correct 485 ms 28792 KB Output is correct
9 Correct 325 ms 28072 KB Output is correct
10 Correct 464 ms 22888 KB Output is correct
11 Correct 470 ms 10912 KB Output is correct
12 Correct 460 ms 23184 KB Output is correct
13 Correct 416 ms 21268 KB Output is correct
14 Correct 342 ms 15408 KB Output is correct
15 Correct 348 ms 14584 KB Output is correct
16 Correct 359 ms 13052 KB Output is correct
17 Correct 721 ms 19996 KB Output is correct
18 Correct 770 ms 19732 KB Output is correct
19 Correct 804 ms 19752 KB Output is correct
20 Correct 720 ms 20000 KB Output is correct
21 Correct 457 ms 11032 KB Output is correct
22 Correct 353 ms 16852 KB Output is correct
23 Correct 393 ms 19520 KB Output is correct
24 Correct 356 ms 17568 KB Output is correct
25 Correct 536 ms 10036 KB Output is correct
26 Correct 530 ms 10324 KB Output is correct
27 Correct 527 ms 9864 KB Output is correct
28 Correct 527 ms 9996 KB Output is correct
29 Correct 403 ms 20600 KB Output is correct
30 Correct 407 ms 20416 KB Output is correct
31 Correct 346 ms 28572 KB Output is correct
32 Correct 522 ms 22884 KB Output is correct
33 Correct 431 ms 21920 KB Output is correct
34 Correct 343 ms 14508 KB Output is correct
35 Correct 429 ms 19672 KB Output is correct
36 Correct 419 ms 22344 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 534 ms 10132 KB Output is correct
2 Correct 555 ms 9996 KB Output is correct
3 Correct 564 ms 10128 KB Output is correct
4 Correct 549 ms 10060 KB Output is correct
5 Correct 1728 ms 25260 KB Output is correct
6 Correct 3029 ms 13268 KB Output is correct
7 Correct 1413 ms 26408 KB Output is correct
8 Correct 2466 ms 14456 KB Output is correct
9 Correct 800 ms 16888 KB Output is correct
10 Correct 794 ms 24020 KB Output is correct
11 Correct 1097 ms 12340 KB Output is correct
12 Correct 304 ms 29016 KB Output is correct
13 Correct 647 ms 21200 KB Output is correct
14 Correct 726 ms 15904 KB Output is correct
15 Correct 474 ms 27828 KB Output is correct
16 Correct 830 ms 22216 KB Output is correct
17 Correct 1770 ms 20104 KB Output is correct
18 Correct 1797 ms 19948 KB Output is correct
19 Correct 1908 ms 19884 KB Output is correct
20 Correct 1755 ms 19956 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 8824 KB Output is correct
4 Correct 8 ms 8884 KB Output is correct
5 Correct 10 ms 9600 KB Output is correct
6 Correct 12 ms 9340 KB Output is correct
7 Correct 9 ms 8796 KB Output is correct
8 Correct 8 ms 2908 KB Output is correct
9 Correct 9 ms 9308 KB Output is correct
10 Correct 7 ms 2908 KB Output is correct
11 Correct 30 ms 9336 KB Output is correct
12 Correct 21 ms 9344 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 9 ms 9052 KB Output is correct
15 Correct 8 ms 8792 KB Output is correct
16 Correct 8 ms 8796 KB Output is correct
17 Correct 10 ms 9052 KB Output is correct
18 Correct 5 ms 2908 KB Output is correct
19 Correct 9 ms 9016 KB Output is correct
20 Correct 9 ms 9052 KB Output is correct
21 Correct 1906 ms 19964 KB Output is correct
22 Correct 1937 ms 19972 KB Output is correct
23 Correct 1948 ms 20168 KB Output is correct
24 Correct 2133 ms 20980 KB Output is correct
25 Correct 738 ms 28868 KB Output is correct
26 Correct 450 ms 29504 KB Output is correct
27 Correct 1943 ms 20076 KB Output is correct
28 Correct 1829 ms 20348 KB Output is correct
29 Correct 1900 ms 20064 KB Output is correct
30 Correct 2553 ms 13796 KB Output is correct
31 Correct 2167 ms 15788 KB Output is correct
32 Correct 1743 ms 24080 KB Output is correct
33 Correct 534 ms 10132 KB Output is correct
34 Correct 555 ms 9996 KB Output is correct
35 Correct 564 ms 10128 KB Output is correct
36 Correct 549 ms 10060 KB Output is correct
37 Correct 1728 ms 25260 KB Output is correct
38 Correct 3029 ms 13268 KB Output is correct
39 Correct 1413 ms 26408 KB Output is correct
40 Correct 2466 ms 14456 KB Output is correct
41 Correct 800 ms 16888 KB Output is correct
42 Correct 794 ms 24020 KB Output is correct
43 Correct 1097 ms 12340 KB Output is correct
44 Correct 304 ms 29016 KB Output is correct
45 Correct 647 ms 21200 KB Output is correct
46 Correct 726 ms 15904 KB Output is correct
47 Correct 474 ms 27828 KB Output is correct
48 Correct 830 ms 22216 KB Output is correct
49 Correct 1770 ms 20104 KB Output is correct
50 Correct 1797 ms 19948 KB Output is correct
51 Correct 1908 ms 19884 KB Output is correct
52 Correct 1755 ms 19956 KB Output is correct
53 Correct 557 ms 10072 KB Output is correct
54 Correct 573 ms 10072 KB Output is correct
55 Correct 586 ms 9980 KB Output is correct
56 Correct 538 ms 9984 KB Output is correct
57 Correct 1953 ms 16316 KB Output is correct
58 Correct 3135 ms 11864 KB Output is correct
59 Correct 1907 ms 22264 KB Output is correct
60 Correct 2780 ms 11832 KB Output is correct
61 Correct 802 ms 21576 KB Output is correct
62 Correct 549 ms 27172 KB Output is correct
63 Correct 369 ms 28368 KB Output is correct
64 Correct 510 ms 27360 KB Output is correct
65 Correct 812 ms 13480 KB Output is correct
66 Correct 862 ms 12808 KB Output is correct
67 Correct 780 ms 22312 KB Output is correct
68 Correct 699 ms 19428 KB Output is correct
69 Correct 1897 ms 19888 KB Output is correct
70 Correct 1804 ms 20076 KB Output is correct
71 Correct 1839 ms 19808 KB Output is correct
72 Correct 1886 ms 19880 KB Output is correct
73 Correct 917 ms 14404 KB Output is correct
74 Correct 834 ms 19248 KB Output is correct
75 Correct 227 ms 29324 KB Output is correct
76 Correct 365 ms 28676 KB Output is correct
77 Correct 552 ms 10044 KB Output is correct
78 Correct 563 ms 10300 KB Output is correct
79 Correct 556 ms 10012 KB Output is correct
80 Correct 557 ms 10276 KB Output is correct
81 Correct 829 ms 18656 KB Output is correct
82 Correct 933 ms 14468 KB Output is correct
83 Correct 1116 ms 12288 KB Output is correct
84 Correct 778 ms 18876 KB Output is correct
85 Correct 865 ms 22524 KB Output is correct
86 Correct 854 ms 23128 KB Output is correct
87 Correct 811 ms 16664 KB Output is correct
88 Correct 984 ms 12288 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 8 ms 8824 KB Output is correct
4 Correct 8 ms 8884 KB Output is correct
5 Correct 10 ms 9600 KB Output is correct
6 Correct 12 ms 9340 KB Output is correct
7 Correct 9 ms 8796 KB Output is correct
8 Correct 8 ms 2908 KB Output is correct
9 Correct 9 ms 9308 KB Output is correct
10 Correct 7 ms 2908 KB Output is correct
11 Correct 30 ms 9336 KB Output is correct
12 Correct 21 ms 9344 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 9 ms 9052 KB Output is correct
15 Correct 8 ms 8792 KB Output is correct
16 Correct 8 ms 8796 KB Output is correct
17 Correct 10 ms 9052 KB Output is correct
18 Correct 5 ms 2908 KB Output is correct
19 Correct 9 ms 9016 KB Output is correct
20 Correct 9 ms 9052 KB Output is correct
21 Correct 1906 ms 19964 KB Output is correct
22 Correct 1937 ms 19972 KB Output is correct
23 Correct 1948 ms 20168 KB Output is correct
24 Correct 2133 ms 20980 KB Output is correct
25 Correct 738 ms 28868 KB Output is correct
26 Correct 450 ms 29504 KB Output is correct
27 Correct 1943 ms 20076 KB Output is correct
28 Correct 1829 ms 20348 KB Output is correct
29 Correct 1900 ms 20064 KB Output is correct
30 Correct 2553 ms 13796 KB Output is correct
31 Correct 2167 ms 15788 KB Output is correct
32 Correct 1743 ms 24080 KB Output is correct
33 Correct 530 ms 10152 KB Output is correct
34 Correct 523 ms 9712 KB Output is correct
35 Correct 545 ms 9932 KB Output is correct
36 Correct 546 ms 10572 KB Output is correct
37 Correct 1054 ms 24256 KB Output is correct
38 Correct 1112 ms 21980 KB Output is correct
39 Correct 1160 ms 23040 KB Output is correct
40 Correct 485 ms 28792 KB Output is correct
41 Correct 325 ms 28072 KB Output is correct
42 Correct 464 ms 22888 KB Output is correct
43 Correct 470 ms 10912 KB Output is correct
44 Correct 460 ms 23184 KB Output is correct
45 Correct 416 ms 21268 KB Output is correct
46 Correct 342 ms 15408 KB Output is correct
47 Correct 348 ms 14584 KB Output is correct
48 Correct 359 ms 13052 KB Output is correct
49 Correct 721 ms 19996 KB Output is correct
50 Correct 770 ms 19732 KB Output is correct
51 Correct 804 ms 19752 KB Output is correct
52 Correct 720 ms 20000 KB Output is correct
53 Correct 457 ms 11032 KB Output is correct
54 Correct 353 ms 16852 KB Output is correct
55 Correct 393 ms 19520 KB Output is correct
56 Correct 356 ms 17568 KB Output is correct
57 Correct 536 ms 10036 KB Output is correct
58 Correct 530 ms 10324 KB Output is correct
59 Correct 527 ms 9864 KB Output is correct
60 Correct 527 ms 9996 KB Output is correct
61 Correct 403 ms 20600 KB Output is correct
62 Correct 407 ms 20416 KB Output is correct
63 Correct 346 ms 28572 KB Output is correct
64 Correct 522 ms 22884 KB Output is correct
65 Correct 431 ms 21920 KB Output is correct
66 Correct 343 ms 14508 KB Output is correct
67 Correct 429 ms 19672 KB Output is correct
68 Correct 419 ms 22344 KB Output is correct
69 Correct 534 ms 10132 KB Output is correct
70 Correct 555 ms 9996 KB Output is correct
71 Correct 564 ms 10128 KB Output is correct
72 Correct 549 ms 10060 KB Output is correct
73 Correct 1728 ms 25260 KB Output is correct
74 Correct 3029 ms 13268 KB Output is correct
75 Correct 1413 ms 26408 KB Output is correct
76 Correct 2466 ms 14456 KB Output is correct
77 Correct 800 ms 16888 KB Output is correct
78 Correct 794 ms 24020 KB Output is correct
79 Correct 1097 ms 12340 KB Output is correct
80 Correct 304 ms 29016 KB Output is correct
81 Correct 647 ms 21200 KB Output is correct
82 Correct 726 ms 15904 KB Output is correct
83 Correct 474 ms 27828 KB Output is correct
84 Correct 830 ms 22216 KB Output is correct
85 Correct 1770 ms 20104 KB Output is correct
86 Correct 1797 ms 19948 KB Output is correct
87 Correct 1908 ms 19884 KB Output is correct
88 Correct 1755 ms 19956 KB Output is correct
89 Correct 557 ms 10072 KB Output is correct
90 Correct 573 ms 10072 KB Output is correct
91 Correct 586 ms 9980 KB Output is correct
92 Correct 538 ms 9984 KB Output is correct
93 Correct 1953 ms 16316 KB Output is correct
94 Correct 3135 ms 11864 KB Output is correct
95 Correct 1907 ms 22264 KB Output is correct
96 Correct 2780 ms 11832 KB Output is correct
97 Correct 802 ms 21576 KB Output is correct
98 Correct 549 ms 27172 KB Output is correct
99 Correct 369 ms 28368 KB Output is correct
100 Correct 510 ms 27360 KB Output is correct
101 Correct 812 ms 13480 KB Output is correct
102 Correct 862 ms 12808 KB Output is correct
103 Correct 780 ms 22312 KB Output is correct
104 Correct 699 ms 19428 KB Output is correct
105 Correct 1897 ms 19888 KB Output is correct
106 Correct 1804 ms 20076 KB Output is correct
107 Correct 1839 ms 19808 KB Output is correct
108 Correct 1886 ms 19880 KB Output is correct
109 Correct 917 ms 14404 KB Output is correct
110 Correct 834 ms 19248 KB Output is correct
111 Correct 227 ms 29324 KB Output is correct
112 Correct 365 ms 28676 KB Output is correct
113 Correct 552 ms 10044 KB Output is correct
114 Correct 563 ms 10300 KB Output is correct
115 Correct 556 ms 10012 KB Output is correct
116 Correct 557 ms 10276 KB Output is correct
117 Correct 829 ms 18656 KB Output is correct
118 Correct 933 ms 14468 KB Output is correct
119 Correct 1116 ms 12288 KB Output is correct
120 Correct 778 ms 18876 KB Output is correct
121 Correct 865 ms 22524 KB Output is correct
122 Correct 854 ms 23128 KB Output is correct
123 Correct 811 ms 16664 KB Output is correct
124 Correct 984 ms 12288 KB Output is correct
125 Correct 1933 ms 11088 KB Output is correct
126 Correct 1850 ms 11032 KB Output is correct
127 Correct 1953 ms 11072 KB Output is correct
128 Correct 2017 ms 11020 KB Output is correct
129 Correct 1772 ms 11096 KB Output is correct
130 Correct 2017 ms 10952 KB Output is correct
131 Execution timed out 5051 ms 14096 KB Time limit exceeded
132 Halted 0 ms 0 KB -