oj.uz

답안 #760393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760393 2023-06-17T14:30:45 Z Sam_a17 Diversity (CEOI21_diversity) C++17
64 / 100
 3117 ms 16716 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 = 4e5 + 10;
struct query {
  long long l, r, ind;
};
 
long long n, q, a[N], s = 550, qar[N], 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]]++;
  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]]--;
  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) {
    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;


    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(long long i = 1; i <= n; i++) {
    qar[i] = qar[i - 1] + i * 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3384 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 3 ms 3668 KB Output is correct
4 Correct 14 ms 5168 KB Output is correct
5 Correct 24 ms 7124 KB Output is correct
6 Correct 37 ms 8520 KB Output is correct
7 Correct 39 ms 9380 KB Output is correct
8 Correct 37 ms 8544 KB Output is correct
9 Correct 37 ms 8496 KB Output is correct
10 Correct 47 ms 8928 KB Output is correct
11 Correct 37 ms 8740 KB Output is correct
12 Correct 38 ms 8476 KB Output is correct
13 Correct 38 ms 8524 KB Output is correct
14 Correct 45 ms 8724 KB Output is correct
15 Correct 44 ms 8708 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 3 ms 3668 KB Output is correct
4 Correct 14 ms 5168 KB Output is correct
5 Correct 24 ms 7124 KB Output is correct
6 Correct 37 ms 8520 KB Output is correct
7 Correct 39 ms 9380 KB Output is correct
8 Correct 37 ms 8544 KB Output is correct
9 Correct 37 ms 8496 KB Output is correct
10 Correct 47 ms 8928 KB Output is correct
11 Correct 37 ms 8740 KB Output is correct
12 Correct 38 ms 8476 KB Output is correct
13 Correct 38 ms 8524 KB Output is correct
14 Correct 45 ms 8724 KB Output is correct
15 Correct 44 ms 8708 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 5 ms 3552 KB Output is correct
19 Correct 21 ms 5076 KB Output is correct
20 Correct 33 ms 6732 KB Output is correct
21 Correct 41 ms 8616 KB Output is correct
22 Correct 51 ms 8456 KB Output is correct
23 Correct 51 ms 8560 KB Output is correct
24 Correct 54 ms 8460 KB Output is correct
25 Correct 42 ms 8452 KB Output is correct
26 Correct 44 ms 8388 KB Output is correct
27 Correct 44 ms 8472 KB Output is correct
28 Correct 45 ms 8756 KB Output is correct
29 Correct 48 ms 8464 KB Output is correct
30 Correct 51 ms 8508 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 3 ms 3668 KB Output is correct
4 Correct 14 ms 5168 KB Output is correct
5 Correct 24 ms 7124 KB Output is correct
6 Correct 37 ms 8520 KB Output is correct
7 Correct 39 ms 9380 KB Output is correct
8 Correct 37 ms 8544 KB Output is correct
9 Correct 37 ms 8496 KB Output is correct
10 Correct 47 ms 8928 KB Output is correct
11 Correct 37 ms 8740 KB Output is correct
12 Correct 38 ms 8476 KB Output is correct
13 Correct 38 ms 8524 KB Output is correct
14 Correct 45 ms 8724 KB Output is correct
15 Correct 44 ms 8708 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 5 ms 3552 KB Output is correct
19 Correct 21 ms 5076 KB Output is correct
20 Correct 33 ms 6732 KB Output is correct
21 Correct 41 ms 8616 KB Output is correct
22 Correct 51 ms 8456 KB Output is correct
23 Correct 51 ms 8560 KB Output is correct
24 Correct 54 ms 8460 KB Output is correct
25 Correct 42 ms 8452 KB Output is correct
26 Correct 44 ms 8388 KB Output is correct
27 Correct 44 ms 8472 KB Output is correct
28 Correct 45 ms 8756 KB Output is correct
29 Correct 48 ms 8464 KB Output is correct
30 Correct 51 ms 8508 KB Output is correct
31 Correct 3 ms 3412 KB Output is correct
32 Correct 3 ms 3412 KB Output is correct
33 Correct 3 ms 3412 KB Output is correct
34 Correct 5 ms 3596 KB Output is correct
35 Correct 4 ms 3668 KB Output is correct
36 Correct 4 ms 3668 KB Output is correct
37 Correct 8 ms 4308 KB Output is correct
38 Correct 6 ms 4208 KB Output is correct
39 Correct 11 ms 5016 KB Output is correct
40 Correct 23 ms 6628 KB Output is correct
41 Correct 38 ms 8216 KB Output is correct
42 Correct 36 ms 8216 KB Output is correct
43 Correct 35 ms 8184 KB Output is correct
44 Correct 41 ms 8212 KB Output is correct
45 Correct 48 ms 8216 KB Output is correct
46 Correct 42 ms 8208 KB Output is correct
47 Correct 38 ms 8308 KB Output is correct
48 Correct 42 ms 8216 KB Output is correct
49 Correct 46 ms 8208 KB Output is correct
50 Correct 35 ms 8224 KB Output is correct
51 Correct 47 ms 8216 KB Output is correct
52 Correct 39 ms 8220 KB Output is correct
53 Correct 46 ms 8176 KB Output is correct
54 Correct 44 ms 8252 KB Output is correct
55 Correct 44 ms 8256 KB Output is correct
56 Correct 40 ms 8268 KB Output is correct
57 Correct 34 ms 8200 KB Output is correct
58 Correct 38 ms 8244 KB Output is correct
59 Correct 37 ms 8172 KB Output is correct
60 Correct 42 ms 8216 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3384 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 3 ms 3412 KB Output is correct
13 Correct 3 ms 3668 KB Output is correct
14 Correct 14 ms 5168 KB Output is correct
15 Correct 24 ms 7124 KB Output is correct
16 Correct 37 ms 8520 KB Output is correct
17 Correct 39 ms 9380 KB Output is correct
18 Correct 37 ms 8544 KB Output is correct
19 Correct 37 ms 8496 KB Output is correct
20 Correct 47 ms 8928 KB Output is correct
21 Correct 37 ms 8740 KB Output is correct
22 Correct 38 ms 8476 KB Output is correct
23 Correct 38 ms 8524 KB Output is correct
24 Correct 45 ms 8724 KB Output is correct
25 Correct 44 ms 8708 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 3 ms 3412 KB Output is correct
28 Correct 5 ms 3552 KB Output is correct
29 Correct 21 ms 5076 KB Output is correct
30 Correct 33 ms 6732 KB Output is correct
31 Correct 41 ms 8616 KB Output is correct
32 Correct 51 ms 8456 KB Output is correct
33 Correct 51 ms 8560 KB Output is correct
34 Correct 54 ms 8460 KB Output is correct
35 Correct 42 ms 8452 KB Output is correct
36 Correct 44 ms 8388 KB Output is correct
37 Correct 44 ms 8472 KB Output is correct
38 Correct 45 ms 8756 KB Output is correct
39 Correct 48 ms 8464 KB Output is correct
40 Correct 51 ms 8508 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 3 ms 3412 KB Output is correct
43 Correct 3 ms 3412 KB Output is correct
44 Correct 5 ms 3596 KB Output is correct
45 Correct 4 ms 3668 KB Output is correct
46 Correct 4 ms 3668 KB Output is correct
47 Correct 8 ms 4308 KB Output is correct
48 Correct 6 ms 4208 KB Output is correct
49 Correct 11 ms 5016 KB Output is correct
50 Correct 23 ms 6628 KB Output is correct
51 Correct 38 ms 8216 KB Output is correct
52 Correct 36 ms 8216 KB Output is correct
53 Correct 35 ms 8184 KB Output is correct
54 Correct 41 ms 8212 KB Output is correct
55 Correct 48 ms 8216 KB Output is correct
56 Correct 42 ms 8208 KB Output is correct
57 Correct 38 ms 8308 KB Output is correct
58 Correct 42 ms 8216 KB Output is correct
59 Correct 46 ms 8208 KB Output is correct
60 Correct 35 ms 8224 KB Output is correct
61 Correct 47 ms 8216 KB Output is correct
62 Correct 39 ms 8220 KB Output is correct
63 Correct 46 ms 8176 KB Output is correct
64 Correct 44 ms 8252 KB Output is correct
65 Correct 44 ms 8256 KB Output is correct
66 Correct 40 ms 8268 KB Output is correct
67 Correct 34 ms 8200 KB Output is correct
68 Correct 38 ms 8244 KB Output is correct
69 Correct 37 ms 8172 KB Output is correct
70 Correct 42 ms 8216 KB Output is correct
71 Correct 7 ms 4308 KB Output is correct
72 Correct 8 ms 4308 KB Output is correct
73 Correct 8 ms 4308 KB Output is correct
74 Correct 8 ms 4308 KB Output is correct
75 Correct 7 ms 4308 KB Output is correct
76 Correct 9 ms 5076 KB Output is correct
77 Correct 9 ms 5108 KB Output is correct
78 Correct 11 ms 5048 KB Output is correct
79 Correct 9 ms 5100 KB Output is correct
80 Correct 9 ms 5076 KB Output is correct
81 Correct 16 ms 6644 KB Output is correct
82 Correct 18 ms 6676 KB Output is correct
83 Correct 15 ms 6612 KB Output is correct
84 Correct 18 ms 6708 KB Output is correct
85 Correct 15 ms 6660 KB Output is correct
86 Correct 20 ms 6676 KB Output is correct
87 Correct 21 ms 6740 KB Output is correct
88 Correct 17 ms 6684 KB Output is correct
89 Correct 16 ms 6808 KB Output is correct
90 Correct 16 ms 6740 KB Output is correct
91 Correct 24 ms 8908 KB Output is correct
92 Correct 28 ms 8932 KB Output is correct
93 Correct 26 ms 8880 KB Output is correct
94 Correct 24 ms 8884 KB Output is correct
95 Correct 35 ms 8904 KB Output is correct
96 Correct 39 ms 9724 KB Output is correct
97 Correct 27 ms 9700 KB Output is correct
98 Correct 26 ms 9736 KB Output is correct
99 Correct 27 ms 9652 KB Output is correct
100 Correct 35 ms 9656 KB Output is correct
101 Correct 27 ms 9676 KB Output is correct
102 Correct 34 ms 9684 KB Output is correct
103 Correct 28 ms 9728 KB Output is correct
104 Correct 27 ms 9712 KB Output is correct
105 Correct 27 ms 9732 KB Output is correct
106 Correct 27 ms 10068 KB Output is correct
107 Correct 26 ms 10048 KB Output is correct
108 Correct 27 ms 10068 KB Output is correct
109 Correct 26 ms 10120 KB Output is correct
110 Correct 26 ms 10140 KB Output is correct
111 Correct 26 ms 10096 KB Output is correct
112 Correct 26 ms 10076 KB Output is correct
113 Correct 26 ms 10036 KB Output is correct
114 Correct 33 ms 10020 KB Output is correct
115 Correct 27 ms 10012 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3412 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3384 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 3 ms 3412 KB Output is correct
13 Correct 3 ms 3668 KB Output is correct
14 Correct 14 ms 5168 KB Output is correct
15 Correct 24 ms 7124 KB Output is correct
16 Correct 37 ms 8520 KB Output is correct
17 Correct 39 ms 9380 KB Output is correct
18 Correct 37 ms 8544 KB Output is correct
19 Correct 37 ms 8496 KB Output is correct
20 Correct 47 ms 8928 KB Output is correct
21 Correct 37 ms 8740 KB Output is correct
22 Correct 38 ms 8476 KB Output is correct
23 Correct 38 ms 8524 KB Output is correct
24 Correct 45 ms 8724 KB Output is correct
25 Correct 44 ms 8708 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 3 ms 3412 KB Output is correct
28 Correct 5 ms 3552 KB Output is correct
29 Correct 21 ms 5076 KB Output is correct
30 Correct 33 ms 6732 KB Output is correct
31 Correct 41 ms 8616 KB Output is correct
32 Correct 51 ms 8456 KB Output is correct
33 Correct 51 ms 8560 KB Output is correct
34 Correct 54 ms 8460 KB Output is correct
35 Correct 42 ms 8452 KB Output is correct
36 Correct 44 ms 8388 KB Output is correct
37 Correct 44 ms 8472 KB Output is correct
38 Correct 45 ms 8756 KB Output is correct
39 Correct 48 ms 8464 KB Output is correct
40 Correct 51 ms 8508 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 3 ms 3412 KB Output is correct
43 Correct 3 ms 3412 KB Output is correct
44 Correct 5 ms 3596 KB Output is correct
45 Correct 4 ms 3668 KB Output is correct
46 Correct 4 ms 3668 KB Output is correct
47 Correct 8 ms 4308 KB Output is correct
48 Correct 6 ms 4208 KB Output is correct
49 Correct 11 ms 5016 KB Output is correct
50 Correct 23 ms 6628 KB Output is correct
51 Correct 38 ms 8216 KB Output is correct
52 Correct 36 ms 8216 KB Output is correct
53 Correct 35 ms 8184 KB Output is correct
54 Correct 41 ms 8212 KB Output is correct
55 Correct 48 ms 8216 KB Output is correct
56 Correct 42 ms 8208 KB Output is correct
57 Correct 38 ms 8308 KB Output is correct
58 Correct 42 ms 8216 KB Output is correct
59 Correct 46 ms 8208 KB Output is correct
60 Correct 35 ms 8224 KB Output is correct
61 Correct 47 ms 8216 KB Output is correct
62 Correct 39 ms 8220 KB Output is correct
63 Correct 46 ms 8176 KB Output is correct
64 Correct 44 ms 8252 KB Output is correct
65 Correct 44 ms 8256 KB Output is correct
66 Correct 40 ms 8268 KB Output is correct
67 Correct 34 ms 8200 KB Output is correct
68 Correct 38 ms 8244 KB Output is correct
69 Correct 37 ms 8172 KB Output is correct
70 Correct 42 ms 8216 KB Output is correct
71 Correct 7 ms 4308 KB Output is correct
72 Correct 8 ms 4308 KB Output is correct
73 Correct 8 ms 4308 KB Output is correct
74 Correct 8 ms 4308 KB Output is correct
75 Correct 7 ms 4308 KB Output is correct
76 Correct 9 ms 5076 KB Output is correct
77 Correct 9 ms 5108 KB Output is correct
78 Correct 11 ms 5048 KB Output is correct
79 Correct 9 ms 5100 KB Output is correct
80 Correct 9 ms 5076 KB Output is correct
81 Correct 16 ms 6644 KB Output is correct
82 Correct 18 ms 6676 KB Output is correct
83 Correct 15 ms 6612 KB Output is correct
84 Correct 18 ms 6708 KB Output is correct
85 Correct 15 ms 6660 KB Output is correct
86 Correct 20 ms 6676 KB Output is correct
87 Correct 21 ms 6740 KB Output is correct
88 Correct 17 ms 6684 KB Output is correct
89 Correct 16 ms 6808 KB Output is correct
90 Correct 16 ms 6740 KB Output is correct
91 Correct 24 ms 8908 KB Output is correct
92 Correct 28 ms 8932 KB Output is correct
93 Correct 26 ms 8880 KB Output is correct
94 Correct 24 ms 8884 KB Output is correct
95 Correct 35 ms 8904 KB Output is correct
96 Correct 39 ms 9724 KB Output is correct
97 Correct 27 ms 9700 KB Output is correct
98 Correct 26 ms 9736 KB Output is correct
99 Correct 27 ms 9652 KB Output is correct
100 Correct 35 ms 9656 KB Output is correct
101 Correct 27 ms 9676 KB Output is correct
102 Correct 34 ms 9684 KB Output is correct
103 Correct 28 ms 9728 KB Output is correct
104 Correct 27 ms 9712 KB Output is correct
105 Correct 27 ms 9732 KB Output is correct
106 Correct 27 ms 10068 KB Output is correct
107 Correct 26 ms 10048 KB Output is correct
108 Correct 27 ms 10068 KB Output is correct
109 Correct 26 ms 10120 KB Output is correct
110 Correct 26 ms 10140 KB Output is correct
111 Correct 26 ms 10096 KB Output is correct
112 Correct 26 ms 10076 KB Output is correct
113 Correct 26 ms 10036 KB Output is correct
114 Correct 33 ms 10020 KB Output is correct
115 Correct 27 ms 10012 KB Output is correct
116 Correct 820 ms 5736 KB Output is correct
117 Correct 622 ms 5748 KB Output is correct
118 Correct 1344 ms 6504 KB Output is correct
119 Correct 656 ms 6544 KB Output is correct
120 Correct 369 ms 6492 KB Output is correct
121 Correct 876 ms 7272 KB Output is correct
122 Correct 508 ms 7284 KB Output is correct
123 Correct 3117 ms 8984 KB Output is correct
124 Correct 764 ms 9004 KB Output is correct
125 Runtime error 474 ms 16716 KB Execution killed with signal 11
126 Halted 0 ms 0 KB -