oj.uz

답안 #760444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760444 2023-06-17T15:04:35 Z Sam_a17 Diversity (CEOI21_diversity) C++17
100 / 100
 3709 ms 8900 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);
    }
  }

  sort(all(new_st));
  uniq(new_st);

  st.swap(new_st);

  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;

    // 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 2 ms 2644 KB Output is correct
8 Correct 2 ms 2640 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 2 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 11 ms 5720 KB Output is correct
6 Correct 16 ms 7632 KB Output is correct
7 Correct 18 ms 8336 KB Output is correct
8 Correct 17 ms 7572 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 17 ms 7928 KB Output is correct
11 Correct 17 ms 7632 KB Output is correct
12 Correct 17 ms 7540 KB Output is correct
13 Correct 17 ms 7504 KB Output is correct
14 Correct 17 ms 7760 KB Output is correct
15 Correct 16 ms 7664 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 2 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 11 ms 5720 KB Output is correct
6 Correct 16 ms 7632 KB Output is correct
7 Correct 18 ms 8336 KB Output is correct
8 Correct 17 ms 7572 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 17 ms 7928 KB Output is correct
11 Correct 17 ms 7632 KB Output is correct
12 Correct 17 ms 7540 KB Output is correct
13 Correct 17 ms 7504 KB Output is correct
14 Correct 17 ms 7760 KB Output is correct
15 Correct 16 ms 7664 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 3 ms 2784 KB Output is correct
19 Correct 7 ms 4184 KB Output is correct
20 Correct 12 ms 5588 KB Output is correct
21 Correct 18 ms 7556 KB Output is correct
22 Correct 17 ms 7468 KB Output is correct
23 Correct 18 ms 7504 KB Output is correct
24 Correct 21 ms 7396 KB Output is correct
25 Correct 17 ms 7472 KB Output is correct
26 Correct 18 ms 7444 KB Output is correct
27 Correct 17 ms 7544 KB Output is correct
28 Correct 19 ms 7760 KB Output is correct
29 Correct 17 ms 7504 KB Output is correct
30 Correct 21 ms 7536 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 2 ms 2900 KB Output is correct
4 Correct 7 ms 4184 KB Output is correct
5 Correct 11 ms 5720 KB Output is correct
6 Correct 16 ms 7632 KB Output is correct
7 Correct 18 ms 8336 KB Output is correct
8 Correct 17 ms 7572 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 17 ms 7928 KB Output is correct
11 Correct 17 ms 7632 KB Output is correct
12 Correct 17 ms 7540 KB Output is correct
13 Correct 17 ms 7504 KB Output is correct
14 Correct 17 ms 7760 KB Output is correct
15 Correct 16 ms 7664 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 3 ms 2784 KB Output is correct
19 Correct 7 ms 4184 KB Output is correct
20 Correct 12 ms 5588 KB Output is correct
21 Correct 18 ms 7556 KB Output is correct
22 Correct 17 ms 7468 KB Output is correct
23 Correct 18 ms 7504 KB Output is correct
24 Correct 21 ms 7396 KB Output is correct
25 Correct 17 ms 7472 KB Output is correct
26 Correct 18 ms 7444 KB Output is correct
27 Correct 17 ms 7544 KB Output is correct
28 Correct 19 ms 7760 KB Output is correct
29 Correct 17 ms 7504 KB Output is correct
30 Correct 21 ms 7536 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 2 ms 2772 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 3 ms 2772 KB Output is correct
37 Correct 5 ms 3108 KB Output is correct
38 Correct 5 ms 3156 KB Output is correct
39 Correct 8 ms 3668 KB Output is correct
40 Correct 14 ms 4656 KB Output is correct
41 Correct 21 ms 5856 KB Output is correct
42 Correct 21 ms 5812 KB Output is correct
43 Correct 21 ms 5896 KB Output is correct
44 Correct 21 ms 5924 KB Output is correct
45 Correct 21 ms 5844 KB Output is correct
46 Correct 21 ms 5832 KB Output is correct
47 Correct 21 ms 5848 KB Output is correct
48 Correct 21 ms 5920 KB Output is correct
49 Correct 21 ms 5836 KB Output is correct
50 Correct 22 ms 5904 KB Output is correct
51 Correct 21 ms 5916 KB Output is correct
52 Correct 21 ms 5856 KB Output is correct
53 Correct 26 ms 5836 KB Output is correct
54 Correct 22 ms 5904 KB Output is correct
55 Correct 21 ms 5804 KB Output is correct
56 Correct 21 ms 5824 KB Output is correct
57 Correct 21 ms 5852 KB Output is correct
58 Correct 21 ms 5920 KB Output is correct
59 Correct 21 ms 5924 KB Output is correct
60 Correct 21 ms 5844 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 2 ms 2644 KB Output is correct
8 Correct 2 ms 2640 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 2 ms 2900 KB Output is correct
14 Correct 7 ms 4184 KB Output is correct
15 Correct 11 ms 5720 KB Output is correct
16 Correct 16 ms 7632 KB Output is correct
17 Correct 18 ms 8336 KB Output is correct
18 Correct 17 ms 7572 KB Output is correct
19 Correct 17 ms 7588 KB Output is correct
20 Correct 17 ms 7928 KB Output is correct
21 Correct 17 ms 7632 KB Output is correct
22 Correct 17 ms 7540 KB Output is correct
23 Correct 17 ms 7504 KB Output is correct
24 Correct 17 ms 7760 KB Output is correct
25 Correct 16 ms 7664 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2784 KB Output is correct
29 Correct 7 ms 4184 KB Output is correct
30 Correct 12 ms 5588 KB Output is correct
31 Correct 18 ms 7556 KB Output is correct
32 Correct 17 ms 7468 KB Output is correct
33 Correct 18 ms 7504 KB Output is correct
34 Correct 21 ms 7396 KB Output is correct
35 Correct 17 ms 7472 KB Output is correct
36 Correct 18 ms 7444 KB Output is correct
37 Correct 17 ms 7544 KB Output is correct
38 Correct 19 ms 7760 KB Output is correct
39 Correct 17 ms 7504 KB Output is correct
40 Correct 21 ms 7536 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 2 ms 2772 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 3 ms 2772 KB Output is correct
47 Correct 5 ms 3108 KB Output is correct
48 Correct 5 ms 3156 KB Output is correct
49 Correct 8 ms 3668 KB Output is correct
50 Correct 14 ms 4656 KB Output is correct
51 Correct 21 ms 5856 KB Output is correct
52 Correct 21 ms 5812 KB Output is correct
53 Correct 21 ms 5896 KB Output is correct
54 Correct 21 ms 5924 KB Output is correct
55 Correct 21 ms 5844 KB Output is correct
56 Correct 21 ms 5832 KB Output is correct
57 Correct 21 ms 5848 KB Output is correct
58 Correct 21 ms 5920 KB Output is correct
59 Correct 21 ms 5836 KB Output is correct
60 Correct 22 ms 5904 KB Output is correct
61 Correct 21 ms 5916 KB Output is correct
62 Correct 21 ms 5856 KB Output is correct
63 Correct 26 ms 5836 KB Output is correct
64 Correct 22 ms 5904 KB Output is correct
65 Correct 21 ms 5804 KB Output is correct
66 Correct 21 ms 5824 KB Output is correct
67 Correct 21 ms 5852 KB Output is correct
68 Correct 21 ms 5920 KB Output is correct
69 Correct 21 ms 5924 KB Output is correct
70 Correct 21 ms 5844 KB Output is correct
71 Correct 5 ms 3028 KB Output is correct
72 Correct 5 ms 3028 KB Output is correct
73 Correct 5 ms 3028 KB Output is correct
74 Correct 5 ms 3028 KB Output is correct
75 Correct 5 ms 3028 KB Output is correct
76 Correct 8 ms 3464 KB Output is correct
77 Correct 7 ms 3540 KB Output is correct
78 Correct 7 ms 3540 KB Output is correct
79 Correct 9 ms 3532 KB Output is correct
80 Correct 8 ms 3540 KB Output is correct
81 Correct 14 ms 4308 KB Output is correct
82 Correct 13 ms 4308 KB Output is correct
83 Correct 13 ms 4280 KB Output is correct
84 Correct 13 ms 4356 KB Output is correct
85 Correct 13 ms 4308 KB Output is correct
86 Correct 14 ms 4424 KB Output is correct
87 Correct 14 ms 4420 KB Output is correct
88 Correct 15 ms 4360 KB Output is correct
89 Correct 15 ms 4340 KB Output is correct
90 Correct 14 ms 4436 KB Output is correct
91 Correct 22 ms 5760 KB Output is correct
92 Correct 21 ms 5792 KB Output is correct
93 Correct 27 ms 5776 KB Output is correct
94 Correct 22 ms 5716 KB Output is correct
95 Correct 25 ms 5804 KB Output is correct
96 Correct 24 ms 6484 KB Output is correct
97 Correct 25 ms 6492 KB Output is correct
98 Correct 24 ms 6484 KB Output is correct
99 Correct 24 ms 6476 KB Output is correct
100 Correct 24 ms 6552 KB Output is correct
101 Correct 24 ms 6492 KB Output is correct
102 Correct 24 ms 6512 KB Output is correct
103 Correct 25 ms 6520 KB Output is correct
104 Correct 26 ms 6588 KB Output is correct
105 Correct 24 ms 6524 KB Output is correct
106 Correct 23 ms 6868 KB Output is correct
107 Correct 23 ms 6960 KB Output is correct
108 Correct 23 ms 6880 KB Output is correct
109 Correct 24 ms 6916 KB Output is correct
110 Correct 23 ms 6916 KB Output is correct
111 Correct 24 ms 6880 KB Output is correct
112 Correct 24 ms 6904 KB Output is correct
113 Correct 23 ms 6868 KB Output is correct
114 Correct 24 ms 6996 KB Output is correct
115 Correct 24 ms 6944 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 2 ms 2644 KB Output is correct
8 Correct 2 ms 2640 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 2 ms 2900 KB Output is correct
14 Correct 7 ms 4184 KB Output is correct
15 Correct 11 ms 5720 KB Output is correct
16 Correct 16 ms 7632 KB Output is correct
17 Correct 18 ms 8336 KB Output is correct
18 Correct 17 ms 7572 KB Output is correct
19 Correct 17 ms 7588 KB Output is correct
20 Correct 17 ms 7928 KB Output is correct
21 Correct 17 ms 7632 KB Output is correct
22 Correct 17 ms 7540 KB Output is correct
23 Correct 17 ms 7504 KB Output is correct
24 Correct 17 ms 7760 KB Output is correct
25 Correct 16 ms 7664 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2784 KB Output is correct
29 Correct 7 ms 4184 KB Output is correct
30 Correct 12 ms 5588 KB Output is correct
31 Correct 18 ms 7556 KB Output is correct
32 Correct 17 ms 7468 KB Output is correct
33 Correct 18 ms 7504 KB Output is correct
34 Correct 21 ms 7396 KB Output is correct
35 Correct 17 ms 7472 KB Output is correct
36 Correct 18 ms 7444 KB Output is correct
37 Correct 17 ms 7544 KB Output is correct
38 Correct 19 ms 7760 KB Output is correct
39 Correct 17 ms 7504 KB Output is correct
40 Correct 21 ms 7536 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 2 ms 2772 KB Output is correct
45 Correct 3 ms 2772 KB Output is correct
46 Correct 3 ms 2772 KB Output is correct
47 Correct 5 ms 3108 KB Output is correct
48 Correct 5 ms 3156 KB Output is correct
49 Correct 8 ms 3668 KB Output is correct
50 Correct 14 ms 4656 KB Output is correct
51 Correct 21 ms 5856 KB Output is correct
52 Correct 21 ms 5812 KB Output is correct
53 Correct 21 ms 5896 KB Output is correct
54 Correct 21 ms 5924 KB Output is correct
55 Correct 21 ms 5844 KB Output is correct
56 Correct 21 ms 5832 KB Output is correct
57 Correct 21 ms 5848 KB Output is correct
58 Correct 21 ms 5920 KB Output is correct
59 Correct 21 ms 5836 KB Output is correct
60 Correct 22 ms 5904 KB Output is correct
61 Correct 21 ms 5916 KB Output is correct
62 Correct 21 ms 5856 KB Output is correct
63 Correct 26 ms 5836 KB Output is correct
64 Correct 22 ms 5904 KB Output is correct
65 Correct 21 ms 5804 KB Output is correct
66 Correct 21 ms 5824 KB Output is correct
67 Correct 21 ms 5852 KB Output is correct
68 Correct 21 ms 5920 KB Output is correct
69 Correct 21 ms 5924 KB Output is correct
70 Correct 21 ms 5844 KB Output is correct
71 Correct 5 ms 3028 KB Output is correct
72 Correct 5 ms 3028 KB Output is correct
73 Correct 5 ms 3028 KB Output is correct
74 Correct 5 ms 3028 KB Output is correct
75 Correct 5 ms 3028 KB Output is correct
76 Correct 8 ms 3464 KB Output is correct
77 Correct 7 ms 3540 KB Output is correct
78 Correct 7 ms 3540 KB Output is correct
79 Correct 9 ms 3532 KB Output is correct
80 Correct 8 ms 3540 KB Output is correct
81 Correct 14 ms 4308 KB Output is correct
82 Correct 13 ms 4308 KB Output is correct
83 Correct 13 ms 4280 KB Output is correct
84 Correct 13 ms 4356 KB Output is correct
85 Correct 13 ms 4308 KB Output is correct
86 Correct 14 ms 4424 KB Output is correct
87 Correct 14 ms 4420 KB Output is correct
88 Correct 15 ms 4360 KB Output is correct
89 Correct 15 ms 4340 KB Output is correct
90 Correct 14 ms 4436 KB Output is correct
91 Correct 22 ms 5760 KB Output is correct
92 Correct 21 ms 5792 KB Output is correct
93 Correct 27 ms 5776 KB Output is correct
94 Correct 22 ms 5716 KB Output is correct
95 Correct 25 ms 5804 KB Output is correct
96 Correct 24 ms 6484 KB Output is correct
97 Correct 25 ms 6492 KB Output is correct
98 Correct 24 ms 6484 KB Output is correct
99 Correct 24 ms 6476 KB Output is correct
100 Correct 24 ms 6552 KB Output is correct
101 Correct 24 ms 6492 KB Output is correct
102 Correct 24 ms 6512 KB Output is correct
103 Correct 25 ms 6520 KB Output is correct
104 Correct 26 ms 6588 KB Output is correct
105 Correct 24 ms 6524 KB Output is correct
106 Correct 23 ms 6868 KB Output is correct
107 Correct 23 ms 6960 KB Output is correct
108 Correct 23 ms 6880 KB Output is correct
109 Correct 24 ms 6916 KB Output is correct
110 Correct 23 ms 6916 KB Output is correct
111 Correct 24 ms 6880 KB Output is correct
112 Correct 24 ms 6904 KB Output is correct
113 Correct 23 ms 6868 KB Output is correct
114 Correct 24 ms 6996 KB Output is correct
115 Correct 24 ms 6944 KB Output is correct
116 Correct 322 ms 4852 KB Output is correct
117 Correct 392 ms 4856 KB Output is correct
118 Correct 502 ms 5620 KB Output is correct
119 Correct 492 ms 5300 KB Output is correct
120 Correct 325 ms 5296 KB Output is correct
121 Correct 623 ms 5820 KB Output is correct
122 Correct 421 ms 5696 KB Output is correct
123 Correct 1534 ms 6880 KB Output is correct
124 Correct 583 ms 6832 KB Output is correct
125 Correct 464 ms 6588 KB Output is correct
126 Correct 3092 ms 8608 KB Output is correct
127 Correct 3164 ms 8612 KB Output is correct
128 Correct 3160 ms 8680 KB Output is correct
129 Correct 3161 ms 8616 KB Output is correct
130 Correct 3225 ms 8564 KB Output is correct
131 Correct 3709 ms 8444 KB Output is correct
132 Correct 3704 ms 8556 KB Output is correct
133 Correct 3613 ms 8436 KB Output is correct
134 Correct 3686 ms 8384 KB Output is correct
135 Correct 3664 ms 8480 KB Output is correct
136 Correct 3646 ms 8488 KB Output is correct
137 Correct 3644 ms 8396 KB Output is correct
138 Correct 3653 ms 8388 KB Output is correct
139 Correct 3664 ms 8572 KB Output is correct
140 Correct 3636 ms 8464 KB Output is correct
141 Correct 2874 ms 8200 KB Output is correct
142 Correct 3018 ms 8204 KB Output is correct
143 Correct 2948 ms 8200 KB Output is correct
144 Correct 2924 ms 8196 KB Output is correct
145 Correct 2928 ms 8196 KB Output is correct
146 Correct 998 ms 7480 KB Output is correct
147 Correct 995 ms 7456 KB Output is correct
148 Correct 1030 ms 7520 KB Output is correct
149 Correct 989 ms 7508 KB Output is correct
150 Correct 1022 ms 7452 KB Output is correct
151 Correct 815 ms 7496 KB Output is correct
152 Correct 808 ms 7484 KB Output is correct
153 Correct 842 ms 7440 KB Output is correct
154 Correct 816 ms 7476 KB Output is correct
155 Correct 799 ms 7392 KB Output is correct
156 Correct 2363 ms 8736 KB Output is correct
157 Correct 2415 ms 8900 KB Output is correct
158 Correct 2394 ms 8636 KB Output is correct
159 Correct 2341 ms 8768 KB Output is correct
160 Correct 2364 ms 8648 KB Output is correct
161 Correct 1619 ms 8892 KB Output is correct
162 Correct 1620 ms 8720 KB Output is correct
163 Correct 1616 ms 8692 KB Output is correct
164 Correct 1614 ms 8724 KB Output is correct
165 Correct 1620 ms 8660 KB Output is correct
166 Correct 2649 ms 8504 KB Output is correct
167 Correct 2708 ms 8420 KB Output is correct
168 Correct 2686 ms 8416 KB Output is correct
169 Correct 2648 ms 8536 KB Output is correct
170 Correct 2655 ms 8448 KB Output is correct
171 Correct 2689 ms 8668 KB Output is correct
172 Correct 2642 ms 8636 KB Output is correct
173 Correct 2650 ms 8664 KB Output is correct
174 Correct 2590 ms 8696 KB Output is correct
175 Correct 2688 ms 8756 KB Output is correct