oj.uz

답안 #526288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526288 2022-02-14T07:57:05 Z Plurm Diversity (CEOI21_diversity) C++11
64 / 100
 7000 ms 16152 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+512;
    FT = new T[n];
    memset(FT, 0, 4*n);
    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 = 800;
  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 6 ms 12624 KB Output is correct
2 Correct 7 ms 12620 KB Output is correct
3 Correct 6 ms 12620 KB Output is correct
4 Correct 7 ms 12620 KB Output is correct
5 Correct 6 ms 12620 KB Output is correct
6 Correct 9 ms 12620 KB Output is correct
7 Correct 7 ms 12600 KB Output is correct
8 Correct 6 ms 12620 KB Output is correct
9 Correct 6 ms 12620 KB Output is correct
10 Correct 7 ms 12652 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12620 KB Output is correct
2 Correct 6 ms 12620 KB Output is correct
3 Correct 9 ms 12736 KB Output is correct
4 Correct 34 ms 12980 KB Output is correct
5 Correct 62 ms 13420 KB Output is correct
6 Correct 94 ms 13960 KB Output is correct
7 Correct 101 ms 13848 KB Output is correct
8 Correct 93 ms 13844 KB Output is correct
9 Correct 85 ms 13772 KB Output is correct
10 Correct 88 ms 13800 KB Output is correct
11 Correct 90 ms 13932 KB Output is correct
12 Correct 94 ms 13764 KB Output is correct
13 Correct 106 ms 13848 KB Output is correct
14 Correct 84 ms 13904 KB Output is correct
15 Correct 85 ms 13832 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12620 KB Output is correct
2 Correct 6 ms 12620 KB Output is correct
3 Correct 9 ms 12736 KB Output is correct
4 Correct 34 ms 12980 KB Output is correct
5 Correct 62 ms 13420 KB Output is correct
6 Correct 94 ms 13960 KB Output is correct
7 Correct 101 ms 13848 KB Output is correct
8 Correct 93 ms 13844 KB Output is correct
9 Correct 85 ms 13772 KB Output is correct
10 Correct 88 ms 13800 KB Output is correct
11 Correct 90 ms 13932 KB Output is correct
12 Correct 94 ms 13764 KB Output is correct
13 Correct 106 ms 13848 KB Output is correct
14 Correct 84 ms 13904 KB Output is correct
15 Correct 85 ms 13832 KB Output is correct
16 Correct 6 ms 12620 KB Output is correct
17 Correct 7 ms 12620 KB Output is correct
18 Correct 9 ms 12748 KB Output is correct
19 Correct 33 ms 13048 KB Output is correct
20 Correct 61 ms 13456 KB Output is correct
21 Correct 88 ms 13764 KB Output is correct
22 Correct 103 ms 13840 KB Output is correct
23 Correct 113 ms 13848 KB Output is correct
24 Correct 87 ms 13892 KB Output is correct
25 Correct 86 ms 13848 KB Output is correct
26 Correct 89 ms 13840 KB Output is correct
27 Correct 88 ms 13764 KB Output is correct
28 Correct 89 ms 13756 KB Output is correct
29 Correct 111 ms 13852 KB Output is correct
30 Correct 99 ms 13804 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12620 KB Output is correct
2 Correct 6 ms 12620 KB Output is correct
3 Correct 9 ms 12736 KB Output is correct
4 Correct 34 ms 12980 KB Output is correct
5 Correct 62 ms 13420 KB Output is correct
6 Correct 94 ms 13960 KB Output is correct
7 Correct 101 ms 13848 KB Output is correct
8 Correct 93 ms 13844 KB Output is correct
9 Correct 85 ms 13772 KB Output is correct
10 Correct 88 ms 13800 KB Output is correct
11 Correct 90 ms 13932 KB Output is correct
12 Correct 94 ms 13764 KB Output is correct
13 Correct 106 ms 13848 KB Output is correct
14 Correct 84 ms 13904 KB Output is correct
15 Correct 85 ms 13832 KB Output is correct
16 Correct 6 ms 12620 KB Output is correct
17 Correct 7 ms 12620 KB Output is correct
18 Correct 9 ms 12748 KB Output is correct
19 Correct 33 ms 13048 KB Output is correct
20 Correct 61 ms 13456 KB Output is correct
21 Correct 88 ms 13764 KB Output is correct
22 Correct 103 ms 13840 KB Output is correct
23 Correct 113 ms 13848 KB Output is correct
24 Correct 87 ms 13892 KB Output is correct
25 Correct 86 ms 13848 KB Output is correct
26 Correct 89 ms 13840 KB Output is correct
27 Correct 88 ms 13764 KB Output is correct
28 Correct 89 ms 13756 KB Output is correct
29 Correct 111 ms 13852 KB Output is correct
30 Correct 99 ms 13804 KB Output is correct
31 Correct 6 ms 12620 KB Output is correct
32 Correct 7 ms 12620 KB Output is correct
33 Correct 7 ms 12708 KB Output is correct
34 Correct 9 ms 12736 KB Output is correct
35 Correct 9 ms 12748 KB Output is correct
36 Correct 9 ms 12748 KB Output is correct
37 Correct 20 ms 12900 KB Output is correct
38 Correct 21 ms 12836 KB Output is correct
39 Correct 47 ms 13088 KB Output is correct
40 Correct 70 ms 13392 KB Output is correct
41 Correct 96 ms 13772 KB Output is correct
42 Correct 96 ms 13856 KB Output is correct
43 Correct 90 ms 13856 KB Output is correct
44 Correct 93 ms 13796 KB Output is correct
45 Correct 97 ms 13816 KB Output is correct
46 Correct 94 ms 13816 KB Output is correct
47 Correct 91 ms 13852 KB Output is correct
48 Correct 97 ms 13852 KB Output is correct
49 Correct 92 ms 13852 KB Output is correct
50 Correct 112 ms 13848 KB Output is correct
51 Correct 107 ms 13852 KB Output is correct
52 Correct 91 ms 13784 KB Output is correct
53 Correct 93 ms 13772 KB Output is correct
54 Correct 93 ms 13772 KB Output is correct
55 Correct 93 ms 13772 KB Output is correct
56 Correct 96 ms 13772 KB Output is correct
57 Correct 94 ms 13844 KB Output is correct
58 Correct 92 ms 13848 KB Output is correct
59 Correct 95 ms 13816 KB Output is correct
60 Correct 96 ms 13852 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12624 KB Output is correct
2 Correct 7 ms 12620 KB Output is correct
3 Correct 6 ms 12620 KB Output is correct
4 Correct 7 ms 12620 KB Output is correct
5 Correct 6 ms 12620 KB Output is correct
6 Correct 9 ms 12620 KB Output is correct
7 Correct 7 ms 12600 KB Output is correct
8 Correct 6 ms 12620 KB Output is correct
9 Correct 6 ms 12620 KB Output is correct
10 Correct 7 ms 12652 KB Output is correct
11 Correct 6 ms 12620 KB Output is correct
12 Correct 6 ms 12620 KB Output is correct
13 Correct 9 ms 12736 KB Output is correct
14 Correct 34 ms 12980 KB Output is correct
15 Correct 62 ms 13420 KB Output is correct
16 Correct 94 ms 13960 KB Output is correct
17 Correct 101 ms 13848 KB Output is correct
18 Correct 93 ms 13844 KB Output is correct
19 Correct 85 ms 13772 KB Output is correct
20 Correct 88 ms 13800 KB Output is correct
21 Correct 90 ms 13932 KB Output is correct
22 Correct 94 ms 13764 KB Output is correct
23 Correct 106 ms 13848 KB Output is correct
24 Correct 84 ms 13904 KB Output is correct
25 Correct 85 ms 13832 KB Output is correct
26 Correct 6 ms 12620 KB Output is correct
27 Correct 7 ms 12620 KB Output is correct
28 Correct 9 ms 12748 KB Output is correct
29 Correct 33 ms 13048 KB Output is correct
30 Correct 61 ms 13456 KB Output is correct
31 Correct 88 ms 13764 KB Output is correct
32 Correct 103 ms 13840 KB Output is correct
33 Correct 113 ms 13848 KB Output is correct
34 Correct 87 ms 13892 KB Output is correct
35 Correct 86 ms 13848 KB Output is correct
36 Correct 89 ms 13840 KB Output is correct
37 Correct 88 ms 13764 KB Output is correct
38 Correct 89 ms 13756 KB Output is correct
39 Correct 111 ms 13852 KB Output is correct
40 Correct 99 ms 13804 KB Output is correct
41 Correct 6 ms 12620 KB Output is correct
42 Correct 7 ms 12620 KB Output is correct
43 Correct 7 ms 12708 KB Output is correct
44 Correct 9 ms 12736 KB Output is correct
45 Correct 9 ms 12748 KB Output is correct
46 Correct 9 ms 12748 KB Output is correct
47 Correct 20 ms 12900 KB Output is correct
48 Correct 21 ms 12836 KB Output is correct
49 Correct 47 ms 13088 KB Output is correct
50 Correct 70 ms 13392 KB Output is correct
51 Correct 96 ms 13772 KB Output is correct
52 Correct 96 ms 13856 KB Output is correct
53 Correct 90 ms 13856 KB Output is correct
54 Correct 93 ms 13796 KB Output is correct
55 Correct 97 ms 13816 KB Output is correct
56 Correct 94 ms 13816 KB Output is correct
57 Correct 91 ms 13852 KB Output is correct
58 Correct 97 ms 13852 KB Output is correct
59 Correct 92 ms 13852 KB Output is correct
60 Correct 112 ms 13848 KB Output is correct
61 Correct 107 ms 13852 KB Output is correct
62 Correct 91 ms 13784 KB Output is correct
63 Correct 93 ms 13772 KB Output is correct
64 Correct 93 ms 13772 KB Output is correct
65 Correct 93 ms 13772 KB Output is correct
66 Correct 96 ms 13772 KB Output is correct
67 Correct 94 ms 13844 KB Output is correct
68 Correct 92 ms 13848 KB Output is correct
69 Correct 95 ms 13816 KB Output is correct
70 Correct 96 ms 13852 KB Output is correct
71 Correct 22 ms 12876 KB Output is correct
72 Correct 26 ms 12908 KB Output is correct
73 Correct 23 ms 12788 KB Output is correct
74 Correct 26 ms 12904 KB Output is correct
75 Correct 22 ms 12828 KB Output is correct
76 Correct 37 ms 13104 KB Output is correct
77 Correct 36 ms 13116 KB Output is correct
78 Correct 36 ms 13004 KB Output is correct
79 Correct 36 ms 13004 KB Output is correct
80 Correct 38 ms 13112 KB Output is correct
81 Correct 86 ms 13620 KB Output is correct
82 Correct 78 ms 13512 KB Output is correct
83 Correct 70 ms 13516 KB Output is correct
84 Correct 67 ms 13532 KB Output is correct
85 Correct 68 ms 13532 KB Output is correct
86 Correct 74 ms 13584 KB Output is correct
87 Correct 74 ms 13564 KB Output is correct
88 Correct 76 ms 13564 KB Output is correct
89 Correct 74 ms 13612 KB Output is correct
90 Correct 73 ms 13624 KB Output is correct
91 Correct 106 ms 14516 KB Output is correct
92 Correct 104 ms 14708 KB Output is correct
93 Correct 119 ms 14620 KB Output is correct
94 Correct 100 ms 14568 KB Output is correct
95 Correct 105 ms 14556 KB Output is correct
96 Correct 101 ms 15396 KB Output is correct
97 Correct 102 ms 15432 KB Output is correct
98 Correct 97 ms 15364 KB Output is correct
99 Correct 102 ms 15424 KB Output is correct
100 Correct 103 ms 15308 KB Output is correct
101 Correct 107 ms 15284 KB Output is correct
102 Correct 104 ms 15324 KB Output is correct
103 Correct 104 ms 15292 KB Output is correct
104 Correct 96 ms 15364 KB Output is correct
105 Correct 97 ms 15372 KB Output is correct
106 Correct 129 ms 15680 KB Output is correct
107 Correct 97 ms 15696 KB Output is correct
108 Correct 97 ms 15756 KB Output is correct
109 Correct 92 ms 15736 KB Output is correct
110 Correct 97 ms 15720 KB Output is correct
111 Correct 96 ms 15688 KB Output is correct
112 Correct 117 ms 15816 KB Output is correct
113 Correct 92 ms 15680 KB Output is correct
114 Correct 93 ms 15732 KB Output is correct
115 Correct 94 ms 15684 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12624 KB Output is correct
2 Correct 7 ms 12620 KB Output is correct
3 Correct 6 ms 12620 KB Output is correct
4 Correct 7 ms 12620 KB Output is correct
5 Correct 6 ms 12620 KB Output is correct
6 Correct 9 ms 12620 KB Output is correct
7 Correct 7 ms 12600 KB Output is correct
8 Correct 6 ms 12620 KB Output is correct
9 Correct 6 ms 12620 KB Output is correct
10 Correct 7 ms 12652 KB Output is correct
11 Correct 6 ms 12620 KB Output is correct
12 Correct 6 ms 12620 KB Output is correct
13 Correct 9 ms 12736 KB Output is correct
14 Correct 34 ms 12980 KB Output is correct
15 Correct 62 ms 13420 KB Output is correct
16 Correct 94 ms 13960 KB Output is correct
17 Correct 101 ms 13848 KB Output is correct
18 Correct 93 ms 13844 KB Output is correct
19 Correct 85 ms 13772 KB Output is correct
20 Correct 88 ms 13800 KB Output is correct
21 Correct 90 ms 13932 KB Output is correct
22 Correct 94 ms 13764 KB Output is correct
23 Correct 106 ms 13848 KB Output is correct
24 Correct 84 ms 13904 KB Output is correct
25 Correct 85 ms 13832 KB Output is correct
26 Correct 6 ms 12620 KB Output is correct
27 Correct 7 ms 12620 KB Output is correct
28 Correct 9 ms 12748 KB Output is correct
29 Correct 33 ms 13048 KB Output is correct
30 Correct 61 ms 13456 KB Output is correct
31 Correct 88 ms 13764 KB Output is correct
32 Correct 103 ms 13840 KB Output is correct
33 Correct 113 ms 13848 KB Output is correct
34 Correct 87 ms 13892 KB Output is correct
35 Correct 86 ms 13848 KB Output is correct
36 Correct 89 ms 13840 KB Output is correct
37 Correct 88 ms 13764 KB Output is correct
38 Correct 89 ms 13756 KB Output is correct
39 Correct 111 ms 13852 KB Output is correct
40 Correct 99 ms 13804 KB Output is correct
41 Correct 6 ms 12620 KB Output is correct
42 Correct 7 ms 12620 KB Output is correct
43 Correct 7 ms 12708 KB Output is correct
44 Correct 9 ms 12736 KB Output is correct
45 Correct 9 ms 12748 KB Output is correct
46 Correct 9 ms 12748 KB Output is correct
47 Correct 20 ms 12900 KB Output is correct
48 Correct 21 ms 12836 KB Output is correct
49 Correct 47 ms 13088 KB Output is correct
50 Correct 70 ms 13392 KB Output is correct
51 Correct 96 ms 13772 KB Output is correct
52 Correct 96 ms 13856 KB Output is correct
53 Correct 90 ms 13856 KB Output is correct
54 Correct 93 ms 13796 KB Output is correct
55 Correct 97 ms 13816 KB Output is correct
56 Correct 94 ms 13816 KB Output is correct
57 Correct 91 ms 13852 KB Output is correct
58 Correct 97 ms 13852 KB Output is correct
59 Correct 92 ms 13852 KB Output is correct
60 Correct 112 ms 13848 KB Output is correct
61 Correct 107 ms 13852 KB Output is correct
62 Correct 91 ms 13784 KB Output is correct
63 Correct 93 ms 13772 KB Output is correct
64 Correct 93 ms 13772 KB Output is correct
65 Correct 93 ms 13772 KB Output is correct
66 Correct 96 ms 13772 KB Output is correct
67 Correct 94 ms 13844 KB Output is correct
68 Correct 92 ms 13848 KB Output is correct
69 Correct 95 ms 13816 KB Output is correct
70 Correct 96 ms 13852 KB Output is correct
71 Correct 22 ms 12876 KB Output is correct
72 Correct 26 ms 12908 KB Output is correct
73 Correct 23 ms 12788 KB Output is correct
74 Correct 26 ms 12904 KB Output is correct
75 Correct 22 ms 12828 KB Output is correct
76 Correct 37 ms 13104 KB Output is correct
77 Correct 36 ms 13116 KB Output is correct
78 Correct 36 ms 13004 KB Output is correct
79 Correct 36 ms 13004 KB Output is correct
80 Correct 38 ms 13112 KB Output is correct
81 Correct 86 ms 13620 KB Output is correct
82 Correct 78 ms 13512 KB Output is correct
83 Correct 70 ms 13516 KB Output is correct
84 Correct 67 ms 13532 KB Output is correct
85 Correct 68 ms 13532 KB Output is correct
86 Correct 74 ms 13584 KB Output is correct
87 Correct 74 ms 13564 KB Output is correct
88 Correct 76 ms 13564 KB Output is correct
89 Correct 74 ms 13612 KB Output is correct
90 Correct 73 ms 13624 KB Output is correct
91 Correct 106 ms 14516 KB Output is correct
92 Correct 104 ms 14708 KB Output is correct
93 Correct 119 ms 14620 KB Output is correct
94 Correct 100 ms 14568 KB Output is correct
95 Correct 105 ms 14556 KB Output is correct
96 Correct 101 ms 15396 KB Output is correct
97 Correct 102 ms 15432 KB Output is correct
98 Correct 97 ms 15364 KB Output is correct
99 Correct 102 ms 15424 KB Output is correct
100 Correct 103 ms 15308 KB Output is correct
101 Correct 107 ms 15284 KB Output is correct
102 Correct 104 ms 15324 KB Output is correct
103 Correct 104 ms 15292 KB Output is correct
104 Correct 96 ms 15364 KB Output is correct
105 Correct 97 ms 15372 KB Output is correct
106 Correct 129 ms 15680 KB Output is correct
107 Correct 97 ms 15696 KB Output is correct
108 Correct 97 ms 15756 KB Output is correct
109 Correct 92 ms 15736 KB Output is correct
110 Correct 97 ms 15720 KB Output is correct
111 Correct 96 ms 15688 KB Output is correct
112 Correct 117 ms 15816 KB Output is correct
113 Correct 92 ms 15680 KB Output is correct
114 Correct 93 ms 15732 KB Output is correct
115 Correct 94 ms 15684 KB Output is correct
116 Correct 2985 ms 14476 KB Output is correct
117 Correct 2919 ms 14984 KB Output is correct
118 Correct 3632 ms 15472 KB Output is correct
119 Correct 3755 ms 15516 KB Output is correct
120 Correct 3799 ms 15520 KB Output is correct
121 Correct 6070 ms 15916 KB Output is correct
122 Correct 6550 ms 15984 KB Output is correct
123 Execution timed out 7088 ms 16152 KB Time limit exceeded
124 Halted 0 ms 0 KB -