oj.uz

Submission #928505

# Submission time Handle Problem Language Result Execution time Memory
928505 2024-02-16T13:38:50 Z cadmiumsky Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 32012 KB 
#pragma GCC optimize("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 = 4000;
  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);
    
    vector<Oper> pule;
    pule.reserve(sz(operation_queue));
    
    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(auto [tj, aj, bj, kj] : pule) {
            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);
      }
      else
        pule.emplace_back(Oper{ti, ai, bi, ki});
    }
    
    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 || sz(operation_queue) >= idealBuck) {
      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:275:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  275 |        operation_queue.emplace_back(Oper{t, a, b, -1});
      |                                          ^
segments.cpp:280:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  280 |        operation_queue.emplace_back(Oper{t, a, -1, -1});
      |                                          ^
segments.cpp:285:42: warning: narrowing conversion of 't' from 'int' to 'char' [-Wnarrowing]
  285 |        operation_queue.emplace_back(Oper{t, a, b, k});
      |                                          ^
segments.cpp:209:12: warning: unused variable 'worstInner' [-Wunused-variable]
  209 |   const ll worstInner = (ll)idealBuck * n + 5;
      |            ^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 6 ms 8796 KB Output is correct
5 Correct 12 ms 9652 KB Output is correct
6 Correct 14 ms 9564 KB Output is correct
7 Correct 7 ms 9132 KB Output is correct
8 Correct 8 ms 9308 KB Output is correct
9 Correct 7 ms 9212 KB Output is correct
10 Correct 7 ms 9560 KB Output is correct
11 Correct 16 ms 9308 KB Output is correct
12 Correct 16 ms 9308 KB Output is correct
13 Correct 7 ms 9564 KB Output is correct
14 Correct 8 ms 9308 KB Output is correct
15 Correct 7 ms 9052 KB Output is correct
16 Correct 6 ms 9052 KB Output is correct
17 Correct 8 ms 9052 KB Output is correct
18 Correct 7 ms 9560 KB Output is correct
19 Correct 8 ms 9052 KB Output is correct
20 Correct 7 ms 9208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3039 ms 20240 KB Output is correct
2 Correct 3081 ms 23112 KB Output is correct
3 Correct 3040 ms 23104 KB Output is correct
4 Correct 3063 ms 23840 KB Output is correct
5 Correct 3257 ms 31296 KB Output is correct
6 Correct 3389 ms 32012 KB Output is correct
7 Correct 3286 ms 22896 KB Output is correct
8 Correct 3239 ms 22856 KB Output is correct
9 Correct 3146 ms 22768 KB Output is correct
10 Correct 3018 ms 17156 KB Output is correct
11 Correct 3086 ms 18292 KB Output is correct
12 Correct 3282 ms 26632 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 9328 KB Output is correct
2 Correct 97 ms 9336 KB Output is correct
3 Correct 110 ms 9320 KB Output is correct
4 Correct 98 ms 11044 KB Output is correct
5 Correct 2079 ms 26424 KB Output is correct
6 Correct 1458 ms 24320 KB Output is correct
7 Correct 1692 ms 25192 KB Output is correct
8 Correct 3387 ms 31148 KB Output is correct
9 Correct 2902 ms 30164 KB Output is correct
10 Correct 1704 ms 24916 KB Output is correct
11 Correct 148 ms 12284 KB Output is correct
12 Correct 1790 ms 25284 KB Output is correct
13 Correct 1366 ms 23328 KB Output is correct
14 Correct 524 ms 17552 KB Output is correct
15 Correct 411 ms 16400 KB Output is correct
16 Correct 258 ms 14640 KB Output is correct
17 Correct 1108 ms 22160 KB Output is correct
18 Correct 1092 ms 22112 KB Output is correct
19 Correct 1104 ms 22240 KB Output is correct
20 Correct 1088 ms 22164 KB Output is correct
21 Correct 148 ms 12336 KB Output is correct
22 Correct 716 ms 18920 KB Output is correct
23 Correct 1042 ms 21396 KB Output is correct
24 Correct 853 ms 19416 KB Output is correct
25 Correct 98 ms 11088 KB Output is correct
26 Correct 96 ms 11200 KB Output is correct
27 Correct 98 ms 11140 KB Output is correct
28 Correct 97 ms 11092 KB Output is correct
29 Correct 1175 ms 22468 KB Output is correct
30 Correct 1195 ms 23008 KB Output is correct
31 Correct 2880 ms 30792 KB Output is correct
32 Correct 1650 ms 25380 KB Output is correct
33 Correct 1396 ms 23728 KB Output is correct
34 Correct 409 ms 16560 KB Output is correct
35 Correct 1069 ms 21116 KB Output is correct
36 Correct 1598 ms 24496 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 9296 KB Output is correct
2 Correct 112 ms 9260 KB Output is correct
3 Correct 113 ms 9552 KB Output is correct
4 Correct 121 ms 9460 KB Output is correct
5 Correct 3147 ms 25620 KB Output is correct
6 Correct 2778 ms 12652 KB Output is correct
7 Correct 3206 ms 26920 KB Output is correct
8 Correct 2974 ms 14248 KB Output is correct
9 Correct 1067 ms 17040 KB Output is correct
10 Correct 2156 ms 24156 KB Output is correct
11 Correct 701 ms 12000 KB Output is correct
12 Correct 3098 ms 29000 KB Output is correct
13 Correct 1598 ms 21652 KB Output is correct
14 Correct 868 ms 16004 KB Output is correct
15 Correct 2871 ms 28372 KB Output is correct
16 Correct 1807 ms 22672 KB Output is correct
17 Correct 3015 ms 20248 KB Output is correct
18 Correct 3012 ms 20068 KB Output is correct
19 Correct 3050 ms 20336 KB Output is correct
20 Correct 3006 ms 20012 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 6 ms 8796 KB Output is correct
5 Correct 12 ms 9652 KB Output is correct
6 Correct 14 ms 9564 KB Output is correct
7 Correct 7 ms 9132 KB Output is correct
8 Correct 8 ms 9308 KB Output is correct
9 Correct 7 ms 9212 KB Output is correct
10 Correct 7 ms 9560 KB Output is correct
11 Correct 16 ms 9308 KB Output is correct
12 Correct 16 ms 9308 KB Output is correct
13 Correct 7 ms 9564 KB Output is correct
14 Correct 8 ms 9308 KB Output is correct
15 Correct 7 ms 9052 KB Output is correct
16 Correct 6 ms 9052 KB Output is correct
17 Correct 8 ms 9052 KB Output is correct
18 Correct 7 ms 9560 KB Output is correct
19 Correct 8 ms 9052 KB Output is correct
20 Correct 7 ms 9208 KB Output is correct
21 Correct 3039 ms 20240 KB Output is correct
22 Correct 3081 ms 23112 KB Output is correct
23 Correct 3040 ms 23104 KB Output is correct
24 Correct 3063 ms 23840 KB Output is correct
25 Correct 3257 ms 31296 KB Output is correct
26 Correct 3389 ms 32012 KB Output is correct
27 Correct 3286 ms 22896 KB Output is correct
28 Correct 3239 ms 22856 KB Output is correct
29 Correct 3146 ms 22768 KB Output is correct
30 Correct 3018 ms 17156 KB Output is correct
31 Correct 3086 ms 18292 KB Output is correct
32 Correct 3282 ms 26632 KB Output is correct
33 Correct 110 ms 9296 KB Output is correct
34 Correct 112 ms 9260 KB Output is correct
35 Correct 113 ms 9552 KB Output is correct
36 Correct 121 ms 9460 KB Output is correct
37 Correct 3147 ms 25620 KB Output is correct
38 Correct 2778 ms 12652 KB Output is correct
39 Correct 3206 ms 26920 KB Output is correct
40 Correct 2974 ms 14248 KB Output is correct
41 Correct 1067 ms 17040 KB Output is correct
42 Correct 2156 ms 24156 KB Output is correct
43 Correct 701 ms 12000 KB Output is correct
44 Correct 3098 ms 29000 KB Output is correct
45 Correct 1598 ms 21652 KB Output is correct
46 Correct 868 ms 16004 KB Output is correct
47 Correct 2871 ms 28372 KB Output is correct
48 Correct 1807 ms 22672 KB Output is correct
49 Correct 3015 ms 20248 KB Output is correct
50 Correct 3012 ms 20068 KB Output is correct
51 Correct 3050 ms 20336 KB Output is correct
52 Correct 3006 ms 20012 KB Output is correct
53 Correct 122 ms 9428 KB Output is correct
54 Correct 126 ms 9516 KB Output is correct
55 Correct 115 ms 9380 KB Output is correct
56 Correct 114 ms 9356 KB Output is correct
57 Correct 3096 ms 16644 KB Output is correct
58 Correct 2485 ms 11948 KB Output is correct
59 Correct 3033 ms 22420 KB Output is correct
60 Correct 2342 ms 11484 KB Output is correct
61 Correct 1676 ms 21600 KB Output is correct
62 Correct 2727 ms 27276 KB Output is correct
63 Correct 2985 ms 28548 KB Output is correct
64 Correct 2837 ms 27548 KB Output is correct
65 Correct 625 ms 13476 KB Output is correct
66 Correct 582 ms 12548 KB Output is correct
67 Correct 1815 ms 22504 KB Output is correct
68 Correct 1292 ms 19588 KB Output is correct
69 Correct 3060 ms 20080 KB Output is correct
70 Correct 2993 ms 20148 KB Output is correct
71 Correct 3027 ms 20060 KB Output is correct
72 Correct 3024 ms 20124 KB Output is correct
73 Correct 827 ms 14228 KB Output is correct
74 Correct 1387 ms 19584 KB Output is correct
75 Correct 3222 ms 29480 KB Output is correct
76 Correct 3035 ms 28844 KB Output is correct
77 Correct 117 ms 9300 KB Output is correct
78 Correct 121 ms 9296 KB Output is correct
79 Correct 123 ms 9336 KB Output is correct
80 Correct 114 ms 9300 KB Output is correct
81 Correct 1280 ms 18428 KB Output is correct
82 Correct 816 ms 14228 KB Output is correct
83 Correct 649 ms 11824 KB Output is correct
84 Correct 1304 ms 18984 KB Output is correct
85 Correct 1829 ms 23304 KB Output is correct
86 Correct 1866 ms 23480 KB Output is correct
87 Correct 976 ms 16956 KB Output is correct
88 Correct 520 ms 12024 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 6 ms 8796 KB Output is correct
5 Correct 12 ms 9652 KB Output is correct
6 Correct 14 ms 9564 KB Output is correct
7 Correct 7 ms 9132 KB Output is correct
8 Correct 8 ms 9308 KB Output is correct
9 Correct 7 ms 9212 KB Output is correct
10 Correct 7 ms 9560 KB Output is correct
11 Correct 16 ms 9308 KB Output is correct
12 Correct 16 ms 9308 KB Output is correct
13 Correct 7 ms 9564 KB Output is correct
14 Correct 8 ms 9308 KB Output is correct
15 Correct 7 ms 9052 KB Output is correct
16 Correct 6 ms 9052 KB Output is correct
17 Correct 8 ms 9052 KB Output is correct
18 Correct 7 ms 9560 KB Output is correct
19 Correct 8 ms 9052 KB Output is correct
20 Correct 7 ms 9208 KB Output is correct
21 Correct 3039 ms 20240 KB Output is correct
22 Correct 3081 ms 23112 KB Output is correct
23 Correct 3040 ms 23104 KB Output is correct
24 Correct 3063 ms 23840 KB Output is correct
25 Correct 3257 ms 31296 KB Output is correct
26 Correct 3389 ms 32012 KB Output is correct
27 Correct 3286 ms 22896 KB Output is correct
28 Correct 3239 ms 22856 KB Output is correct
29 Correct 3146 ms 22768 KB Output is correct
30 Correct 3018 ms 17156 KB Output is correct
31 Correct 3086 ms 18292 KB Output is correct
32 Correct 3282 ms 26632 KB Output is correct
33 Correct 97 ms 9328 KB Output is correct
34 Correct 97 ms 9336 KB Output is correct
35 Correct 110 ms 9320 KB Output is correct
36 Correct 98 ms 11044 KB Output is correct
37 Correct 2079 ms 26424 KB Output is correct
38 Correct 1458 ms 24320 KB Output is correct
39 Correct 1692 ms 25192 KB Output is correct
40 Correct 3387 ms 31148 KB Output is correct
41 Correct 2902 ms 30164 KB Output is correct
42 Correct 1704 ms 24916 KB Output is correct
43 Correct 148 ms 12284 KB Output is correct
44 Correct 1790 ms 25284 KB Output is correct
45 Correct 1366 ms 23328 KB Output is correct
46 Correct 524 ms 17552 KB Output is correct
47 Correct 411 ms 16400 KB Output is correct
48 Correct 258 ms 14640 KB Output is correct
49 Correct 1108 ms 22160 KB Output is correct
50 Correct 1092 ms 22112 KB Output is correct
51 Correct 1104 ms 22240 KB Output is correct
52 Correct 1088 ms 22164 KB Output is correct
53 Correct 148 ms 12336 KB Output is correct
54 Correct 716 ms 18920 KB Output is correct
55 Correct 1042 ms 21396 KB Output is correct
56 Correct 853 ms 19416 KB Output is correct
57 Correct 98 ms 11088 KB Output is correct
58 Correct 96 ms 11200 KB Output is correct
59 Correct 98 ms 11140 KB Output is correct
60 Correct 97 ms 11092 KB Output is correct
61 Correct 1175 ms 22468 KB Output is correct
62 Correct 1195 ms 23008 KB Output is correct
63 Correct 2880 ms 30792 KB Output is correct
64 Correct 1650 ms 25380 KB Output is correct
65 Correct 1396 ms 23728 KB Output is correct
66 Correct 409 ms 16560 KB Output is correct
67 Correct 1069 ms 21116 KB Output is correct
68 Correct 1598 ms 24496 KB Output is correct
69 Correct 110 ms 9296 KB Output is correct
70 Correct 112 ms 9260 KB Output is correct
71 Correct 113 ms 9552 KB Output is correct
72 Correct 121 ms 9460 KB Output is correct
73 Correct 3147 ms 25620 KB Output is correct
74 Correct 2778 ms 12652 KB Output is correct
75 Correct 3206 ms 26920 KB Output is correct
76 Correct 2974 ms 14248 KB Output is correct
77 Correct 1067 ms 17040 KB Output is correct
78 Correct 2156 ms 24156 KB Output is correct
79 Correct 701 ms 12000 KB Output is correct
80 Correct 3098 ms 29000 KB Output is correct
81 Correct 1598 ms 21652 KB Output is correct
82 Correct 868 ms 16004 KB Output is correct
83 Correct 2871 ms 28372 KB Output is correct
84 Correct 1807 ms 22672 KB Output is correct
85 Correct 3015 ms 20248 KB Output is correct
86 Correct 3012 ms 20068 KB Output is correct
87 Correct 3050 ms 20336 KB Output is correct
88 Correct 3006 ms 20012 KB Output is correct
89 Correct 122 ms 9428 KB Output is correct
90 Correct 126 ms 9516 KB Output is correct
91 Correct 115 ms 9380 KB Output is correct
92 Correct 114 ms 9356 KB Output is correct
93 Correct 3096 ms 16644 KB Output is correct
94 Correct 2485 ms 11948 KB Output is correct
95 Correct 3033 ms 22420 KB Output is correct
96 Correct 2342 ms 11484 KB Output is correct
97 Correct 1676 ms 21600 KB Output is correct
98 Correct 2727 ms 27276 KB Output is correct
99 Correct 2985 ms 28548 KB Output is correct
100 Correct 2837 ms 27548 KB Output is correct
101 Correct 625 ms 13476 KB Output is correct
102 Correct 582 ms 12548 KB Output is correct
103 Correct 1815 ms 22504 KB Output is correct
104 Correct 1292 ms 19588 KB Output is correct
105 Correct 3060 ms 20080 KB Output is correct
106 Correct 2993 ms 20148 KB Output is correct
107 Correct 3027 ms 20060 KB Output is correct
108 Correct 3024 ms 20124 KB Output is correct
109 Correct 827 ms 14228 KB Output is correct
110 Correct 1387 ms 19584 KB Output is correct
111 Correct 3222 ms 29480 KB Output is correct
112 Correct 3035 ms 28844 KB Output is correct
113 Correct 117 ms 9300 KB Output is correct
114 Correct 121 ms 9296 KB Output is correct
115 Correct 123 ms 9336 KB Output is correct
116 Correct 114 ms 9300 KB Output is correct
117 Correct 1280 ms 18428 KB Output is correct
118 Correct 816 ms 14228 KB Output is correct
119 Correct 649 ms 11824 KB Output is correct
120 Correct 1304 ms 18984 KB Output is correct
121 Correct 1829 ms 23304 KB Output is correct
122 Correct 1866 ms 23480 KB Output is correct
123 Correct 976 ms 16956 KB Output is correct
124 Correct 520 ms 12024 KB Output is correct
125 Correct 248 ms 10000 KB Output is correct
126 Correct 251 ms 9808 KB Output is correct
127 Correct 320 ms 10100 KB Output is correct
128 Correct 256 ms 9812 KB Output is correct
129 Correct 243 ms 9812 KB Output is correct
130 Correct 269 ms 9808 KB Output is correct
131 Execution timed out 5044 ms 15920 KB Time limit exceeded
132 Halted 0 ms 0 KB -