oj.uz

답안 #760443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760443 2023-06-17T14:59:51 Z Sam_a17 Diversity (CEOI21_diversity) C++17
100 / 100
 5736 ms 11328 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 = 700, 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];
vector<int> st;

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

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

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

  cur[a[ind]]--;
  if(cur[a[ind]]) {
    cr[cur[a[ind]]]++;
    if(cr[cur[a[ind]]] == 1) st.push_back(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;
  vector<int> new_st;
  for(auto i: st) {
    if(cr[i]) {
      new_st.push_back(i);
      vec.push_back({i, cr[i]});
    }
  }

  sort(all(new_st));
  uniq(new_st);
  
  st.swap(new_st);

  sort(all(vec));
  uniq(vec)

  // 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

# 결과 실행 시간 메모리 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 2 ms 2644 KB Output is correct
7 Correct 3 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 12 ms 5716 KB Output is correct
6 Correct 17 ms 7632 KB Output is correct
7 Correct 17 ms 8272 KB Output is correct
8 Correct 16 ms 7596 KB Output is correct
9 Correct 16 ms 7596 KB Output is correct
10 Correct 17 ms 7888 KB Output is correct
11 Correct 18 ms 7628 KB Output is correct
12 Correct 17 ms 7604 KB Output is correct
13 Correct 17 ms 7588 KB Output is correct
14 Correct 18 ms 7760 KB Output is correct
15 Correct 16 ms 7632 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 12 ms 5716 KB Output is correct
6 Correct 17 ms 7632 KB Output is correct
7 Correct 17 ms 8272 KB Output is correct
8 Correct 16 ms 7596 KB Output is correct
9 Correct 16 ms 7596 KB Output is correct
10 Correct 17 ms 7888 KB Output is correct
11 Correct 18 ms 7628 KB Output is correct
12 Correct 17 ms 7604 KB Output is correct
13 Correct 17 ms 7588 KB Output is correct
14 Correct 18 ms 7760 KB Output is correct
15 Correct 16 ms 7632 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2724 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 7 ms 4184 KB Output is correct
20 Correct 13 ms 5524 KB Output is correct
21 Correct 19 ms 7544 KB Output is correct
22 Correct 17 ms 7404 KB Output is correct
23 Correct 17 ms 7492 KB Output is correct
24 Correct 18 ms 7400 KB Output is correct
25 Correct 17 ms 7524 KB Output is correct
26 Correct 18 ms 7408 KB Output is correct
27 Correct 17 ms 7496 KB Output is correct
28 Correct 19 ms 7728 KB Output is correct
29 Correct 17 ms 7472 KB Output is correct
30 Correct 17 ms 7504 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 12 ms 5716 KB Output is correct
6 Correct 17 ms 7632 KB Output is correct
7 Correct 17 ms 8272 KB Output is correct
8 Correct 16 ms 7596 KB Output is correct
9 Correct 16 ms 7596 KB Output is correct
10 Correct 17 ms 7888 KB Output is correct
11 Correct 18 ms 7628 KB Output is correct
12 Correct 17 ms 7604 KB Output is correct
13 Correct 17 ms 7588 KB Output is correct
14 Correct 18 ms 7760 KB Output is correct
15 Correct 16 ms 7632 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2724 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 7 ms 4184 KB Output is correct
20 Correct 13 ms 5524 KB Output is correct
21 Correct 19 ms 7544 KB Output is correct
22 Correct 17 ms 7404 KB Output is correct
23 Correct 17 ms 7492 KB Output is correct
24 Correct 18 ms 7400 KB Output is correct
25 Correct 17 ms 7524 KB Output is correct
26 Correct 18 ms 7408 KB Output is correct
27 Correct 17 ms 7496 KB Output is correct
28 Correct 19 ms 7728 KB Output is correct
29 Correct 17 ms 7472 KB Output is correct
30 Correct 17 ms 7504 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 3 ms 2772 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 6 ms 3388 KB Output is correct
38 Correct 7 ms 3156 KB Output is correct
39 Correct 8 ms 4052 KB Output is correct
40 Correct 16 ms 5216 KB Output is correct
41 Correct 25 ms 6996 KB Output is correct
42 Correct 25 ms 6996 KB Output is correct
43 Correct 24 ms 7012 KB Output is correct
44 Correct 29 ms 7012 KB Output is correct
45 Correct 25 ms 6996 KB Output is correct
46 Correct 25 ms 6944 KB Output is correct
47 Correct 24 ms 6888 KB Output is correct
48 Correct 25 ms 6928 KB Output is correct
49 Correct 25 ms 6996 KB Output is correct
50 Correct 27 ms 6956 KB Output is correct
51 Correct 25 ms 6992 KB Output is correct
52 Correct 31 ms 6900 KB Output is correct
53 Correct 24 ms 6996 KB Output is correct
54 Correct 25 ms 7024 KB Output is correct
55 Correct 25 ms 6996 KB Output is correct
56 Correct 24 ms 7004 KB Output is correct
57 Correct 25 ms 6996 KB Output is correct
58 Correct 25 ms 6980 KB Output is correct
59 Correct 25 ms 6996 KB Output is correct
60 Correct 24 ms 6948 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 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 2 ms 2644 KB Output is correct
7 Correct 3 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 2900 KB Output is correct
14 Correct 7 ms 4184 KB Output is correct
15 Correct 12 ms 5716 KB Output is correct
16 Correct 17 ms 7632 KB Output is correct
17 Correct 17 ms 8272 KB Output is correct
18 Correct 16 ms 7596 KB Output is correct
19 Correct 16 ms 7596 KB Output is correct
20 Correct 17 ms 7888 KB Output is correct
21 Correct 18 ms 7628 KB Output is correct
22 Correct 17 ms 7604 KB Output is correct
23 Correct 17 ms 7588 KB Output is correct
24 Correct 18 ms 7760 KB Output is correct
25 Correct 16 ms 7632 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2724 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 7 ms 4184 KB Output is correct
30 Correct 13 ms 5524 KB Output is correct
31 Correct 19 ms 7544 KB Output is correct
32 Correct 17 ms 7404 KB Output is correct
33 Correct 17 ms 7492 KB Output is correct
34 Correct 18 ms 7400 KB Output is correct
35 Correct 17 ms 7524 KB Output is correct
36 Correct 18 ms 7408 KB Output is correct
37 Correct 17 ms 7496 KB Output is correct
38 Correct 19 ms 7728 KB Output is correct
39 Correct 17 ms 7472 KB Output is correct
40 Correct 17 ms 7504 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 3 ms 2772 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 2 ms 2772 KB Output is correct
47 Correct 6 ms 3388 KB Output is correct
48 Correct 7 ms 3156 KB Output is correct
49 Correct 8 ms 4052 KB Output is correct
50 Correct 16 ms 5216 KB Output is correct
51 Correct 25 ms 6996 KB Output is correct
52 Correct 25 ms 6996 KB Output is correct
53 Correct 24 ms 7012 KB Output is correct
54 Correct 29 ms 7012 KB Output is correct
55 Correct 25 ms 6996 KB Output is correct
56 Correct 25 ms 6944 KB Output is correct
57 Correct 24 ms 6888 KB Output is correct
58 Correct 25 ms 6928 KB Output is correct
59 Correct 25 ms 6996 KB Output is correct
60 Correct 27 ms 6956 KB Output is correct
61 Correct 25 ms 6992 KB Output is correct
62 Correct 31 ms 6900 KB Output is correct
63 Correct 24 ms 6996 KB Output is correct
64 Correct 25 ms 7024 KB Output is correct
65 Correct 25 ms 6996 KB Output is correct
66 Correct 24 ms 7004 KB Output is correct
67 Correct 25 ms 6996 KB Output is correct
68 Correct 25 ms 6980 KB Output is correct
69 Correct 25 ms 6996 KB Output is correct
70 Correct 24 ms 6948 KB Output is correct
71 Correct 5 ms 3156 KB Output is correct
72 Correct 5 ms 3156 KB Output is correct
73 Correct 5 ms 3156 KB Output is correct
74 Correct 5 ms 3156 KB Output is correct
75 Correct 5 ms 3124 KB Output is correct
76 Correct 7 ms 3540 KB Output is correct
77 Correct 8 ms 3564 KB Output is correct
78 Correct 8 ms 3464 KB Output is correct
79 Correct 7 ms 3540 KB Output is correct
80 Correct 7 ms 3488 KB Output is correct
81 Correct 16 ms 4308 KB Output is correct
82 Correct 13 ms 4288 KB Output is correct
83 Correct 13 ms 4372 KB Output is correct
84 Correct 13 ms 4308 KB Output is correct
85 Correct 13 ms 4372 KB Output is correct
86 Correct 15 ms 4416 KB Output is correct
87 Correct 15 ms 4436 KB Output is correct
88 Correct 15 ms 4436 KB Output is correct
89 Correct 15 ms 4436 KB Output is correct
90 Correct 14 ms 4436 KB Output is correct
91 Correct 22 ms 5716 KB Output is correct
92 Correct 21 ms 5716 KB Output is correct
93 Correct 21 ms 5800 KB Output is correct
94 Correct 21 ms 5804 KB Output is correct
95 Correct 22 ms 5820 KB Output is correct
96 Correct 25 ms 6552 KB Output is correct
97 Correct 25 ms 6584 KB Output is correct
98 Correct 25 ms 6608 KB Output is correct
99 Correct 24 ms 6580 KB Output is correct
100 Correct 25 ms 6480 KB Output is correct
101 Correct 24 ms 6592 KB Output is correct
102 Correct 25 ms 6508 KB Output is correct
103 Correct 24 ms 6612 KB Output is correct
104 Correct 24 ms 6520 KB Output is correct
105 Correct 25 ms 6496 KB Output is correct
106 Correct 26 ms 6996 KB Output is correct
107 Correct 26 ms 6960 KB Output is correct
108 Correct 27 ms 6924 KB Output is correct
109 Correct 24 ms 6872 KB Output is correct
110 Correct 24 ms 6996 KB Output is correct
111 Correct 24 ms 6944 KB Output is correct
112 Correct 30 ms 6912 KB Output is correct
113 Correct 27 ms 6932 KB Output is correct
114 Correct 24 ms 6892 KB Output is correct
115 Correct 24 ms 6864 KB Output is correct

Subtask #6
36.0 / 36.0

# 결과 실행 시간 메모리 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 2 ms 2644 KB Output is correct
7 Correct 3 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 2900 KB Output is correct
14 Correct 7 ms 4184 KB Output is correct
15 Correct 12 ms 5716 KB Output is correct
16 Correct 17 ms 7632 KB Output is correct
17 Correct 17 ms 8272 KB Output is correct
18 Correct 16 ms 7596 KB Output is correct
19 Correct 16 ms 7596 KB Output is correct
20 Correct 17 ms 7888 KB Output is correct
21 Correct 18 ms 7628 KB Output is correct
22 Correct 17 ms 7604 KB Output is correct
23 Correct 17 ms 7588 KB Output is correct
24 Correct 18 ms 7760 KB Output is correct
25 Correct 16 ms 7632 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2724 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 7 ms 4184 KB Output is correct
30 Correct 13 ms 5524 KB Output is correct
31 Correct 19 ms 7544 KB Output is correct
32 Correct 17 ms 7404 KB Output is correct
33 Correct 17 ms 7492 KB Output is correct
34 Correct 18 ms 7400 KB Output is correct
35 Correct 17 ms 7524 KB Output is correct
36 Correct 18 ms 7408 KB Output is correct
37 Correct 17 ms 7496 KB Output is correct
38 Correct 19 ms 7728 KB Output is correct
39 Correct 17 ms 7472 KB Output is correct
40 Correct 17 ms 7504 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 3 ms 2772 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 2 ms 2772 KB Output is correct
47 Correct 6 ms 3388 KB Output is correct
48 Correct 7 ms 3156 KB Output is correct
49 Correct 8 ms 4052 KB Output is correct
50 Correct 16 ms 5216 KB Output is correct
51 Correct 25 ms 6996 KB Output is correct
52 Correct 25 ms 6996 KB Output is correct
53 Correct 24 ms 7012 KB Output is correct
54 Correct 29 ms 7012 KB Output is correct
55 Correct 25 ms 6996 KB Output is correct
56 Correct 25 ms 6944 KB Output is correct
57 Correct 24 ms 6888 KB Output is correct
58 Correct 25 ms 6928 KB Output is correct
59 Correct 25 ms 6996 KB Output is correct
60 Correct 27 ms 6956 KB Output is correct
61 Correct 25 ms 6992 KB Output is correct
62 Correct 31 ms 6900 KB Output is correct
63 Correct 24 ms 6996 KB Output is correct
64 Correct 25 ms 7024 KB Output is correct
65 Correct 25 ms 6996 KB Output is correct
66 Correct 24 ms 7004 KB Output is correct
67 Correct 25 ms 6996 KB Output is correct
68 Correct 25 ms 6980 KB Output is correct
69 Correct 25 ms 6996 KB Output is correct
70 Correct 24 ms 6948 KB Output is correct
71 Correct 5 ms 3156 KB Output is correct
72 Correct 5 ms 3156 KB Output is correct
73 Correct 5 ms 3156 KB Output is correct
74 Correct 5 ms 3156 KB Output is correct
75 Correct 5 ms 3124 KB Output is correct
76 Correct 7 ms 3540 KB Output is correct
77 Correct 8 ms 3564 KB Output is correct
78 Correct 8 ms 3464 KB Output is correct
79 Correct 7 ms 3540 KB Output is correct
80 Correct 7 ms 3488 KB Output is correct
81 Correct 16 ms 4308 KB Output is correct
82 Correct 13 ms 4288 KB Output is correct
83 Correct 13 ms 4372 KB Output is correct
84 Correct 13 ms 4308 KB Output is correct
85 Correct 13 ms 4372 KB Output is correct
86 Correct 15 ms 4416 KB Output is correct
87 Correct 15 ms 4436 KB Output is correct
88 Correct 15 ms 4436 KB Output is correct
89 Correct 15 ms 4436 KB Output is correct
90 Correct 14 ms 4436 KB Output is correct
91 Correct 22 ms 5716 KB Output is correct
92 Correct 21 ms 5716 KB Output is correct
93 Correct 21 ms 5800 KB Output is correct
94 Correct 21 ms 5804 KB Output is correct
95 Correct 22 ms 5820 KB Output is correct
96 Correct 25 ms 6552 KB Output is correct
97 Correct 25 ms 6584 KB Output is correct
98 Correct 25 ms 6608 KB Output is correct
99 Correct 24 ms 6580 KB Output is correct
100 Correct 25 ms 6480 KB Output is correct
101 Correct 24 ms 6592 KB Output is correct
102 Correct 25 ms 6508 KB Output is correct
103 Correct 24 ms 6612 KB Output is correct
104 Correct 24 ms 6520 KB Output is correct
105 Correct 25 ms 6496 KB Output is correct
106 Correct 26 ms 6996 KB Output is correct
107 Correct 26 ms 6960 KB Output is correct
108 Correct 27 ms 6924 KB Output is correct
109 Correct 24 ms 6872 KB Output is correct
110 Correct 24 ms 6996 KB Output is correct
111 Correct 24 ms 6944 KB Output is correct
112 Correct 30 ms 6912 KB Output is correct
113 Correct 27 ms 6932 KB Output is correct
114 Correct 24 ms 6892 KB Output is correct
115 Correct 24 ms 6864 KB Output is correct
116 Correct 446 ms 4860 KB Output is correct
117 Correct 526 ms 4872 KB Output is correct
118 Correct 694 ms 5624 KB Output is correct
119 Correct 656 ms 5508 KB Output is correct
120 Correct 396 ms 5348 KB Output is correct
121 Correct 824 ms 6276 KB Output is correct
122 Correct 511 ms 5852 KB Output is correct
123 Correct 2189 ms 7840 KB Output is correct
124 Correct 695 ms 6776 KB Output is correct
125 Correct 496 ms 6656 KB Output is correct
126 Correct 4526 ms 8688 KB Output is correct
127 Correct 4679 ms 10500 KB Output is correct
128 Correct 4649 ms 10452 KB Output is correct
129 Correct 4618 ms 10332 KB Output is correct
130 Correct 4827 ms 10320 KB Output is correct
131 Correct 5736 ms 10908 KB Output is correct
132 Correct 5515 ms 10908 KB Output is correct
133 Correct 5425 ms 11080 KB Output is correct
134 Correct 5487 ms 10924 KB Output is correct
135 Correct 5483 ms 10968 KB Output is correct
136 Correct 5467 ms 10904 KB Output is correct
137 Correct 5425 ms 10964 KB Output is correct
138 Correct 5466 ms 10924 KB Output is correct
139 Correct 5493 ms 10944 KB Output is correct
140 Correct 5433 ms 10912 KB Output is correct
141 Correct 4272 ms 10624 KB Output is correct
142 Correct 4439 ms 10656 KB Output is correct
143 Correct 4404 ms 10680 KB Output is correct
144 Correct 4353 ms 10656 KB Output is correct
145 Correct 4355 ms 10604 KB Output is correct
146 Correct 1218 ms 9684 KB Output is correct
147 Correct 1167 ms 9724 KB Output is correct
148 Correct 1257 ms 10088 KB Output is correct
149 Correct 1182 ms 9668 KB Output is correct
150 Correct 1202 ms 9696 KB Output is correct
151 Correct 881 ms 9612 KB Output is correct
152 Correct 892 ms 9636 KB Output is correct
153 Correct 922 ms 9500 KB Output is correct
154 Correct 890 ms 9660 KB Output is correct
155 Correct 867 ms 9600 KB Output is correct
156 Correct 2942 ms 11032 KB Output is correct
157 Correct 2991 ms 11076 KB Output is correct
158 Correct 2929 ms 10964 KB Output is correct
159 Correct 2924 ms 10940 KB Output is correct
160 Correct 2952 ms 10948 KB Output is correct
161 Correct 1661 ms 11328 KB Output is correct
162 Correct 1637 ms 11196 KB Output is correct
163 Correct 1711 ms 11152 KB Output is correct
164 Correct 1641 ms 11292 KB Output is correct
165 Correct 1662 ms 11124 KB Output is correct
166 Correct 3458 ms 11096 KB Output is correct
167 Correct 3554 ms 11176 KB Output is correct
168 Correct 3482 ms 11160 KB Output is correct
169 Correct 3450 ms 11128 KB Output is correct
170 Correct 3483 ms 11184 KB Output is correct
171 Correct 3690 ms 11004 KB Output is correct
172 Correct 3656 ms 11000 KB Output is correct
173 Correct 3632 ms 10988 KB Output is correct
174 Correct 3518 ms 11004 KB Output is correct
175 Correct 3687 ms 11080 KB Output is correct