oj.uz

Submission #927782

# Submission time Handle Problem Language Result Execution time Memory
927782 2024-02-15T10:36:31 Z cadmiumsky Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 36704 KB 
#pragma GCC optimize("Ofast")
#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 {
  int type;
  int a, b;
  int k;
};

namespace Precalc {
  
  multiset<pii> actives;
  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.insert(pii{a, b}),
        actives_sortfwr.insert(pii{a, b}),
        actives_sortbckw.insert(pii{a, b});
      else if(t == 2)
        actives.erase(actives.find(segments[a])),
        actives_sortfwr.erase(actives_sortfwr.find(segments[a])),
        actives_sortbckw.erase(actives_sortbckw.find(segments[a]));
    }
    
    return;
  }
  struct Item {
    int link, 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) {
      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;
    int rez = 0;
    while(k < sz(currKs) && poz > 0) {
      if(bckw[poz].link == k) {
        rez += bckw[poz].sum;
        k++;
      }
      
      if(k < sz(currKs) && currKs[k] <= 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;
    int rez = 0;
    while(k < sz(currKs) && poz <= n) {
      if(fwr[poz].link == k) {
        rez += fwr[poz].sum;
        k++;
      }
      
      if(k < sz(currKs) && currKs[k] <= 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 = 1024;
  const ll worstInner = (ll)ceil(idealBuck / 2) * ceil(idealBuck / 2) + 5;
  
  
  vector<Oper> operation_queue;

  int lastans = 0;
  
  auto flush_queue = [&]() {
    vector<int> Ks;
    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;
        }
        
        cout << lastans << '\n';
      }
    }
    
    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[0] = 1;
      cnt[1] = 0;
    }
  }
  
  return 0;
}

/**
  Anul asta nu se da centroid
  -- Rugaciunile mele
*/

Compilation message

segments.cpp:51:4: warning: #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia [-Wcpp]
   51 |   #warning theyre out here saying ca daca le tii in map direct e O(N) toata chestia
      |    ^~~~~~~
segments.cpp:52:4: warning: #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv) [-Wcpp]
   52 |   #warning poate e doar Bmax sau ceva (700) (pt MLE sau cv)
      |    ^~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:195:12: warning: unused variable 'worstInner' [-Wunused-variable]
  195 |   const ll worstInner = (ll)ceil(idealBuck / 2) * ceil(idealBuck / 2) + 5;
      |            ^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 15 ms 9856 KB Output is correct
6 Correct 17 ms 9564 KB Output is correct
7 Correct 8 ms 8900 KB Output is correct
8 Correct 12 ms 9308 KB Output is correct
9 Correct 10 ms 9304 KB Output is correct
10 Correct 12 ms 9820 KB Output is correct
11 Correct 19 ms 9308 KB Output is correct
12 Correct 19 ms 9308 KB Output is correct
13 Correct 12 ms 9820 KB Output is correct
14 Correct 15 ms 9368 KB Output is correct
15 Correct 5 ms 8536 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 11 ms 9052 KB Output is correct
18 Correct 12 ms 9564 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2786 ms 23260 KB Output is correct
2 Correct 2879 ms 24804 KB Output is correct
3 Correct 2614 ms 24756 KB Output is correct
4 Correct 2868 ms 26088 KB Output is correct
5 Correct 3512 ms 35656 KB Output is correct
6 Correct 3462 ms 36252 KB Output is correct
7 Correct 2755 ms 24784 KB Output is correct
8 Correct 2699 ms 24968 KB Output is correct
9 Correct 2731 ms 24608 KB Output is correct
10 Correct 1459 ms 17464 KB Output is correct
11 Correct 1715 ms 19160 KB Output is correct
12 Correct 3316 ms 29808 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 9124 KB Output is correct
2 Correct 79 ms 9044 KB Output is correct
3 Correct 86 ms 9812 KB Output is correct
4 Correct 73 ms 9044 KB Output is correct
5 Correct 2533 ms 28036 KB Output is correct
6 Correct 2179 ms 27412 KB Output is correct
7 Correct 2375 ms 28280 KB Output is correct
8 Correct 3459 ms 35316 KB Output is correct
9 Correct 3231 ms 34464 KB Output is correct
10 Correct 2411 ms 28008 KB Output is correct
11 Correct 149 ms 11856 KB Output is correct
12 Correct 2425 ms 28764 KB Output is correct
13 Correct 2000 ms 25928 KB Output is correct
14 Correct 860 ms 18452 KB Output is correct
15 Correct 773 ms 17576 KB Output is correct
16 Correct 463 ms 15060 KB Output is correct
17 Correct 1656 ms 24272 KB Output is correct
18 Correct 1751 ms 24220 KB Output is correct
19 Correct 1581 ms 24536 KB Output is correct
20 Correct 1777 ms 24428 KB Output is correct
21 Correct 183 ms 12168 KB Output is correct
22 Correct 1072 ms 20552 KB Output is correct
23 Correct 1723 ms 23744 KB Output is correct
24 Correct 1165 ms 21132 KB Output is correct
25 Correct 81 ms 10876 KB Output is correct
26 Correct 85 ms 10888 KB Output is correct
27 Correct 75 ms 10860 KB Output is correct
28 Correct 73 ms 10836 KB Output is correct
29 Correct 1778 ms 24864 KB Output is correct
30 Correct 1853 ms 24712 KB Output is correct
31 Correct 3158 ms 34540 KB Output is correct
32 Correct 2266 ms 27908 KB Output is correct
33 Correct 2123 ms 26444 KB Output is correct
34 Correct 717 ms 17064 KB Output is correct
35 Correct 1625 ms 23332 KB Output is correct
36 Correct 2765 ms 27376 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 9064 KB Output is correct
2 Correct 87 ms 8868 KB Output is correct
3 Correct 90 ms 8896 KB Output is correct
4 Correct 108 ms 8908 KB Output is correct
5 Correct 3690 ms 29460 KB Output is correct
6 Correct 1317 ms 15844 KB Output is correct
7 Correct 3607 ms 32848 KB Output is correct
8 Correct 1509 ms 17592 KB Output is correct
9 Correct 1535 ms 20340 KB Output is correct
10 Correct 3073 ms 29300 KB Output is correct
11 Correct 611 ms 14548 KB Output is correct
12 Correct 3466 ms 35816 KB Output is correct
13 Correct 2439 ms 26196 KB Output is correct
14 Correct 1261 ms 19304 KB Output is correct
15 Correct 3372 ms 33876 KB Output is correct
16 Correct 2584 ms 27464 KB Output is correct
17 Correct 2676 ms 24604 KB Output is correct
18 Correct 2886 ms 24720 KB Output is correct
19 Correct 2775 ms 24760 KB Output is correct
20 Correct 2782 ms 24968 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 0 ms 2396 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 15 ms 9856 KB Output is correct
6 Correct 17 ms 9564 KB Output is correct
7 Correct 8 ms 8900 KB Output is correct
8 Correct 12 ms 9308 KB Output is correct
9 Correct 10 ms 9304 KB Output is correct
10 Correct 12 ms 9820 KB Output is correct
11 Correct 19 ms 9308 KB Output is correct
12 Correct 19 ms 9308 KB Output is correct
13 Correct 12 ms 9820 KB Output is correct
14 Correct 15 ms 9368 KB Output is correct
15 Correct 5 ms 8536 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 11 ms 9052 KB Output is correct
18 Correct 12 ms 9564 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 2786 ms 23260 KB Output is correct
22 Correct 2879 ms 24804 KB Output is correct
23 Correct 2614 ms 24756 KB Output is correct
24 Correct 2868 ms 26088 KB Output is correct
25 Correct 3512 ms 35656 KB Output is correct
26 Correct 3462 ms 36252 KB Output is correct
27 Correct 2755 ms 24784 KB Output is correct
28 Correct 2699 ms 24968 KB Output is correct
29 Correct 2731 ms 24608 KB Output is correct
30 Correct 1459 ms 17464 KB Output is correct
31 Correct 1715 ms 19160 KB Output is correct
32 Correct 3316 ms 29808 KB Output is correct
33 Correct 84 ms 9064 KB Output is correct
34 Correct 87 ms 8868 KB Output is correct
35 Correct 90 ms 8896 KB Output is correct
36 Correct 108 ms 8908 KB Output is correct
37 Correct 3690 ms 29460 KB Output is correct
38 Correct 1317 ms 15844 KB Output is correct
39 Correct 3607 ms 32848 KB Output is correct
40 Correct 1509 ms 17592 KB Output is correct
41 Correct 1535 ms 20340 KB Output is correct
42 Correct 3073 ms 29300 KB Output is correct
43 Correct 611 ms 14548 KB Output is correct
44 Correct 3466 ms 35816 KB Output is correct
45 Correct 2439 ms 26196 KB Output is correct
46 Correct 1261 ms 19304 KB Output is correct
47 Correct 3372 ms 33876 KB Output is correct
48 Correct 2584 ms 27464 KB Output is correct
49 Correct 2676 ms 24604 KB Output is correct
50 Correct 2886 ms 24720 KB Output is correct
51 Correct 2775 ms 24760 KB Output is correct
52 Correct 2782 ms 24968 KB Output is correct
53 Correct 96 ms 11048 KB Output is correct
54 Correct 95 ms 11068 KB Output is correct
55 Correct 90 ms 11184 KB Output is correct
56 Correct 89 ms 11180 KB Output is correct
57 Correct 2013 ms 20364 KB Output is correct
58 Correct 1026 ms 14856 KB Output is correct
59 Correct 3255 ms 27828 KB Output is correct
60 Correct 943 ms 14056 KB Output is correct
61 Correct 2709 ms 26348 KB Output is correct
62 Correct 3442 ms 33188 KB Output is correct
63 Correct 3401 ms 35216 KB Output is correct
64 Correct 3409 ms 33572 KB Output is correct
65 Correct 760 ms 16200 KB Output is correct
66 Correct 639 ms 14848 KB Output is correct
67 Correct 2767 ms 27672 KB Output is correct
68 Correct 2007 ms 23432 KB Output is correct
69 Correct 2758 ms 24848 KB Output is correct
70 Correct 2765 ms 25100 KB Output is correct
71 Correct 2791 ms 24732 KB Output is correct
72 Correct 2727 ms 24696 KB Output is correct
73 Correct 1000 ms 17100 KB Output is correct
74 Correct 2134 ms 23316 KB Output is correct
75 Correct 3433 ms 36704 KB Output is correct
76 Correct 3369 ms 35148 KB Output is correct
77 Correct 96 ms 11296 KB Output is correct
78 Correct 86 ms 11176 KB Output is correct
79 Correct 94 ms 11084 KB Output is correct
80 Correct 91 ms 11088 KB Output is correct
81 Correct 1987 ms 22672 KB Output is correct
82 Correct 1002 ms 17484 KB Output is correct
83 Correct 583 ms 14272 KB Output is correct
84 Correct 2001 ms 23028 KB Output is correct
85 Correct 2708 ms 27928 KB Output is correct
86 Correct 2916 ms 28464 KB Output is correct
87 Correct 1459 ms 20544 KB Output is correct
88 Correct 551 ms 14260 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 0 ms 2396 KB Output is correct
3 Correct 5 ms 8540 KB Output is correct
4 Correct 6 ms 8540 KB Output is correct
5 Correct 15 ms 9856 KB Output is correct
6 Correct 17 ms 9564 KB Output is correct
7 Correct 8 ms 8900 KB Output is correct
8 Correct 12 ms 9308 KB Output is correct
9 Correct 10 ms 9304 KB Output is correct
10 Correct 12 ms 9820 KB Output is correct
11 Correct 19 ms 9308 KB Output is correct
12 Correct 19 ms 9308 KB Output is correct
13 Correct 12 ms 9820 KB Output is correct
14 Correct 15 ms 9368 KB Output is correct
15 Correct 5 ms 8536 KB Output is correct
16 Correct 6 ms 8540 KB Output is correct
17 Correct 11 ms 9052 KB Output is correct
18 Correct 12 ms 9564 KB Output is correct
19 Correct 9 ms 9052 KB Output is correct
20 Correct 8 ms 9052 KB Output is correct
21 Correct 2786 ms 23260 KB Output is correct
22 Correct 2879 ms 24804 KB Output is correct
23 Correct 2614 ms 24756 KB Output is correct
24 Correct 2868 ms 26088 KB Output is correct
25 Correct 3512 ms 35656 KB Output is correct
26 Correct 3462 ms 36252 KB Output is correct
27 Correct 2755 ms 24784 KB Output is correct
28 Correct 2699 ms 24968 KB Output is correct
29 Correct 2731 ms 24608 KB Output is correct
30 Correct 1459 ms 17464 KB Output is correct
31 Correct 1715 ms 19160 KB Output is correct
32 Correct 3316 ms 29808 KB Output is correct
33 Correct 74 ms 9124 KB Output is correct
34 Correct 79 ms 9044 KB Output is correct
35 Correct 86 ms 9812 KB Output is correct
36 Correct 73 ms 9044 KB Output is correct
37 Correct 2533 ms 28036 KB Output is correct
38 Correct 2179 ms 27412 KB Output is correct
39 Correct 2375 ms 28280 KB Output is correct
40 Correct 3459 ms 35316 KB Output is correct
41 Correct 3231 ms 34464 KB Output is correct
42 Correct 2411 ms 28008 KB Output is correct
43 Correct 149 ms 11856 KB Output is correct
44 Correct 2425 ms 28764 KB Output is correct
45 Correct 2000 ms 25928 KB Output is correct
46 Correct 860 ms 18452 KB Output is correct
47 Correct 773 ms 17576 KB Output is correct
48 Correct 463 ms 15060 KB Output is correct
49 Correct 1656 ms 24272 KB Output is correct
50 Correct 1751 ms 24220 KB Output is correct
51 Correct 1581 ms 24536 KB Output is correct
52 Correct 1777 ms 24428 KB Output is correct
53 Correct 183 ms 12168 KB Output is correct
54 Correct 1072 ms 20552 KB Output is correct
55 Correct 1723 ms 23744 KB Output is correct
56 Correct 1165 ms 21132 KB Output is correct
57 Correct 81 ms 10876 KB Output is correct
58 Correct 85 ms 10888 KB Output is correct
59 Correct 75 ms 10860 KB Output is correct
60 Correct 73 ms 10836 KB Output is correct
61 Correct 1778 ms 24864 KB Output is correct
62 Correct 1853 ms 24712 KB Output is correct
63 Correct 3158 ms 34540 KB Output is correct
64 Correct 2266 ms 27908 KB Output is correct
65 Correct 2123 ms 26444 KB Output is correct
66 Correct 717 ms 17064 KB Output is correct
67 Correct 1625 ms 23332 KB Output is correct
68 Correct 2765 ms 27376 KB Output is correct
69 Correct 84 ms 9064 KB Output is correct
70 Correct 87 ms 8868 KB Output is correct
71 Correct 90 ms 8896 KB Output is correct
72 Correct 108 ms 8908 KB Output is correct
73 Correct 3690 ms 29460 KB Output is correct
74 Correct 1317 ms 15844 KB Output is correct
75 Correct 3607 ms 32848 KB Output is correct
76 Correct 1509 ms 17592 KB Output is correct
77 Correct 1535 ms 20340 KB Output is correct
78 Correct 3073 ms 29300 KB Output is correct
79 Correct 611 ms 14548 KB Output is correct
80 Correct 3466 ms 35816 KB Output is correct
81 Correct 2439 ms 26196 KB Output is correct
82 Correct 1261 ms 19304 KB Output is correct
83 Correct 3372 ms 33876 KB Output is correct
84 Correct 2584 ms 27464 KB Output is correct
85 Correct 2676 ms 24604 KB Output is correct
86 Correct 2886 ms 24720 KB Output is correct
87 Correct 2775 ms 24760 KB Output is correct
88 Correct 2782 ms 24968 KB Output is correct
89 Correct 96 ms 11048 KB Output is correct
90 Correct 95 ms 11068 KB Output is correct
91 Correct 90 ms 11184 KB Output is correct
92 Correct 89 ms 11180 KB Output is correct
93 Correct 2013 ms 20364 KB Output is correct
94 Correct 1026 ms 14856 KB Output is correct
95 Correct 3255 ms 27828 KB Output is correct
96 Correct 943 ms 14056 KB Output is correct
97 Correct 2709 ms 26348 KB Output is correct
98 Correct 3442 ms 33188 KB Output is correct
99 Correct 3401 ms 35216 KB Output is correct
100 Correct 3409 ms 33572 KB Output is correct
101 Correct 760 ms 16200 KB Output is correct
102 Correct 639 ms 14848 KB Output is correct
103 Correct 2767 ms 27672 KB Output is correct
104 Correct 2007 ms 23432 KB Output is correct
105 Correct 2758 ms 24848 KB Output is correct
106 Correct 2765 ms 25100 KB Output is correct
107 Correct 2791 ms 24732 KB Output is correct
108 Correct 2727 ms 24696 KB Output is correct
109 Correct 1000 ms 17100 KB Output is correct
110 Correct 2134 ms 23316 KB Output is correct
111 Correct 3433 ms 36704 KB Output is correct
112 Correct 3369 ms 35148 KB Output is correct
113 Correct 96 ms 11296 KB Output is correct
114 Correct 86 ms 11176 KB Output is correct
115 Correct 94 ms 11084 KB Output is correct
116 Correct 91 ms 11088 KB Output is correct
117 Correct 1987 ms 22672 KB Output is correct
118 Correct 1002 ms 17484 KB Output is correct
119 Correct 583 ms 14272 KB Output is correct
120 Correct 2001 ms 23028 KB Output is correct
121 Correct 2708 ms 27928 KB Output is correct
122 Correct 2916 ms 28464 KB Output is correct
123 Correct 1459 ms 20544 KB Output is correct
124 Correct 551 ms 14260 KB Output is correct
125 Correct 187 ms 13532 KB Output is correct
126 Correct 193 ms 13804 KB Output is correct
127 Correct 242 ms 13908 KB Output is correct
128 Correct 211 ms 13628 KB Output is correct
129 Correct 181 ms 13396 KB Output is correct
130 Correct 206 ms 13580 KB Output is correct
131 Correct 3124 ms 21032 KB Output is correct
132 Execution timed out 5034 ms 35212 KB Time limit exceeded
133 Halted 0 ms 0 KB -