oj.uz

답안 #696876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
696876 2023-02-07T14:13:21 Z cig32 Diversity (CEOI21_diversity) C++14
64 / 100
 7000 ms 4704 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
 
int freq[MAXN], ff[MAXN], n;
 
int block;
bool modui(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b) {
  if(a.first.first / block != b.first.first / block) return a.first.first / block < b.first.first / block;
  return a.first.second < b.first.second;
}
 
bool byfreq(int x, int y) {
  return freq[x] < freq[y];
}
void solve(int tc) {
  int q;
  cin >> n >> q;
  int c = 300000;
  block = 1000;
  int arr[n+1];
  for(int i=1; i<=n; i++) cin >> arr[i];
  pair<pair<int,int>,int> qry[q+1];
  for(int i=1; i<=q; i++) {
    cin >> qry[i].first.first >> qry[i].first.second;
    qry[i].second = i;
  }
  sort(qry+1, qry+q+1, modui);
  int res[q+1];
  int l = qry[1].first.first, r = qry[1].first.first - 1;
  vector<int> v;
  // O(sqrt(n)) frequencies
  set<int> all; // set of all frequencies
  for(int i=1; i<=q; i++) {
    while(l > qry[i].first.first) {
      l--;
      ff[freq[arr[l]]]--;
      if(ff[freq[arr[l]]] == 0) all.erase(freq[arr[l]]);
      freq[arr[l]]++;
      ff[freq[arr[l]]]++;
      if(ff[freq[arr[l]]] == 1) all.insert(freq[arr[l]]);
    }
    while(r > qry[i].first.second) {
      ff[freq[arr[r]]]--;
      if(ff[freq[arr[r]]] == 0) all.erase(freq[arr[r]]);
      freq[arr[r]]--;
      ff[freq[arr[r]]]++;
      if(ff[freq[arr[r]]] == 1) all.insert(freq[arr[r]]);
      r--;
    }
    while(r < qry[i].first.second) {
      r++;
      ff[freq[arr[r]]]--;
      if(ff[freq[arr[r]]] == 0) all.erase(freq[arr[r]]);
      freq[arr[r]]++;
      ff[freq[arr[r]]]++;
      if(ff[freq[arr[r]]] == 1) all.insert(freq[arr[r]]);
    }
    while(l < qry[i].first.first) {
      ff[freq[arr[l]]]--;
      if(ff[freq[arr[l]]] == 0) all.erase(freq[arr[l]]);
      freq[arr[l]]--;
      ff[freq[arr[l]]]++;
      if(ff[freq[arr[l]]] == 1) all.insert(freq[arr[l]]);
      l++;
    }
    
    queue<pair<int, int> > ln; stack<pair<int, int> > rn;
    int m = 0;
    for(int x: all) {
      // {x, ff[x]}
      if(ff[x] / 2 > 0) {
        ln.push({x, ff[x] / 2});
        rn.push({x, ff[x] / 2});
        m += 2;
      }
      if(ff[x] % 2) {
        if(ln.size() > rn.size()) rn.push({x, 1});
        else ln.push({x, 1});
        m++;
      }
    }
    pair<int, int> b[m];
    int it = 0;
    while(ln.size()) {
      b[it++] = ln.front(); ln.pop();
    }
    while(rn.size()) {
      b[it++] = rn.top(); rn.pop();
    }
    int ans = 0;
    int ws=0,wps=0,tps=0,ps=0;
    for(int i=0; i<m; i++) {
      /*
      int ps2=0;
      int bruh=0;
      for(int j=0; j<i; j++) {
        for(int k=0; k<b[i].second; k++) {
          for(int l=0; l<b[j].second; l++) {
            bruh += b[i].first * b[j].first * (ps+k+1 - ps2-(l+1) + 1);
          }
        }
        ps2+=b[j].second;
      }
      ans +=bruh;
      ps+=b[i].second;
      continue;
      */
      int F = b[i].first;
      int C = b[i].second;
      int t1 = C * F * ps * ws;
      int t2 = C * F * wps;
      int t3 = F * C * (C+1) / 2 * ws - F * C * tps / 2 + F * C * ws;
      ans += t1 - t2 + t3;
      ws += C * F;
      wps += C * F * ps;
      tps += C * F * (C + 1);
      ps += C;
    }
    for(int i=0; i<m; i++) {
      ans += b[i].first * (b[i].first + 1) / 2 * b[i].second;
      int totn = (b[i].second - 1) * b[i].second / 2 * (b[i].second + 1);
      totn -= b[i].second * (b[i].second - 1) * (2 * b[i].second - 1) / 6;
      ans += totn * b[i].first * b[i].first;
    }
    res[qry[i].second] = ans;
  }
  for(int i=1; i<=q; i++) cout << res[i] << "\n";
 
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Compilation message

diversity.cpp: In function 'void solve(long long int)':
diversity.cpp:38:7: warning: unused variable 'c' [-Wunused-variable]
   38 |   int c = 300000;
      |       ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 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 340 KB Output is correct
4 Correct 13 ms 1236 KB Output is correct
5 Correct 25 ms 2464 KB Output is correct
6 Correct 51 ms 3100 KB Output is correct
7 Correct 37 ms 3916 KB Output is correct
8 Correct 41 ms 2984 KB Output is correct
9 Correct 44 ms 3096 KB Output is correct
10 Correct 39 ms 3400 KB Output is correct
11 Correct 44 ms 3180 KB Output is correct
12 Correct 43 ms 3020 KB Output is correct
13 Correct 41 ms 2940 KB Output is correct
14 Correct 41 ms 3184 KB Output is correct
15 Correct 40 ms 3188 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 340 KB Output is correct
4 Correct 13 ms 1236 KB Output is correct
5 Correct 25 ms 2464 KB Output is correct
6 Correct 51 ms 3100 KB Output is correct
7 Correct 37 ms 3916 KB Output is correct
8 Correct 41 ms 2984 KB Output is correct
9 Correct 44 ms 3096 KB Output is correct
10 Correct 39 ms 3400 KB Output is correct
11 Correct 44 ms 3180 KB Output is correct
12 Correct 43 ms 3020 KB Output is correct
13 Correct 41 ms 2940 KB Output is correct
14 Correct 41 ms 3184 KB Output is correct
15 Correct 40 ms 3188 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 16 ms 1164 KB Output is correct
20 Correct 31 ms 2152 KB Output is correct
21 Correct 47 ms 3124 KB Output is correct
22 Correct 48 ms 3080 KB Output is correct
23 Correct 46 ms 3052 KB Output is correct
24 Correct 50 ms 2920 KB Output is correct
25 Correct 47 ms 2940 KB Output is correct
26 Correct 47 ms 2892 KB Output is correct
27 Correct 48 ms 2988 KB Output is correct
28 Correct 45 ms 3280 KB Output is correct
29 Correct 48 ms 2936 KB Output is correct
30 Correct 47 ms 2968 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 340 KB Output is correct
4 Correct 13 ms 1236 KB Output is correct
5 Correct 25 ms 2464 KB Output is correct
6 Correct 51 ms 3100 KB Output is correct
7 Correct 37 ms 3916 KB Output is correct
8 Correct 41 ms 2984 KB Output is correct
9 Correct 44 ms 3096 KB Output is correct
10 Correct 39 ms 3400 KB Output is correct
11 Correct 44 ms 3180 KB Output is correct
12 Correct 43 ms 3020 KB Output is correct
13 Correct 41 ms 2940 KB Output is correct
14 Correct 41 ms 3184 KB Output is correct
15 Correct 40 ms 3188 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 16 ms 1164 KB Output is correct
20 Correct 31 ms 2152 KB Output is correct
21 Correct 47 ms 3124 KB Output is correct
22 Correct 48 ms 3080 KB Output is correct
23 Correct 46 ms 3052 KB Output is correct
24 Correct 50 ms 2920 KB Output is correct
25 Correct 47 ms 2940 KB Output is correct
26 Correct 47 ms 2892 KB Output is correct
27 Correct 48 ms 2988 KB Output is correct
28 Correct 45 ms 3280 KB Output is correct
29 Correct 48 ms 2936 KB Output is correct
30 Correct 47 ms 2968 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 2 ms 368 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 724 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 10 ms 1108 KB Output is correct
40 Correct 23 ms 1892 KB Output is correct
41 Correct 38 ms 2724 KB Output is correct
42 Correct 37 ms 2712 KB Output is correct
43 Correct 47 ms 2644 KB Output is correct
44 Correct 46 ms 2704 KB Output is correct
45 Correct 38 ms 2664 KB Output is correct
46 Correct 37 ms 2708 KB Output is correct
47 Correct 45 ms 2676 KB Output is correct
48 Correct 39 ms 2676 KB Output is correct
49 Correct 37 ms 2712 KB Output is correct
50 Correct 43 ms 2704 KB Output is correct
51 Correct 38 ms 2796 KB Output is correct
52 Correct 40 ms 2692 KB Output is correct
53 Correct 39 ms 2676 KB Output is correct
54 Correct 37 ms 2704 KB Output is correct
55 Correct 36 ms 2708 KB Output is correct
56 Correct 37 ms 2644 KB Output is correct
57 Correct 36 ms 2704 KB Output is correct
58 Correct 38 ms 2652 KB Output is correct
59 Correct 40 ms 2812 KB Output is correct
60 Correct 37 ms 2644 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 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 340 KB Output is correct
14 Correct 13 ms 1236 KB Output is correct
15 Correct 25 ms 2464 KB Output is correct
16 Correct 51 ms 3100 KB Output is correct
17 Correct 37 ms 3916 KB Output is correct
18 Correct 41 ms 2984 KB Output is correct
19 Correct 44 ms 3096 KB Output is correct
20 Correct 39 ms 3400 KB Output is correct
21 Correct 44 ms 3180 KB Output is correct
22 Correct 43 ms 3020 KB Output is correct
23 Correct 41 ms 2940 KB Output is correct
24 Correct 41 ms 3184 KB Output is correct
25 Correct 40 ms 3188 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 16 ms 1164 KB Output is correct
30 Correct 31 ms 2152 KB Output is correct
31 Correct 47 ms 3124 KB Output is correct
32 Correct 48 ms 3080 KB Output is correct
33 Correct 46 ms 3052 KB Output is correct
34 Correct 50 ms 2920 KB Output is correct
35 Correct 47 ms 2940 KB Output is correct
36 Correct 47 ms 2892 KB Output is correct
37 Correct 48 ms 2988 KB Output is correct
38 Correct 45 ms 3280 KB Output is correct
39 Correct 48 ms 2936 KB Output is correct
40 Correct 47 ms 2968 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 2 ms 368 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 5 ms 724 KB Output is correct
49 Correct 10 ms 1108 KB Output is correct
50 Correct 23 ms 1892 KB Output is correct
51 Correct 38 ms 2724 KB Output is correct
52 Correct 37 ms 2712 KB Output is correct
53 Correct 47 ms 2644 KB Output is correct
54 Correct 46 ms 2704 KB Output is correct
55 Correct 38 ms 2664 KB Output is correct
56 Correct 37 ms 2708 KB Output is correct
57 Correct 45 ms 2676 KB Output is correct
58 Correct 39 ms 2676 KB Output is correct
59 Correct 37 ms 2712 KB Output is correct
60 Correct 43 ms 2704 KB Output is correct
61 Correct 38 ms 2796 KB Output is correct
62 Correct 40 ms 2692 KB Output is correct
63 Correct 39 ms 2676 KB Output is correct
64 Correct 37 ms 2704 KB Output is correct
65 Correct 36 ms 2708 KB Output is correct
66 Correct 37 ms 2644 KB Output is correct
67 Correct 36 ms 2704 KB Output is correct
68 Correct 38 ms 2652 KB Output is correct
69 Correct 40 ms 2812 KB Output is correct
70 Correct 37 ms 2644 KB Output is correct
71 Correct 4 ms 724 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 4 ms 724 KB Output is correct
74 Correct 4 ms 724 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 8 ms 1108 KB Output is correct
77 Correct 8 ms 1108 KB Output is correct
78 Correct 8 ms 1108 KB Output is correct
79 Correct 11 ms 1116 KB Output is correct
80 Correct 7 ms 1108 KB Output is correct
81 Correct 15 ms 1892 KB Output is correct
82 Correct 15 ms 1876 KB Output is correct
83 Correct 15 ms 1896 KB Output is correct
84 Correct 18 ms 1892 KB Output is correct
85 Correct 16 ms 1896 KB Output is correct
86 Correct 18 ms 2048 KB Output is correct
87 Correct 18 ms 2060 KB Output is correct
88 Correct 16 ms 2004 KB Output is correct
89 Correct 16 ms 2004 KB Output is correct
90 Correct 17 ms 2016 KB Output is correct
91 Correct 26 ms 3436 KB Output is correct
92 Correct 27 ms 3436 KB Output is correct
93 Correct 26 ms 3448 KB Output is correct
94 Correct 25 ms 3432 KB Output is correct
95 Correct 26 ms 3448 KB Output is correct
96 Correct 30 ms 4188 KB Output is correct
97 Correct 29 ms 4180 KB Output is correct
98 Correct 29 ms 4188 KB Output is correct
99 Correct 30 ms 4212 KB Output is correct
100 Correct 31 ms 4240 KB Output is correct
101 Correct 30 ms 4228 KB Output is correct
102 Correct 29 ms 4212 KB Output is correct
103 Correct 29 ms 4212 KB Output is correct
104 Correct 29 ms 4192 KB Output is correct
105 Correct 35 ms 4180 KB Output is correct
106 Correct 29 ms 4564 KB Output is correct
107 Correct 30 ms 4596 KB Output is correct
108 Correct 30 ms 4592 KB Output is correct
109 Correct 29 ms 4604 KB Output is correct
110 Correct 32 ms 4704 KB Output is correct
111 Correct 31 ms 4588 KB Output is correct
112 Correct 30 ms 4588 KB Output is correct
113 Correct 30 ms 4596 KB Output is correct
114 Correct 29 ms 4600 KB Output is correct
115 Correct 29 ms 4564 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 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 340 KB Output is correct
14 Correct 13 ms 1236 KB Output is correct
15 Correct 25 ms 2464 KB Output is correct
16 Correct 51 ms 3100 KB Output is correct
17 Correct 37 ms 3916 KB Output is correct
18 Correct 41 ms 2984 KB Output is correct
19 Correct 44 ms 3096 KB Output is correct
20 Correct 39 ms 3400 KB Output is correct
21 Correct 44 ms 3180 KB Output is correct
22 Correct 43 ms 3020 KB Output is correct
23 Correct 41 ms 2940 KB Output is correct
24 Correct 41 ms 3184 KB Output is correct
25 Correct 40 ms 3188 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 16 ms 1164 KB Output is correct
30 Correct 31 ms 2152 KB Output is correct
31 Correct 47 ms 3124 KB Output is correct
32 Correct 48 ms 3080 KB Output is correct
33 Correct 46 ms 3052 KB Output is correct
34 Correct 50 ms 2920 KB Output is correct
35 Correct 47 ms 2940 KB Output is correct
36 Correct 47 ms 2892 KB Output is correct
37 Correct 48 ms 2988 KB Output is correct
38 Correct 45 ms 3280 KB Output is correct
39 Correct 48 ms 2936 KB Output is correct
40 Correct 47 ms 2968 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 2 ms 368 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 5 ms 724 KB Output is correct
49 Correct 10 ms 1108 KB Output is correct
50 Correct 23 ms 1892 KB Output is correct
51 Correct 38 ms 2724 KB Output is correct
52 Correct 37 ms 2712 KB Output is correct
53 Correct 47 ms 2644 KB Output is correct
54 Correct 46 ms 2704 KB Output is correct
55 Correct 38 ms 2664 KB Output is correct
56 Correct 37 ms 2708 KB Output is correct
57 Correct 45 ms 2676 KB Output is correct
58 Correct 39 ms 2676 KB Output is correct
59 Correct 37 ms 2712 KB Output is correct
60 Correct 43 ms 2704 KB Output is correct
61 Correct 38 ms 2796 KB Output is correct
62 Correct 40 ms 2692 KB Output is correct
63 Correct 39 ms 2676 KB Output is correct
64 Correct 37 ms 2704 KB Output is correct
65 Correct 36 ms 2708 KB Output is correct
66 Correct 37 ms 2644 KB Output is correct
67 Correct 36 ms 2704 KB Output is correct
68 Correct 38 ms 2652 KB Output is correct
69 Correct 40 ms 2812 KB Output is correct
70 Correct 37 ms 2644 KB Output is correct
71 Correct 4 ms 724 KB Output is correct
72 Correct 4 ms 724 KB Output is correct
73 Correct 4 ms 724 KB Output is correct
74 Correct 4 ms 724 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 8 ms 1108 KB Output is correct
77 Correct 8 ms 1108 KB Output is correct
78 Correct 8 ms 1108 KB Output is correct
79 Correct 11 ms 1116 KB Output is correct
80 Correct 7 ms 1108 KB Output is correct
81 Correct 15 ms 1892 KB Output is correct
82 Correct 15 ms 1876 KB Output is correct
83 Correct 15 ms 1896 KB Output is correct
84 Correct 18 ms 1892 KB Output is correct
85 Correct 16 ms 1896 KB Output is correct
86 Correct 18 ms 2048 KB Output is correct
87 Correct 18 ms 2060 KB Output is correct
88 Correct 16 ms 2004 KB Output is correct
89 Correct 16 ms 2004 KB Output is correct
90 Correct 17 ms 2016 KB Output is correct
91 Correct 26 ms 3436 KB Output is correct
92 Correct 27 ms 3436 KB Output is correct
93 Correct 26 ms 3448 KB Output is correct
94 Correct 25 ms 3432 KB Output is correct
95 Correct 26 ms 3448 KB Output is correct
96 Correct 30 ms 4188 KB Output is correct
97 Correct 29 ms 4180 KB Output is correct
98 Correct 29 ms 4188 KB Output is correct
99 Correct 30 ms 4212 KB Output is correct
100 Correct 31 ms 4240 KB Output is correct
101 Correct 30 ms 4228 KB Output is correct
102 Correct 29 ms 4212 KB Output is correct
103 Correct 29 ms 4212 KB Output is correct
104 Correct 29 ms 4192 KB Output is correct
105 Correct 35 ms 4180 KB Output is correct
106 Correct 29 ms 4564 KB Output is correct
107 Correct 30 ms 4596 KB Output is correct
108 Correct 30 ms 4592 KB Output is correct
109 Correct 29 ms 4604 KB Output is correct
110 Correct 32 ms 4704 KB Output is correct
111 Correct 31 ms 4588 KB Output is correct
112 Correct 30 ms 4588 KB Output is correct
113 Correct 30 ms 4596 KB Output is correct
114 Correct 29 ms 4600 KB Output is correct
115 Correct 29 ms 4564 KB Output is correct
116 Correct 1655 ms 2468 KB Output is correct
117 Correct 1252 ms 2380 KB Output is correct
118 Correct 2228 ms 2812 KB Output is correct
119 Correct 992 ms 2820 KB Output is correct
120 Correct 595 ms 2816 KB Output is correct
121 Correct 1166 ms 3228 KB Output is correct
122 Correct 727 ms 3224 KB Output is correct
123 Correct 3057 ms 4152 KB Output is correct
124 Correct 1016 ms 4152 KB Output is correct
125 Correct 778 ms 4184 KB Output is correct
126 Execution timed out 7004 ms 4200 KB Time limit exceeded
127 Halted 0 ms 0 KB -