oj.uz

답안 #526204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526204 2022-02-13T22:54:34 Z Plurm Diversity (CEOI21_diversity) C++11
64 / 100
 7000 ms 17084 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

template <typename T>
class FenwickTree{
public:
  T* FT;
  int n;
  bool negmode;
  FenwickTree(int sz = 1 << 19, bool negindex = true){
    n = sz+505;
    FT = new T[n];
    fill(FT, FT+n, (T)0);
    negmode = negindex;
  }
  void add(int idx, T amt){
    if(negmode) idx += n/2;
    while(idx < n){
      FT[idx] += amt;
      idx += idx & -idx;
    }
  }
  T sum(int idx){
    if(negmode) idx += n/2;
    T ret = (T)0;
    while(idx > 0){
      ret += FT[idx];
      idx -= idx & -idx;
    }
    return ret;
  }
  int lower_bound(const int v){
    if(v > FT[1]) return 0;
    int cur = 1 << 18;
    int part = FT[cur];
    for(int i = 17; i >= 0; i--){
      if(part >= v){
        cur += 1 << i;
        part += FT[cur];
      }else{
        part -= FT[cur];
        cur -= 1 << i;
        part += FT[cur];
      }
    }
    if(part < v) return cur-1;
    return cur;
  }
  int upper_bound(const int v){
    return lower_bound(v+1);
  }
};

FenwickTree<int> FT1; // Ri
FenwickTree<long long> FT2; // Ri * i
int cnt[300005];
int a[300005];
// abstract deque
// fenwick indexing:
// [...] [-3] [-2] [-1] [0] [1] [2] [...]
// deque indexing:
// [...] [6] [4] [2] [1] [3] [5] [...]
// invariant:
// dq[-i] <= dq[i] for all positive i
// dq[-i] >= dq[i+1] for all positive i

int dq2fw(int idx){
  return idx/2 * (idx % 2 ? 1 : -1);
}

FenwickTree<int> dq(300000, false); // using deque indexing
long long deque_add(const int x){
  int idx = dq.upper_bound(x)+1;
  dq.add(idx, 1);
  dq.add(idx+1, -1);
  int b = dq2fw(idx);
  FT1.add(b, 1);
  FT2.add(b, b);
  return FT2.FT[1 << 19] - FT2.sum(b) - 1ll * (b-1) * (FT1.FT[1 << 19] - FT1.sum(b))
  + 1ll * (b+1) * FT1.sum(b-1) - FT2.sum(b-1) + x+1;
}
long long deque_remove(const int x){
  int idx = dq.lower_bound(x);
  dq.add(idx, -1);
  dq.add(idx+1, 1);
  int b = dq2fw(idx);
  FT1.add(b, -1);
  FT2.add(b, -b);
  return FT2.FT[1 << 19] - FT2.sum(b) - 1ll * (b-1) * (FT1.FT[1 << 19] - FT1.sum(b))
  + 1ll * (b+1) * FT1.sum(b-1) - FT2.sum(b-1) + x;
}

vector<tuple<int,int,int>> qbckt[300005]; // (L, R, Q)
long long answer[50005];
int qcnt[2048];

int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i = 1; i <= n; i++){
		scanf("%d",a+i);
	}
  int SQRT = 1.1*n/sqrt(q);
  vector<pair<int,int>> rawq;
  for(int i = 0; i < q; i++){
    int l, r;
    scanf("%d%d",&l,&r);
    rawq.emplace_back(l,r);
    qcnt[l/SQRT]++;
  }
  for(int i = 0; i <= n/SQRT+2; i++){
    qbckt[i].reserve(qcnt[i]);
  }
  for(int i = 0; i < q; i++){
    int l, r;
    tie(l, r) = rawq[i];
    qbckt[l / SQRT].emplace_back(l, r, i);
  }
  int lptr = 1;
  int rptr = 0;
  long long ans = 0ll;
  for(int i = 0; i <= n/SQRT+2; i++){
    sort(qbckt[i].begin(), qbckt[i].end(), [](tuple<int,int,int> x, tuple<int,int,int> y){
      return get<1>(x) < get<1>(y);
    });
    // Below goes declaratively.
    for(auto qr : qbckt[i]){
      int l, r, qnum;
      tie(l, r, qnum) = qr;
      while(rptr < r){
        rptr++;
        ans += deque_add(cnt[a[rptr]]);
        cnt[a[rptr]]++;
      }
      while(lptr > l){
        lptr--;
        ans += deque_add(cnt[a[lptr]]);
        cnt[a[lptr]]++;
      }
      while(lptr < l){
        ans -= deque_remove(cnt[a[lptr]]);
        cnt[a[lptr]]--;
        lptr++;
      }
      while(rptr > r){
        ans -= deque_remove(cnt[a[rptr]]);
        cnt[a[rptr]]--;
        rptr--;
      }
      answer[qnum] = ans;
    }
  }
  for(int i = 0; i < q; i++){
    printf("%lld\n", answer[i]);
  }
	return 0;
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:100:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  100 |  scanf("%d%d",&n,&q);
      |  ~~~~~^~~~~~~~~~~~~~
diversity.cpp:102:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |   scanf("%d",a+i);
      |   ~~~~~^~~~~~~~~~
diversity.cpp:108:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |     scanf("%d%d",&l,&r);
      |     ~~~~~^~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 8 ms 14720 KB Output is correct
3 Correct 9 ms 14668 KB Output is correct
4 Correct 36 ms 15016 KB Output is correct
5 Correct 58 ms 15432 KB Output is correct
6 Correct 90 ms 15856 KB Output is correct
7 Correct 91 ms 15752 KB Output is correct
8 Correct 86 ms 15852 KB Output is correct
9 Correct 89 ms 15856 KB Output is correct
10 Correct 85 ms 15820 KB Output is correct
11 Correct 85 ms 15820 KB Output is correct
12 Correct 86 ms 15856 KB Output is correct
13 Correct 84 ms 15820 KB Output is correct
14 Correct 96 ms 15940 KB Output is correct
15 Correct 87 ms 15744 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 8 ms 14720 KB Output is correct
3 Correct 9 ms 14668 KB Output is correct
4 Correct 36 ms 15016 KB Output is correct
5 Correct 58 ms 15432 KB Output is correct
6 Correct 90 ms 15856 KB Output is correct
7 Correct 91 ms 15752 KB Output is correct
8 Correct 86 ms 15852 KB Output is correct
9 Correct 89 ms 15856 KB Output is correct
10 Correct 85 ms 15820 KB Output is correct
11 Correct 85 ms 15820 KB Output is correct
12 Correct 86 ms 15856 KB Output is correct
13 Correct 84 ms 15820 KB Output is correct
14 Correct 96 ms 15940 KB Output is correct
15 Correct 87 ms 15744 KB Output is correct
16 Correct 7 ms 14668 KB Output is correct
17 Correct 7 ms 14668 KB Output is correct
18 Correct 10 ms 14668 KB Output is correct
19 Correct 32 ms 15084 KB Output is correct
20 Correct 62 ms 15472 KB Output is correct
21 Correct 86 ms 15800 KB Output is correct
22 Correct 94 ms 15968 KB Output is correct
23 Correct 87 ms 15784 KB Output is correct
24 Correct 86 ms 15760 KB Output is correct
25 Correct 85 ms 15844 KB Output is correct
26 Correct 89 ms 15820 KB Output is correct
27 Correct 85 ms 15856 KB Output is correct
28 Correct 102 ms 15856 KB Output is correct
29 Correct 90 ms 15852 KB Output is correct
30 Correct 90 ms 15852 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 8 ms 14720 KB Output is correct
3 Correct 9 ms 14668 KB Output is correct
4 Correct 36 ms 15016 KB Output is correct
5 Correct 58 ms 15432 KB Output is correct
6 Correct 90 ms 15856 KB Output is correct
7 Correct 91 ms 15752 KB Output is correct
8 Correct 86 ms 15852 KB Output is correct
9 Correct 89 ms 15856 KB Output is correct
10 Correct 85 ms 15820 KB Output is correct
11 Correct 85 ms 15820 KB Output is correct
12 Correct 86 ms 15856 KB Output is correct
13 Correct 84 ms 15820 KB Output is correct
14 Correct 96 ms 15940 KB Output is correct
15 Correct 87 ms 15744 KB Output is correct
16 Correct 7 ms 14668 KB Output is correct
17 Correct 7 ms 14668 KB Output is correct
18 Correct 10 ms 14668 KB Output is correct
19 Correct 32 ms 15084 KB Output is correct
20 Correct 62 ms 15472 KB Output is correct
21 Correct 86 ms 15800 KB Output is correct
22 Correct 94 ms 15968 KB Output is correct
23 Correct 87 ms 15784 KB Output is correct
24 Correct 86 ms 15760 KB Output is correct
25 Correct 85 ms 15844 KB Output is correct
26 Correct 89 ms 15820 KB Output is correct
27 Correct 85 ms 15856 KB Output is correct
28 Correct 102 ms 15856 KB Output is correct
29 Correct 90 ms 15852 KB Output is correct
30 Correct 90 ms 15852 KB Output is correct
31 Correct 7 ms 14668 KB Output is correct
32 Correct 7 ms 14668 KB Output is correct
33 Correct 7 ms 14668 KB Output is correct
34 Correct 9 ms 14668 KB Output is correct
35 Correct 11 ms 14668 KB Output is correct
36 Correct 12 ms 14668 KB Output is correct
37 Correct 21 ms 14880 KB Output is correct
38 Correct 22 ms 14900 KB Output is correct
39 Correct 37 ms 15052 KB Output is correct
40 Correct 67 ms 15428 KB Output is correct
41 Correct 92 ms 15856 KB Output is correct
42 Correct 90 ms 15860 KB Output is correct
43 Correct 91 ms 15876 KB Output is correct
44 Correct 91 ms 15880 KB Output is correct
45 Correct 91 ms 15860 KB Output is correct
46 Correct 99 ms 15820 KB Output is correct
47 Correct 100 ms 15860 KB Output is correct
48 Correct 93 ms 15856 KB Output is correct
49 Correct 96 ms 15792 KB Output is correct
50 Correct 96 ms 15860 KB Output is correct
51 Correct 95 ms 15872 KB Output is correct
52 Correct 90 ms 15852 KB Output is correct
53 Correct 93 ms 15860 KB Output is correct
54 Correct 91 ms 15824 KB Output is correct
55 Correct 99 ms 15860 KB Output is correct
56 Correct 93 ms 15856 KB Output is correct
57 Correct 90 ms 15752 KB Output is correct
58 Correct 91 ms 15824 KB Output is correct
59 Correct 94 ms 15856 KB Output is correct
60 Correct 91 ms 15856 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 7 ms 14668 KB Output is correct
3 Correct 7 ms 14668 KB Output is correct
4 Correct 7 ms 14632 KB Output is correct
5 Correct 7 ms 14668 KB Output is correct
6 Correct 6 ms 14668 KB Output is correct
7 Correct 7 ms 14596 KB Output is correct
8 Correct 8 ms 14668 KB Output is correct
9 Correct 7 ms 14668 KB Output is correct
10 Correct 7 ms 14668 KB Output is correct
11 Correct 7 ms 14668 KB Output is correct
12 Correct 8 ms 14720 KB Output is correct
13 Correct 9 ms 14668 KB Output is correct
14 Correct 36 ms 15016 KB Output is correct
15 Correct 58 ms 15432 KB Output is correct
16 Correct 90 ms 15856 KB Output is correct
17 Correct 91 ms 15752 KB Output is correct
18 Correct 86 ms 15852 KB Output is correct
19 Correct 89 ms 15856 KB Output is correct
20 Correct 85 ms 15820 KB Output is correct
21 Correct 85 ms 15820 KB Output is correct
22 Correct 86 ms 15856 KB Output is correct
23 Correct 84 ms 15820 KB Output is correct
24 Correct 96 ms 15940 KB Output is correct
25 Correct 87 ms 15744 KB Output is correct
26 Correct 7 ms 14668 KB Output is correct
27 Correct 7 ms 14668 KB Output is correct
28 Correct 10 ms 14668 KB Output is correct
29 Correct 32 ms 15084 KB Output is correct
30 Correct 62 ms 15472 KB Output is correct
31 Correct 86 ms 15800 KB Output is correct
32 Correct 94 ms 15968 KB Output is correct
33 Correct 87 ms 15784 KB Output is correct
34 Correct 86 ms 15760 KB Output is correct
35 Correct 85 ms 15844 KB Output is correct
36 Correct 89 ms 15820 KB Output is correct
37 Correct 85 ms 15856 KB Output is correct
38 Correct 102 ms 15856 KB Output is correct
39 Correct 90 ms 15852 KB Output is correct
40 Correct 90 ms 15852 KB Output is correct
41 Correct 7 ms 14668 KB Output is correct
42 Correct 7 ms 14668 KB Output is correct
43 Correct 7 ms 14668 KB Output is correct
44 Correct 9 ms 14668 KB Output is correct
45 Correct 11 ms 14668 KB Output is correct
46 Correct 12 ms 14668 KB Output is correct
47 Correct 21 ms 14880 KB Output is correct
48 Correct 22 ms 14900 KB Output is correct
49 Correct 37 ms 15052 KB Output is correct
50 Correct 67 ms 15428 KB Output is correct
51 Correct 92 ms 15856 KB Output is correct
52 Correct 90 ms 15860 KB Output is correct
53 Correct 91 ms 15876 KB Output is correct
54 Correct 91 ms 15880 KB Output is correct
55 Correct 91 ms 15860 KB Output is correct
56 Correct 99 ms 15820 KB Output is correct
57 Correct 100 ms 15860 KB Output is correct
58 Correct 93 ms 15856 KB Output is correct
59 Correct 96 ms 15792 KB Output is correct
60 Correct 96 ms 15860 KB Output is correct
61 Correct 95 ms 15872 KB Output is correct
62 Correct 90 ms 15852 KB Output is correct
63 Correct 93 ms 15860 KB Output is correct
64 Correct 91 ms 15824 KB Output is correct
65 Correct 99 ms 15860 KB Output is correct
66 Correct 93 ms 15856 KB Output is correct
67 Correct 90 ms 15752 KB Output is correct
68 Correct 91 ms 15824 KB Output is correct
69 Correct 94 ms 15856 KB Output is correct
70 Correct 91 ms 15856 KB Output is correct
71 Correct 22 ms 14796 KB Output is correct
72 Correct 21 ms 14836 KB Output is correct
73 Correct 21 ms 14796 KB Output is correct
74 Correct 22 ms 14828 KB Output is correct
75 Correct 21 ms 14796 KB Output is correct
76 Correct 37 ms 15052 KB Output is correct
77 Correct 37 ms 15008 KB Output is correct
78 Correct 39 ms 15052 KB Output is correct
79 Correct 40 ms 15148 KB Output is correct
80 Correct 37 ms 15108 KB Output is correct
81 Correct 69 ms 15512 KB Output is correct
82 Correct 68 ms 15448 KB Output is correct
83 Correct 66 ms 15436 KB Output is correct
84 Correct 67 ms 15516 KB Output is correct
85 Correct 68 ms 15428 KB Output is correct
86 Correct 72 ms 15564 KB Output is correct
87 Correct 70 ms 15504 KB Output is correct
88 Correct 70 ms 15544 KB Output is correct
89 Correct 69 ms 15436 KB Output is correct
90 Correct 70 ms 15496 KB Output is correct
91 Correct 99 ms 16248 KB Output is correct
92 Correct 100 ms 16244 KB Output is correct
93 Correct 97 ms 16256 KB Output is correct
94 Correct 97 ms 16244 KB Output is correct
95 Correct 97 ms 16152 KB Output is correct
96 Correct 98 ms 16640 KB Output is correct
97 Correct 106 ms 16752 KB Output is correct
98 Correct 100 ms 16632 KB Output is correct
99 Correct 122 ms 16636 KB Output is correct
100 Correct 103 ms 16636 KB Output is correct
101 Correct 99 ms 16580 KB Output is correct
102 Correct 104 ms 16636 KB Output is correct
103 Correct 97 ms 16640 KB Output is correct
104 Correct 98 ms 16636 KB Output is correct
105 Correct 110 ms 16556 KB Output is correct
106 Correct 96 ms 16824 KB Output is correct
107 Correct 95 ms 16808 KB Output is correct
108 Correct 97 ms 16836 KB Output is correct
109 Correct 91 ms 16836 KB Output is correct
110 Correct 100 ms 16832 KB Output is correct
111 Correct 92 ms 16712 KB Output is correct
112 Correct 104 ms 16832 KB Output is correct
113 Correct 118 ms 16796 KB Output is correct
114 Correct 92 ms 16832 KB Output is correct
115 Correct 92 ms 16832 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 7 ms 14668 KB Output is correct
3 Correct 7 ms 14668 KB Output is correct
4 Correct 7 ms 14632 KB Output is correct
5 Correct 7 ms 14668 KB Output is correct
6 Correct 6 ms 14668 KB Output is correct
7 Correct 7 ms 14596 KB Output is correct
8 Correct 8 ms 14668 KB Output is correct
9 Correct 7 ms 14668 KB Output is correct
10 Correct 7 ms 14668 KB Output is correct
11 Correct 7 ms 14668 KB Output is correct
12 Correct 8 ms 14720 KB Output is correct
13 Correct 9 ms 14668 KB Output is correct
14 Correct 36 ms 15016 KB Output is correct
15 Correct 58 ms 15432 KB Output is correct
16 Correct 90 ms 15856 KB Output is correct
17 Correct 91 ms 15752 KB Output is correct
18 Correct 86 ms 15852 KB Output is correct
19 Correct 89 ms 15856 KB Output is correct
20 Correct 85 ms 15820 KB Output is correct
21 Correct 85 ms 15820 KB Output is correct
22 Correct 86 ms 15856 KB Output is correct
23 Correct 84 ms 15820 KB Output is correct
24 Correct 96 ms 15940 KB Output is correct
25 Correct 87 ms 15744 KB Output is correct
26 Correct 7 ms 14668 KB Output is correct
27 Correct 7 ms 14668 KB Output is correct
28 Correct 10 ms 14668 KB Output is correct
29 Correct 32 ms 15084 KB Output is correct
30 Correct 62 ms 15472 KB Output is correct
31 Correct 86 ms 15800 KB Output is correct
32 Correct 94 ms 15968 KB Output is correct
33 Correct 87 ms 15784 KB Output is correct
34 Correct 86 ms 15760 KB Output is correct
35 Correct 85 ms 15844 KB Output is correct
36 Correct 89 ms 15820 KB Output is correct
37 Correct 85 ms 15856 KB Output is correct
38 Correct 102 ms 15856 KB Output is correct
39 Correct 90 ms 15852 KB Output is correct
40 Correct 90 ms 15852 KB Output is correct
41 Correct 7 ms 14668 KB Output is correct
42 Correct 7 ms 14668 KB Output is correct
43 Correct 7 ms 14668 KB Output is correct
44 Correct 9 ms 14668 KB Output is correct
45 Correct 11 ms 14668 KB Output is correct
46 Correct 12 ms 14668 KB Output is correct
47 Correct 21 ms 14880 KB Output is correct
48 Correct 22 ms 14900 KB Output is correct
49 Correct 37 ms 15052 KB Output is correct
50 Correct 67 ms 15428 KB Output is correct
51 Correct 92 ms 15856 KB Output is correct
52 Correct 90 ms 15860 KB Output is correct
53 Correct 91 ms 15876 KB Output is correct
54 Correct 91 ms 15880 KB Output is correct
55 Correct 91 ms 15860 KB Output is correct
56 Correct 99 ms 15820 KB Output is correct
57 Correct 100 ms 15860 KB Output is correct
58 Correct 93 ms 15856 KB Output is correct
59 Correct 96 ms 15792 KB Output is correct
60 Correct 96 ms 15860 KB Output is correct
61 Correct 95 ms 15872 KB Output is correct
62 Correct 90 ms 15852 KB Output is correct
63 Correct 93 ms 15860 KB Output is correct
64 Correct 91 ms 15824 KB Output is correct
65 Correct 99 ms 15860 KB Output is correct
66 Correct 93 ms 15856 KB Output is correct
67 Correct 90 ms 15752 KB Output is correct
68 Correct 91 ms 15824 KB Output is correct
69 Correct 94 ms 15856 KB Output is correct
70 Correct 91 ms 15856 KB Output is correct
71 Correct 22 ms 14796 KB Output is correct
72 Correct 21 ms 14836 KB Output is correct
73 Correct 21 ms 14796 KB Output is correct
74 Correct 22 ms 14828 KB Output is correct
75 Correct 21 ms 14796 KB Output is correct
76 Correct 37 ms 15052 KB Output is correct
77 Correct 37 ms 15008 KB Output is correct
78 Correct 39 ms 15052 KB Output is correct
79 Correct 40 ms 15148 KB Output is correct
80 Correct 37 ms 15108 KB Output is correct
81 Correct 69 ms 15512 KB Output is correct
82 Correct 68 ms 15448 KB Output is correct
83 Correct 66 ms 15436 KB Output is correct
84 Correct 67 ms 15516 KB Output is correct
85 Correct 68 ms 15428 KB Output is correct
86 Correct 72 ms 15564 KB Output is correct
87 Correct 70 ms 15504 KB Output is correct
88 Correct 70 ms 15544 KB Output is correct
89 Correct 69 ms 15436 KB Output is correct
90 Correct 70 ms 15496 KB Output is correct
91 Correct 99 ms 16248 KB Output is correct
92 Correct 100 ms 16244 KB Output is correct
93 Correct 97 ms 16256 KB Output is correct
94 Correct 97 ms 16244 KB Output is correct
95 Correct 97 ms 16152 KB Output is correct
96 Correct 98 ms 16640 KB Output is correct
97 Correct 106 ms 16752 KB Output is correct
98 Correct 100 ms 16632 KB Output is correct
99 Correct 122 ms 16636 KB Output is correct
100 Correct 103 ms 16636 KB Output is correct
101 Correct 99 ms 16580 KB Output is correct
102 Correct 104 ms 16636 KB Output is correct
103 Correct 97 ms 16640 KB Output is correct
104 Correct 98 ms 16636 KB Output is correct
105 Correct 110 ms 16556 KB Output is correct
106 Correct 96 ms 16824 KB Output is correct
107 Correct 95 ms 16808 KB Output is correct
108 Correct 97 ms 16836 KB Output is correct
109 Correct 91 ms 16836 KB Output is correct
110 Correct 100 ms 16832 KB Output is correct
111 Correct 92 ms 16712 KB Output is correct
112 Correct 104 ms 16832 KB Output is correct
113 Correct 118 ms 16796 KB Output is correct
114 Correct 92 ms 16832 KB Output is correct
115 Correct 92 ms 16832 KB Output is correct
116 Correct 629 ms 16484 KB Output is correct
117 Correct 627 ms 16484 KB Output is correct
118 Correct 3143 ms 16768 KB Output is correct
119 Correct 3201 ms 16772 KB Output is correct
120 Correct 3280 ms 16772 KB Output is correct
121 Correct 6760 ms 17084 KB Output is correct
122 Correct 6698 ms 16976 KB Output is correct
123 Execution timed out 7098 ms 16844 KB Time limit exceeded
124 Halted 0 ms 0 KB -