oj.uz

답안 #760362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760362 2023-06-17T13:43:48 Z Sam_a17 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 9000 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 = 600, qar[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];
map<long long, long long> mp;

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

  cur[a[ind]]++;
  mp[cur[a[ind]]]++;
}

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

  cur[a[ind]]--;
  if(cur[a[ind]]) mp[cur[a[ind]]]++;
}

long long get(long long all) {
  vector<pair<long long, long long>> vec;
  for(auto i: mp) {
    if(i.second) {
      vec.push_back({i.first, i.second});
    }
  }

  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;

    //..x...CUR...y...
    for(long long j = 0; j < i.second; j++) {
      long long cx = x + j * i.first;
      long long cy = y + (i.second - j - 1) * i.first;
      ans += cx * cy;
    }

    for(long long j = 0; j < i.second; j++) {
      long long cx = x + j * i.first;
      ans += cx * i.first;
    }

    for(long long j = 0; j < i.second; j++) {
      long long cx = y + j * i.first;
      ans += cx * i.first;
    }

    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 = 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 13 ms 1924 KB Output is correct
5 Correct 26 ms 3492 KB Output is correct
6 Correct 41 ms 4960 KB Output is correct
7 Correct 37 ms 5040 KB Output is correct
8 Correct 45 ms 5036 KB Output is correct
9 Correct 40 ms 5020 KB Output is correct
10 Correct 39 ms 4948 KB Output is correct
11 Correct 41 ms 5036 KB Output is correct
12 Correct 41 ms 4964 KB Output is correct
13 Correct 41 ms 5036 KB Output is correct
14 Correct 40 ms 4948 KB Output is correct
15 Correct 43 ms 4940 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 13 ms 1924 KB Output is correct
5 Correct 26 ms 3492 KB Output is correct
6 Correct 41 ms 4960 KB Output is correct
7 Correct 37 ms 5040 KB Output is correct
8 Correct 45 ms 5036 KB Output is correct
9 Correct 40 ms 5020 KB Output is correct
10 Correct 39 ms 4948 KB Output is correct
11 Correct 41 ms 5036 KB Output is correct
12 Correct 41 ms 4964 KB Output is correct
13 Correct 41 ms 5036 KB Output is correct
14 Correct 40 ms 4948 KB Output is correct
15 Correct 43 ms 4940 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 16 ms 1928 KB Output is correct
20 Correct 33 ms 3364 KB Output is correct
21 Correct 46 ms 5016 KB Output is correct
22 Correct 48 ms 4948 KB Output is correct
23 Correct 47 ms 5032 KB Output is correct
24 Correct 49 ms 4948 KB Output is correct
25 Correct 48 ms 4968 KB Output is correct
26 Correct 48 ms 4948 KB Output is correct
27 Correct 47 ms 5036 KB Output is correct
28 Correct 50 ms 5048 KB Output is correct
29 Correct 47 ms 5036 KB Output is correct
30 Correct 51 ms 5004 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 13 ms 1924 KB Output is correct
5 Correct 26 ms 3492 KB Output is correct
6 Correct 41 ms 4960 KB Output is correct
7 Correct 37 ms 5040 KB Output is correct
8 Correct 45 ms 5036 KB Output is correct
9 Correct 40 ms 5020 KB Output is correct
10 Correct 39 ms 4948 KB Output is correct
11 Correct 41 ms 5036 KB Output is correct
12 Correct 41 ms 4964 KB Output is correct
13 Correct 41 ms 5036 KB Output is correct
14 Correct 40 ms 4948 KB Output is correct
15 Correct 43 ms 4940 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 16 ms 1928 KB Output is correct
20 Correct 33 ms 3364 KB Output is correct
21 Correct 46 ms 5016 KB Output is correct
22 Correct 48 ms 4948 KB Output is correct
23 Correct 47 ms 5032 KB Output is correct
24 Correct 49 ms 4948 KB Output is correct
25 Correct 48 ms 4968 KB Output is correct
26 Correct 48 ms 4948 KB Output is correct
27 Correct 47 ms 5036 KB Output is correct
28 Correct 50 ms 5048 KB Output is correct
29 Correct 47 ms 5036 KB Output is correct
30 Correct 51 ms 5004 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 10 ms 1364 KB Output is correct
38 Correct 8 ms 1364 KB Output is correct
39 Correct 18 ms 2320 KB Output is correct
40 Correct 40 ms 4272 KB Output is correct
41 Correct 68 ms 6472 KB Output is correct
42 Correct 67 ms 6240 KB Output is correct
43 Correct 64 ms 6228 KB Output is correct
44 Correct 65 ms 6228 KB Output is correct
45 Correct 66 ms 6228 KB Output is correct
46 Correct 63 ms 6216 KB Output is correct
47 Correct 63 ms 6208 KB Output is correct
48 Correct 64 ms 6208 KB Output is correct
49 Correct 65 ms 6220 KB Output is correct
50 Correct 62 ms 6248 KB Output is correct
51 Correct 63 ms 6228 KB Output is correct
52 Correct 63 ms 6180 KB Output is correct
53 Correct 62 ms 6216 KB Output is correct
54 Correct 66 ms 6284 KB Output is correct
55 Correct 63 ms 6224 KB Output is correct
56 Correct 64 ms 6228 KB Output is correct
57 Correct 65 ms 6272 KB Output is correct
58 Correct 65 ms 6220 KB Output is correct
59 Correct 64 ms 6248 KB Output is correct
60 Correct 68 ms 6208 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 13 ms 1924 KB Output is correct
15 Correct 26 ms 3492 KB Output is correct
16 Correct 41 ms 4960 KB Output is correct
17 Correct 37 ms 5040 KB Output is correct
18 Correct 45 ms 5036 KB Output is correct
19 Correct 40 ms 5020 KB Output is correct
20 Correct 39 ms 4948 KB Output is correct
21 Correct 41 ms 5036 KB Output is correct
22 Correct 41 ms 4964 KB Output is correct
23 Correct 41 ms 5036 KB Output is correct
24 Correct 40 ms 4948 KB Output is correct
25 Correct 43 ms 4940 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 16 ms 1928 KB Output is correct
30 Correct 33 ms 3364 KB Output is correct
31 Correct 46 ms 5016 KB Output is correct
32 Correct 48 ms 4948 KB Output is correct
33 Correct 47 ms 5032 KB Output is correct
34 Correct 49 ms 4948 KB Output is correct
35 Correct 48 ms 4968 KB Output is correct
36 Correct 48 ms 4948 KB Output is correct
37 Correct 47 ms 5036 KB Output is correct
38 Correct 50 ms 5048 KB Output is correct
39 Correct 47 ms 5036 KB Output is correct
40 Correct 51 ms 5004 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 10 ms 1364 KB Output is correct
48 Correct 8 ms 1364 KB Output is correct
49 Correct 18 ms 2320 KB Output is correct
50 Correct 40 ms 4272 KB Output is correct
51 Correct 68 ms 6472 KB Output is correct
52 Correct 67 ms 6240 KB Output is correct
53 Correct 64 ms 6228 KB Output is correct
54 Correct 65 ms 6228 KB Output is correct
55 Correct 66 ms 6228 KB Output is correct
56 Correct 63 ms 6216 KB Output is correct
57 Correct 63 ms 6208 KB Output is correct
58 Correct 64 ms 6208 KB Output is correct
59 Correct 65 ms 6220 KB Output is correct
60 Correct 62 ms 6248 KB Output is correct
61 Correct 63 ms 6228 KB Output is correct
62 Correct 63 ms 6180 KB Output is correct
63 Correct 62 ms 6216 KB Output is correct
64 Correct 66 ms 6284 KB Output is correct
65 Correct 63 ms 6224 KB Output is correct
66 Correct 64 ms 6228 KB Output is correct
67 Correct 65 ms 6272 KB Output is correct
68 Correct 65 ms 6220 KB Output is correct
69 Correct 64 ms 6248 KB Output is correct
70 Correct 68 ms 6208 KB Output is correct
71 Correct 7 ms 1376 KB Output is correct
72 Correct 6 ms 1364 KB Output is correct
73 Correct 7 ms 1388 KB Output is correct
74 Correct 7 ms 1404 KB Output is correct
75 Correct 7 ms 1376 KB Output is correct
76 Correct 12 ms 2392 KB Output is correct
77 Correct 12 ms 2388 KB Output is correct
78 Correct 12 ms 2440 KB Output is correct
79 Correct 12 ms 2448 KB Output is correct
80 Correct 12 ms 2444 KB Output is correct
81 Correct 23 ms 4436 KB Output is correct
82 Correct 24 ms 4524 KB Output is correct
83 Correct 23 ms 4536 KB Output is correct
84 Correct 23 ms 4532 KB Output is correct
85 Correct 23 ms 4536 KB Output is correct
86 Correct 21 ms 4704 KB Output is correct
87 Correct 21 ms 4612 KB Output is correct
88 Correct 23 ms 4612 KB Output is correct
89 Correct 21 ms 4636 KB Output is correct
90 Correct 21 ms 4636 KB Output is correct
91 Correct 27 ms 7548 KB Output is correct
92 Correct 28 ms 7500 KB Output is correct
93 Correct 28 ms 7452 KB Output is correct
94 Correct 28 ms 7512 KB Output is correct
95 Correct 27 ms 7508 KB Output is correct
96 Correct 27 ms 8404 KB Output is correct
97 Correct 28 ms 8516 KB Output is correct
98 Correct 27 ms 8384 KB Output is correct
99 Correct 27 ms 8408 KB Output is correct
100 Correct 27 ms 8404 KB Output is correct
101 Correct 27 ms 8396 KB Output is correct
102 Correct 27 ms 8568 KB Output is correct
103 Correct 27 ms 8492 KB Output is correct
104 Correct 27 ms 8424 KB Output is correct
105 Correct 29 ms 8452 KB Output is correct
106 Correct 25 ms 8904 KB Output is correct
107 Correct 25 ms 8892 KB Output is correct
108 Correct 25 ms 8924 KB Output is correct
109 Correct 38 ms 9000 KB Output is correct
110 Correct 25 ms 8860 KB Output is correct
111 Correct 25 ms 8852 KB Output is correct
112 Correct 25 ms 8856 KB Output is correct
113 Correct 26 ms 8856 KB Output is correct
114 Correct 26 ms 8916 KB Output is correct
115 Correct 29 ms 8908 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 13 ms 1924 KB Output is correct
15 Correct 26 ms 3492 KB Output is correct
16 Correct 41 ms 4960 KB Output is correct
17 Correct 37 ms 5040 KB Output is correct
18 Correct 45 ms 5036 KB Output is correct
19 Correct 40 ms 5020 KB Output is correct
20 Correct 39 ms 4948 KB Output is correct
21 Correct 41 ms 5036 KB Output is correct
22 Correct 41 ms 4964 KB Output is correct
23 Correct 41 ms 5036 KB Output is correct
24 Correct 40 ms 4948 KB Output is correct
25 Correct 43 ms 4940 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 16 ms 1928 KB Output is correct
30 Correct 33 ms 3364 KB Output is correct
31 Correct 46 ms 5016 KB Output is correct
32 Correct 48 ms 4948 KB Output is correct
33 Correct 47 ms 5032 KB Output is correct
34 Correct 49 ms 4948 KB Output is correct
35 Correct 48 ms 4968 KB Output is correct
36 Correct 48 ms 4948 KB Output is correct
37 Correct 47 ms 5036 KB Output is correct
38 Correct 50 ms 5048 KB Output is correct
39 Correct 47 ms 5036 KB Output is correct
40 Correct 51 ms 5004 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 10 ms 1364 KB Output is correct
48 Correct 8 ms 1364 KB Output is correct
49 Correct 18 ms 2320 KB Output is correct
50 Correct 40 ms 4272 KB Output is correct
51 Correct 68 ms 6472 KB Output is correct
52 Correct 67 ms 6240 KB Output is correct
53 Correct 64 ms 6228 KB Output is correct
54 Correct 65 ms 6228 KB Output is correct
55 Correct 66 ms 6228 KB Output is correct
56 Correct 63 ms 6216 KB Output is correct
57 Correct 63 ms 6208 KB Output is correct
58 Correct 64 ms 6208 KB Output is correct
59 Correct 65 ms 6220 KB Output is correct
60 Correct 62 ms 6248 KB Output is correct
61 Correct 63 ms 6228 KB Output is correct
62 Correct 63 ms 6180 KB Output is correct
63 Correct 62 ms 6216 KB Output is correct
64 Correct 66 ms 6284 KB Output is correct
65 Correct 63 ms 6224 KB Output is correct
66 Correct 64 ms 6228 KB Output is correct
67 Correct 65 ms 6272 KB Output is correct
68 Correct 65 ms 6220 KB Output is correct
69 Correct 64 ms 6248 KB Output is correct
70 Correct 68 ms 6208 KB Output is correct
71 Correct 7 ms 1376 KB Output is correct
72 Correct 6 ms 1364 KB Output is correct
73 Correct 7 ms 1388 KB Output is correct
74 Correct 7 ms 1404 KB Output is correct
75 Correct 7 ms 1376 KB Output is correct
76 Correct 12 ms 2392 KB Output is correct
77 Correct 12 ms 2388 KB Output is correct
78 Correct 12 ms 2440 KB Output is correct
79 Correct 12 ms 2448 KB Output is correct
80 Correct 12 ms 2444 KB Output is correct
81 Correct 23 ms 4436 KB Output is correct
82 Correct 24 ms 4524 KB Output is correct
83 Correct 23 ms 4536 KB Output is correct
84 Correct 23 ms 4532 KB Output is correct
85 Correct 23 ms 4536 KB Output is correct
86 Correct 21 ms 4704 KB Output is correct
87 Correct 21 ms 4612 KB Output is correct
88 Correct 23 ms 4612 KB Output is correct
89 Correct 21 ms 4636 KB Output is correct
90 Correct 21 ms 4636 KB Output is correct
91 Correct 27 ms 7548 KB Output is correct
92 Correct 28 ms 7500 KB Output is correct
93 Correct 28 ms 7452 KB Output is correct
94 Correct 28 ms 7512 KB Output is correct
95 Correct 27 ms 7508 KB Output is correct
96 Correct 27 ms 8404 KB Output is correct
97 Correct 28 ms 8516 KB Output is correct
98 Correct 27 ms 8384 KB Output is correct
99 Correct 27 ms 8408 KB Output is correct
100 Correct 27 ms 8404 KB Output is correct
101 Correct 27 ms 8396 KB Output is correct
102 Correct 27 ms 8568 KB Output is correct
103 Correct 27 ms 8492 KB Output is correct
104 Correct 27 ms 8424 KB Output is correct
105 Correct 29 ms 8452 KB Output is correct
106 Correct 25 ms 8904 KB Output is correct
107 Correct 25 ms 8892 KB Output is correct
108 Correct 25 ms 8924 KB Output is correct
109 Correct 38 ms 9000 KB Output is correct
110 Correct 25 ms 8860 KB Output is correct
111 Correct 25 ms 8852 KB Output is correct
112 Correct 25 ms 8856 KB Output is correct
113 Correct 26 ms 8856 KB Output is correct
114 Correct 26 ms 8916 KB Output is correct
115 Correct 29 ms 8908 KB Output is correct
116 Correct 1256 ms 3100 KB Output is correct
117 Correct 1149 ms 3100 KB Output is correct
118 Correct 2217 ms 4052 KB Output is correct
119 Correct 1653 ms 4156 KB Output is correct
120 Correct 1189 ms 4176 KB Output is correct
121 Correct 2932 ms 5100 KB Output is correct
122 Correct 2151 ms 5272 KB Output is correct
123 Execution timed out 7074 ms 6512 KB Time limit exceeded
124 Halted 0 ms 0 KB -