oj.uz

Submission #760431

# Submission time Handle Problem Language Result Execution time Memory
760431 2023-06-17T14:50:59 Z Sam_a17 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 6988 KB 
///
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 3e5 + 10, M = 3e5 + 10;
struct query {
  long long l, r, ind;
};
 
long long n, q, a[N], s = 800, bd[N];
long long ans[N];
vector<query> queries;
 
bool cmp(query a, query b) {
  if(a.l / s != b.l / s) {
    return a.l / s < b.l / s;
  }
  return a.r > b.r;
}

long long cur[N], cr[N];
set<int> st;

void add(int ind) {
  if(cur[a[ind]]) {
    cr[cur[a[ind]]]--;
    if(!cr[cur[a[ind]]]) {
      st.erase(cur[a[ind]]);
    }
  }

  cur[a[ind]]++;
  assert(cur[a[ind]] < M);
  cr[cur[a[ind]]]++;
  if(cr[cur[a[ind]]] == 1) {
    st.insert(cur[a[ind]]);
  }
}

void del(int ind) {
  cr[cur[a[ind]]]--;
  if(!cr[cur[a[ind]]]) {
    st.erase(cur[a[ind]]);
  }

  cur[a[ind]]--;
  if(cur[a[ind]]) {
    cr[cur[a[ind]]]++;
    if(cr[cur[a[ind]]] == 1) st.insert(cur[a[ind]]);
  }
}

long long pre(long long x) {
  return x * (x + 1) / 2;
}

long long get(long long all) {
  vector<pair<long long, long long>> vec;
  for(auto i: st) {
    assert(cr[i] < M);
    vec.push_back({i, cr[i]});
  }

  // assert(sz(vec) <= s);
  vector<pair<long long, long long>> lef, rig;

  long long l = 0, r = 0;
  for(auto i: vec) {
    if(l == r) {
      if(i.second % 2 == 1) {
        l += (i.second + 1) / 2;
        r += i.second / 2;
        lef.push_back({i.first, (i.second + 1) / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      } else {
        l += i.second / 2;
        r += i.second / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      }
    } else if(l > r) {
      if(i.second % 2 == 1) {
        l += i.second / 2;
        r += (i.second + 1) / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        rig.push_back({i.first, (i.second + 1) / 2});
      } else {
        l += i.second / 2;
        r += i.second / 2;
        if(i.second / 2) lef.push_back({i.first, i.second / 2});
        if(i.second / 2) rig.push_back({i.first, i.second / 2});
      }
    } else if(l < r) {
      assert(false);
    }
  }

  vector<pair<long long, long long>> curr;
  for(auto i: lef) {
    curr.push_back(i);
  }

  reverse(all(rig));
  for(auto i: rig) {
    curr.push_back(i);
  }

  long long ans = 0;


  // for each block
  for(auto i: vec) {
    ans += i.second * (i.first * (i.first + 1) / 2);
  }

  long long x = 0;
  for(auto i: curr) {
    long long y = all - x - i.first * i.second;

    // assert(i.second < M);
    long long pr = pre(i.second - 1);
    ans += i.second * x * y;
    ans += y * i.first * pr;
    ans += x * i.first * pr;

    ans += i.first * i.first * bd[i.second - 1];


    //
    ans += i.second * x * i.first;
    ans += i.first * i.first * pr;

    ans += i.second * y * i.first;
    ans += i.first * i.first * pr;


    x += i.first * i.second;
  }

  return ans;
}

void solve_() {
  int n, q; cin >> n >> q;
  
  for(int i = 0; i < n; i++) {
    cin >> a[i];
  }

  for(int i = 2; i <= 6; i++) {
    long long s = 0;
    for(int j = 0; j <= i; j++) {
      s += j * (i - j);
    }
    bd[i] = s;
  }

  long long sm = 21;
  for(int i = 7; i < N; i++) {
    bd[i] = bd[i - 1] + sm;
    sm += i;
  }
 
  for(int i = 0; i < q; i++) {
    int a,b; cin >> a >> b;
    queries.push_back({--a, b, i});
  }

  sort(queries.begin(), queries.end(), cmp);

  int l = 0, r = 0;
  for(int i = 0; i < q; i++) {
    int currL = queries[i].l, currR = queries[i].r, idx = queries[i].ind;
    while(r < currR) {
      add(r++);
    }

    while(l > currL) {
      add(--l);
    }

    while(r > currR) {
      del(--r);
    }

    while(l < currL) {
      del(l++);
    }

    ans[idx] = get(currR - currL);
  }
  
  for(int i = 0; i < q; i++) {
    cout << ans[i] << '\n';
  }
}
 
int main() {
  setIO();
  
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

diversity.cpp: In function 'void setIO(std::string)':
diversity.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diversity.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 12 ms 3676 KB Output is correct
5 Correct 24 ms 4740 KB Output is correct
6 Correct 35 ms 5428 KB Output is correct
7 Correct 33 ms 6208 KB Output is correct
8 Correct 36 ms 5348 KB Output is correct
9 Correct 36 ms 5392 KB Output is correct
10 Correct 35 ms 5760 KB Output is correct
11 Correct 41 ms 5536 KB Output is correct
12 Correct 36 ms 5452 KB Output is correct
13 Correct 37 ms 5416 KB Output is correct
14 Correct 35 ms 5580 KB Output is correct
15 Correct 49 ms 5480 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 12 ms 3676 KB Output is correct
5 Correct 24 ms 4740 KB Output is correct
6 Correct 35 ms 5428 KB Output is correct
7 Correct 33 ms 6208 KB Output is correct
8 Correct 36 ms 5348 KB Output is correct
9 Correct 36 ms 5392 KB Output is correct
10 Correct 35 ms 5760 KB Output is correct
11 Correct 41 ms 5536 KB Output is correct
12 Correct 36 ms 5452 KB Output is correct
13 Correct 37 ms 5416 KB Output is correct
14 Correct 35 ms 5580 KB Output is correct
15 Correct 49 ms 5480 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 14 ms 3540 KB Output is correct
20 Correct 27 ms 4484 KB Output is correct
21 Correct 42 ms 5452 KB Output is correct
22 Correct 40 ms 5268 KB Output is correct
23 Correct 49 ms 5400 KB Output is correct
24 Correct 39 ms 5220 KB Output is correct
25 Correct 40 ms 5356 KB Output is correct
26 Correct 40 ms 5288 KB Output is correct
27 Correct 39 ms 5280 KB Output is correct
28 Correct 54 ms 5580 KB Output is correct
29 Correct 44 ms 5344 KB Output is correct
30 Correct 41 ms 5332 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 12 ms 3676 KB Output is correct
5 Correct 24 ms 4740 KB Output is correct
6 Correct 35 ms 5428 KB Output is correct
7 Correct 33 ms 6208 KB Output is correct
8 Correct 36 ms 5348 KB Output is correct
9 Correct 36 ms 5392 KB Output is correct
10 Correct 35 ms 5760 KB Output is correct
11 Correct 41 ms 5536 KB Output is correct
12 Correct 36 ms 5452 KB Output is correct
13 Correct 37 ms 5416 KB Output is correct
14 Correct 35 ms 5580 KB Output is correct
15 Correct 49 ms 5480 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 14 ms 3540 KB Output is correct
20 Correct 27 ms 4484 KB Output is correct
21 Correct 42 ms 5452 KB Output is correct
22 Correct 40 ms 5268 KB Output is correct
23 Correct 49 ms 5400 KB Output is correct
24 Correct 39 ms 5220 KB Output is correct
25 Correct 40 ms 5356 KB Output is correct
26 Correct 40 ms 5288 KB Output is correct
27 Correct 39 ms 5280 KB Output is correct
28 Correct 54 ms 5580 KB Output is correct
29 Correct 44 ms 5344 KB Output is correct
30 Correct 41 ms 5332 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 4 ms 2784 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 6 ms 3100 KB Output is correct
38 Correct 5 ms 3028 KB Output is correct
39 Correct 14 ms 3484 KB Output is correct
40 Correct 20 ms 4292 KB Output is correct
41 Correct 39 ms 5064 KB Output is correct
42 Correct 33 ms 5052 KB Output is correct
43 Correct 43 ms 5044 KB Output is correct
44 Correct 35 ms 5076 KB Output is correct
45 Correct 35 ms 5060 KB Output is correct
46 Correct 39 ms 5052 KB Output is correct
47 Correct 38 ms 5040 KB Output is correct
48 Correct 35 ms 5040 KB Output is correct
49 Correct 34 ms 5120 KB Output is correct
50 Correct 35 ms 5132 KB Output is correct
51 Correct 37 ms 5116 KB Output is correct
52 Correct 33 ms 5068 KB Output is correct
53 Correct 33 ms 5060 KB Output is correct
54 Correct 33 ms 5084 KB Output is correct
55 Correct 45 ms 5096 KB Output is correct
56 Correct 34 ms 5076 KB Output is correct
57 Correct 31 ms 5072 KB Output is correct
58 Correct 38 ms 5056 KB Output is correct
59 Correct 33 ms 5060 KB Output is correct
60 Correct 42 ms 5076 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 12 ms 3676 KB Output is correct
15 Correct 24 ms 4740 KB Output is correct
16 Correct 35 ms 5428 KB Output is correct
17 Correct 33 ms 6208 KB Output is correct
18 Correct 36 ms 5348 KB Output is correct
19 Correct 36 ms 5392 KB Output is correct
20 Correct 35 ms 5760 KB Output is correct
21 Correct 41 ms 5536 KB Output is correct
22 Correct 36 ms 5452 KB Output is correct
23 Correct 37 ms 5416 KB Output is correct
24 Correct 35 ms 5580 KB Output is correct
25 Correct 49 ms 5480 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 14 ms 3540 KB Output is correct
30 Correct 27 ms 4484 KB Output is correct
31 Correct 42 ms 5452 KB Output is correct
32 Correct 40 ms 5268 KB Output is correct
33 Correct 49 ms 5400 KB Output is correct
34 Correct 39 ms 5220 KB Output is correct
35 Correct 40 ms 5356 KB Output is correct
36 Correct 40 ms 5288 KB Output is correct
37 Correct 39 ms 5280 KB Output is correct
38 Correct 54 ms 5580 KB Output is correct
39 Correct 44 ms 5344 KB Output is correct
40 Correct 41 ms 5332 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 4 ms 2784 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 3 ms 2772 KB Output is correct
47 Correct 6 ms 3100 KB Output is correct
48 Correct 5 ms 3028 KB Output is correct
49 Correct 14 ms 3484 KB Output is correct
50 Correct 20 ms 4292 KB Output is correct
51 Correct 39 ms 5064 KB Output is correct
52 Correct 33 ms 5052 KB Output is correct
53 Correct 43 ms 5044 KB Output is correct
54 Correct 35 ms 5076 KB Output is correct
55 Correct 35 ms 5060 KB Output is correct
56 Correct 39 ms 5052 KB Output is correct
57 Correct 38 ms 5040 KB Output is correct
58 Correct 35 ms 5040 KB Output is correct
59 Correct 34 ms 5120 KB Output is correct
60 Correct 35 ms 5132 KB Output is correct
61 Correct 37 ms 5116 KB Output is correct
62 Correct 33 ms 5068 KB Output is correct
63 Correct 33 ms 5060 KB Output is correct
64 Correct 33 ms 5084 KB Output is correct
65 Correct 45 ms 5096 KB Output is correct
66 Correct 34 ms 5076 KB Output is correct
67 Correct 31 ms 5072 KB Output is correct
68 Correct 38 ms 5056 KB Output is correct
69 Correct 33 ms 5060 KB Output is correct
70 Correct 42 ms 5076 KB Output is correct
71 Correct 5 ms 3028 KB Output is correct
72 Correct 6 ms 3028 KB Output is correct
73 Correct 7 ms 3028 KB Output is correct
74 Correct 5 ms 3028 KB Output is correct
75 Correct 5 ms 3128 KB Output is correct
76 Correct 8 ms 3540 KB Output is correct
77 Correct 8 ms 3540 KB Output is correct
78 Correct 11 ms 3540 KB Output is correct
79 Correct 8 ms 3540 KB Output is correct
80 Correct 8 ms 3540 KB Output is correct
81 Correct 17 ms 4332 KB Output is correct
82 Correct 13 ms 4276 KB Output is correct
83 Correct 14 ms 4308 KB Output is correct
84 Correct 17 ms 4268 KB Output is correct
85 Correct 14 ms 4260 KB Output is correct
86 Correct 14 ms 4428 KB Output is correct
87 Correct 14 ms 4436 KB Output is correct
88 Correct 17 ms 4436 KB Output is correct
89 Correct 15 ms 4332 KB Output is correct
90 Correct 15 ms 4436 KB Output is correct
91 Correct 24 ms 5716 KB Output is correct
92 Correct 22 ms 5812 KB Output is correct
93 Correct 23 ms 5808 KB Output is correct
94 Correct 23 ms 5724 KB Output is correct
95 Correct 23 ms 5756 KB Output is correct
96 Correct 24 ms 6572 KB Output is correct
97 Correct 27 ms 6584 KB Output is correct
98 Correct 27 ms 6480 KB Output is correct
99 Correct 24 ms 6600 KB Output is correct
100 Correct 25 ms 6496 KB Output is correct
101 Correct 24 ms 6528 KB Output is correct
102 Correct 26 ms 6584 KB Output is correct
103 Correct 25 ms 6476 KB Output is correct
104 Correct 24 ms 6484 KB Output is correct
105 Correct 35 ms 6476 KB Output is correct
106 Correct 28 ms 6972 KB Output is correct
107 Correct 28 ms 6924 KB Output is correct
108 Correct 24 ms 6988 KB Output is correct
109 Correct 30 ms 6980 KB Output is correct
110 Correct 32 ms 6960 KB Output is correct
111 Correct 24 ms 6924 KB Output is correct
112 Correct 31 ms 6964 KB Output is correct
113 Correct 24 ms 6892 KB Output is correct
114 Correct 33 ms 6896 KB Output is correct
115 Correct 24 ms 6932 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2772 KB Output is correct
14 Correct 12 ms 3676 KB Output is correct
15 Correct 24 ms 4740 KB Output is correct
16 Correct 35 ms 5428 KB Output is correct
17 Correct 33 ms 6208 KB Output is correct
18 Correct 36 ms 5348 KB Output is correct
19 Correct 36 ms 5392 KB Output is correct
20 Correct 35 ms 5760 KB Output is correct
21 Correct 41 ms 5536 KB Output is correct
22 Correct 36 ms 5452 KB Output is correct
23 Correct 37 ms 5416 KB Output is correct
24 Correct 35 ms 5580 KB Output is correct
25 Correct 49 ms 5480 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 14 ms 3540 KB Output is correct
30 Correct 27 ms 4484 KB Output is correct
31 Correct 42 ms 5452 KB Output is correct
32 Correct 40 ms 5268 KB Output is correct
33 Correct 49 ms 5400 KB Output is correct
34 Correct 39 ms 5220 KB Output is correct
35 Correct 40 ms 5356 KB Output is correct
36 Correct 40 ms 5288 KB Output is correct
37 Correct 39 ms 5280 KB Output is correct
38 Correct 54 ms 5580 KB Output is correct
39 Correct 44 ms 5344 KB Output is correct
40 Correct 41 ms 5332 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 4 ms 2784 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 3 ms 2772 KB Output is correct
47 Correct 6 ms 3100 KB Output is correct
48 Correct 5 ms 3028 KB Output is correct
49 Correct 14 ms 3484 KB Output is correct
50 Correct 20 ms 4292 KB Output is correct
51 Correct 39 ms 5064 KB Output is correct
52 Correct 33 ms 5052 KB Output is correct
53 Correct 43 ms 5044 KB Output is correct
54 Correct 35 ms 5076 KB Output is correct
55 Correct 35 ms 5060 KB Output is correct
56 Correct 39 ms 5052 KB Output is correct
57 Correct 38 ms 5040 KB Output is correct
58 Correct 35 ms 5040 KB Output is correct
59 Correct 34 ms 5120 KB Output is correct
60 Correct 35 ms 5132 KB Output is correct
61 Correct 37 ms 5116 KB Output is correct
62 Correct 33 ms 5068 KB Output is correct
63 Correct 33 ms 5060 KB Output is correct
64 Correct 33 ms 5084 KB Output is correct
65 Correct 45 ms 5096 KB Output is correct
66 Correct 34 ms 5076 KB Output is correct
67 Correct 31 ms 5072 KB Output is correct
68 Correct 38 ms 5056 KB Output is correct
69 Correct 33 ms 5060 KB Output is correct
70 Correct 42 ms 5076 KB Output is correct
71 Correct 5 ms 3028 KB Output is correct
72 Correct 6 ms 3028 KB Output is correct
73 Correct 7 ms 3028 KB Output is correct
74 Correct 5 ms 3028 KB Output is correct
75 Correct 5 ms 3128 KB Output is correct
76 Correct 8 ms 3540 KB Output is correct
77 Correct 8 ms 3540 KB Output is correct
78 Correct 11 ms 3540 KB Output is correct
79 Correct 8 ms 3540 KB Output is correct
80 Correct 8 ms 3540 KB Output is correct
81 Correct 17 ms 4332 KB Output is correct
82 Correct 13 ms 4276 KB Output is correct
83 Correct 14 ms 4308 KB Output is correct
84 Correct 17 ms 4268 KB Output is correct
85 Correct 14 ms 4260 KB Output is correct
86 Correct 14 ms 4428 KB Output is correct
87 Correct 14 ms 4436 KB Output is correct
88 Correct 17 ms 4436 KB Output is correct
89 Correct 15 ms 4332 KB Output is correct
90 Correct 15 ms 4436 KB Output is correct
91 Correct 24 ms 5716 KB Output is correct
92 Correct 22 ms 5812 KB Output is correct
93 Correct 23 ms 5808 KB Output is correct
94 Correct 23 ms 5724 KB Output is correct
95 Correct 23 ms 5756 KB Output is correct
96 Correct 24 ms 6572 KB Output is correct
97 Correct 27 ms 6584 KB Output is correct
98 Correct 27 ms 6480 KB Output is correct
99 Correct 24 ms 6600 KB Output is correct
100 Correct 25 ms 6496 KB Output is correct
101 Correct 24 ms 6528 KB Output is correct
102 Correct 26 ms 6584 KB Output is correct
103 Correct 25 ms 6476 KB Output is correct
104 Correct 24 ms 6484 KB Output is correct
105 Correct 35 ms 6476 KB Output is correct
106 Correct 28 ms 6972 KB Output is correct
107 Correct 28 ms 6924 KB Output is correct
108 Correct 24 ms 6988 KB Output is correct
109 Correct 30 ms 6980 KB Output is correct
110 Correct 32 ms 6960 KB Output is correct
111 Correct 24 ms 6924 KB Output is correct
112 Correct 31 ms 6964 KB Output is correct
113 Correct 24 ms 6892 KB Output is correct
114 Correct 33 ms 6896 KB Output is correct
115 Correct 24 ms 6932 KB Output is correct
116 Correct 1114 ms 4852 KB Output is correct
117 Correct 888 ms 4852 KB Output is correct
118 Correct 1617 ms 5308 KB Output is correct
119 Correct 718 ms 5296 KB Output is correct
120 Correct 403 ms 5304 KB Output is correct
121 Correct 888 ms 5692 KB Output is correct
122 Correct 495 ms 5700 KB Output is correct
123 Correct 2586 ms 6608 KB Output is correct
124 Correct 669 ms 6628 KB Output is correct
125 Correct 463 ms 6668 KB Output is correct
126 Execution timed out 7064 ms 6732 KB Time limit exceeded
127 Halted 0 ms 0 KB -