oj.uz

Submission #526286

# Submission time Handle Problem Language Result Execution time Memory
526286 2022-02-14T07:50:34 Z Plurm Diversity (CEOI21_diversity) C++11
64 / 100
 7000 ms 18840 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 = 3000;
  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++){
    lptr = 1;
    rptr = 0;
    ans = 0ll;
    memset(FT1.FT, 0, 4*FT1.n);
    memset(FT2.FT, 0, 4*FT2.n);
    memset(dq.FT, 0, 4*dq.n);
    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

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14668 KB Output is correct
2 Correct 8 ms 14668 KB Output is correct
3 Correct 8 ms 14708 KB Output is correct
4 Correct 8 ms 14700 KB Output is correct
5 Correct 8 ms 14708 KB Output is correct
6 Correct 8 ms 14692 KB Output is correct
7 Correct 10 ms 14668 KB Output is correct
8 Correct 9 ms 14704 KB Output is correct
9 Correct 8 ms 14668 KB Output is correct
10 Correct 8 ms 14668 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14668 KB Output is correct
2 Correct 9 ms 14600 KB Output is correct
3 Correct 12 ms 14772 KB Output is correct
4 Correct 41 ms 15276 KB Output is correct
5 Correct 72 ms 15864 KB Output is correct
6 Correct 106 ms 16524 KB Output is correct
7 Correct 109 ms 16452 KB Output is correct
8 Correct 107 ms 16580 KB Output is correct
9 Correct 102 ms 16496 KB Output is correct
10 Correct 107 ms 16512 KB Output is correct
11 Correct 108 ms 16500 KB Output is correct
12 Correct 146 ms 16520 KB Output is correct
13 Correct 102 ms 16488 KB Output is correct
14 Correct 102 ms 16424 KB Output is correct
15 Correct 102 ms 16496 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14668 KB Output is correct
2 Correct 9 ms 14600 KB Output is correct
3 Correct 12 ms 14772 KB Output is correct
4 Correct 41 ms 15276 KB Output is correct
5 Correct 72 ms 15864 KB Output is correct
6 Correct 106 ms 16524 KB Output is correct
7 Correct 109 ms 16452 KB Output is correct
8 Correct 107 ms 16580 KB Output is correct
9 Correct 102 ms 16496 KB Output is correct
10 Correct 107 ms 16512 KB Output is correct
11 Correct 108 ms 16500 KB Output is correct
12 Correct 146 ms 16520 KB Output is correct
13 Correct 102 ms 16488 KB Output is correct
14 Correct 102 ms 16424 KB Output is correct
15 Correct 102 ms 16496 KB Output is correct
16 Correct 9 ms 14668 KB Output is correct
17 Correct 9 ms 14668 KB Output is correct
18 Correct 14 ms 14668 KB Output is correct
19 Correct 41 ms 15428 KB Output is correct
20 Correct 74 ms 15976 KB Output is correct
21 Correct 106 ms 16788 KB Output is correct
22 Correct 123 ms 16584 KB Output is correct
23 Correct 108 ms 16648 KB Output is correct
24 Correct 111 ms 16580 KB Output is correct
25 Correct 105 ms 16624 KB Output is correct
26 Correct 106 ms 16628 KB Output is correct
27 Correct 141 ms 16752 KB Output is correct
28 Correct 109 ms 16580 KB Output is correct
29 Correct 111 ms 16600 KB Output is correct
30 Correct 116 ms 16656 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14668 KB Output is correct
2 Correct 9 ms 14600 KB Output is correct
3 Correct 12 ms 14772 KB Output is correct
4 Correct 41 ms 15276 KB Output is correct
5 Correct 72 ms 15864 KB Output is correct
6 Correct 106 ms 16524 KB Output is correct
7 Correct 109 ms 16452 KB Output is correct
8 Correct 107 ms 16580 KB Output is correct
9 Correct 102 ms 16496 KB Output is correct
10 Correct 107 ms 16512 KB Output is correct
11 Correct 108 ms 16500 KB Output is correct
12 Correct 146 ms 16520 KB Output is correct
13 Correct 102 ms 16488 KB Output is correct
14 Correct 102 ms 16424 KB Output is correct
15 Correct 102 ms 16496 KB Output is correct
16 Correct 9 ms 14668 KB Output is correct
17 Correct 9 ms 14668 KB Output is correct
18 Correct 14 ms 14668 KB Output is correct
19 Correct 41 ms 15428 KB Output is correct
20 Correct 74 ms 15976 KB Output is correct
21 Correct 106 ms 16788 KB Output is correct
22 Correct 123 ms 16584 KB Output is correct
23 Correct 108 ms 16648 KB Output is correct
24 Correct 111 ms 16580 KB Output is correct
25 Correct 105 ms 16624 KB Output is correct
26 Correct 106 ms 16628 KB Output is correct
27 Correct 141 ms 16752 KB Output is correct
28 Correct 109 ms 16580 KB Output is correct
29 Correct 111 ms 16600 KB Output is correct
30 Correct 116 ms 16656 KB Output is correct
31 Correct 8 ms 14700 KB Output is correct
32 Correct 9 ms 14668 KB Output is correct
33 Correct 9 ms 14668 KB Output is correct
34 Correct 12 ms 14668 KB Output is correct
35 Correct 12 ms 14796 KB Output is correct
36 Correct 12 ms 14736 KB Output is correct
37 Correct 34 ms 15064 KB Output is correct
38 Correct 32 ms 15052 KB Output is correct
39 Correct 45 ms 15436 KB Output is correct
40 Correct 82 ms 16200 KB Output is correct
41 Correct 126 ms 17004 KB Output is correct
42 Correct 115 ms 16964 KB Output is correct
43 Correct 151 ms 16992 KB Output is correct
44 Correct 108 ms 17000 KB Output is correct
45 Correct 109 ms 16972 KB Output is correct
46 Correct 110 ms 17016 KB Output is correct
47 Correct 146 ms 16968 KB Output is correct
48 Correct 118 ms 17000 KB Output is correct
49 Correct 118 ms 16996 KB Output is correct
50 Correct 113 ms 16996 KB Output is correct
51 Correct 116 ms 17008 KB Output is correct
52 Correct 132 ms 16996 KB Output is correct
53 Correct 111 ms 16884 KB Output is correct
54 Correct 109 ms 17004 KB Output is correct
55 Correct 111 ms 16888 KB Output is correct
56 Correct 113 ms 17000 KB Output is correct
57 Correct 116 ms 16964 KB Output is correct
58 Correct 112 ms 17012 KB Output is correct
59 Correct 118 ms 17016 KB Output is correct
60 Correct 116 ms 17000 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14668 KB Output is correct
2 Correct 8 ms 14668 KB Output is correct
3 Correct 8 ms 14708 KB Output is correct
4 Correct 8 ms 14700 KB Output is correct
5 Correct 8 ms 14708 KB Output is correct
6 Correct 8 ms 14692 KB Output is correct
7 Correct 10 ms 14668 KB Output is correct
8 Correct 9 ms 14704 KB Output is correct
9 Correct 8 ms 14668 KB Output is correct
10 Correct 8 ms 14668 KB Output is correct
11 Correct 9 ms 14668 KB Output is correct
12 Correct 9 ms 14600 KB Output is correct
13 Correct 12 ms 14772 KB Output is correct
14 Correct 41 ms 15276 KB Output is correct
15 Correct 72 ms 15864 KB Output is correct
16 Correct 106 ms 16524 KB Output is correct
17 Correct 109 ms 16452 KB Output is correct
18 Correct 107 ms 16580 KB Output is correct
19 Correct 102 ms 16496 KB Output is correct
20 Correct 107 ms 16512 KB Output is correct
21 Correct 108 ms 16500 KB Output is correct
22 Correct 146 ms 16520 KB Output is correct
23 Correct 102 ms 16488 KB Output is correct
24 Correct 102 ms 16424 KB Output is correct
25 Correct 102 ms 16496 KB Output is correct
26 Correct 9 ms 14668 KB Output is correct
27 Correct 9 ms 14668 KB Output is correct
28 Correct 14 ms 14668 KB Output is correct
29 Correct 41 ms 15428 KB Output is correct
30 Correct 74 ms 15976 KB Output is correct
31 Correct 106 ms 16788 KB Output is correct
32 Correct 123 ms 16584 KB Output is correct
33 Correct 108 ms 16648 KB Output is correct
34 Correct 111 ms 16580 KB Output is correct
35 Correct 105 ms 16624 KB Output is correct
36 Correct 106 ms 16628 KB Output is correct
37 Correct 141 ms 16752 KB Output is correct
38 Correct 109 ms 16580 KB Output is correct
39 Correct 111 ms 16600 KB Output is correct
40 Correct 116 ms 16656 KB Output is correct
41 Correct 8 ms 14700 KB Output is correct
42 Correct 9 ms 14668 KB Output is correct
43 Correct 9 ms 14668 KB Output is correct
44 Correct 12 ms 14668 KB Output is correct
45 Correct 12 ms 14796 KB Output is correct
46 Correct 12 ms 14736 KB Output is correct
47 Correct 34 ms 15064 KB Output is correct
48 Correct 32 ms 15052 KB Output is correct
49 Correct 45 ms 15436 KB Output is correct
50 Correct 82 ms 16200 KB Output is correct
51 Correct 126 ms 17004 KB Output is correct
52 Correct 115 ms 16964 KB Output is correct
53 Correct 151 ms 16992 KB Output is correct
54 Correct 108 ms 17000 KB Output is correct
55 Correct 109 ms 16972 KB Output is correct
56 Correct 110 ms 17016 KB Output is correct
57 Correct 146 ms 16968 KB Output is correct
58 Correct 118 ms 17000 KB Output is correct
59 Correct 118 ms 16996 KB Output is correct
60 Correct 113 ms 16996 KB Output is correct
61 Correct 116 ms 17008 KB Output is correct
62 Correct 132 ms 16996 KB Output is correct
63 Correct 111 ms 16884 KB Output is correct
64 Correct 109 ms 17004 KB Output is correct
65 Correct 111 ms 16888 KB Output is correct
66 Correct 113 ms 17000 KB Output is correct
67 Correct 116 ms 16964 KB Output is correct
68 Correct 112 ms 17012 KB Output is correct
69 Correct 118 ms 17016 KB Output is correct
70 Correct 116 ms 17000 KB Output is correct
71 Correct 26 ms 15128 KB Output is correct
72 Correct 28 ms 15100 KB Output is correct
73 Correct 28 ms 15008 KB Output is correct
74 Correct 26 ms 15052 KB Output is correct
75 Correct 26 ms 15112 KB Output is correct
76 Correct 56 ms 15480 KB Output is correct
77 Correct 70 ms 15520 KB Output is correct
78 Correct 44 ms 15556 KB Output is correct
79 Correct 43 ms 15564 KB Output is correct
80 Correct 44 ms 15540 KB Output is correct
81 Correct 84 ms 16500 KB Output is correct
82 Correct 85 ms 16392 KB Output is correct
83 Correct 80 ms 16420 KB Output is correct
84 Correct 79 ms 16452 KB Output is correct
85 Correct 79 ms 16584 KB Output is correct
86 Correct 81 ms 16596 KB Output is correct
87 Correct 81 ms 16608 KB Output is correct
88 Correct 84 ms 16580 KB Output is correct
89 Correct 87 ms 16608 KB Output is correct
90 Correct 88 ms 16620 KB Output is correct
91 Correct 118 ms 17872 KB Output is correct
92 Correct 120 ms 17976 KB Output is correct
93 Correct 121 ms 17972 KB Output is correct
94 Correct 116 ms 17972 KB Output is correct
95 Correct 119 ms 17952 KB Output is correct
96 Correct 116 ms 18440 KB Output is correct
97 Correct 123 ms 18560 KB Output is correct
98 Correct 118 ms 18520 KB Output is correct
99 Correct 114 ms 18524 KB Output is correct
100 Correct 116 ms 18596 KB Output is correct
101 Correct 151 ms 18524 KB Output is correct
102 Correct 117 ms 18592 KB Output is correct
103 Correct 118 ms 18528 KB Output is correct
104 Correct 117 ms 18636 KB Output is correct
105 Correct 118 ms 18536 KB Output is correct
106 Correct 138 ms 18752 KB Output is correct
107 Correct 124 ms 18684 KB Output is correct
108 Correct 109 ms 18764 KB Output is correct
109 Correct 126 ms 18760 KB Output is correct
110 Correct 138 ms 18712 KB Output is correct
111 Correct 121 ms 18680 KB Output is correct
112 Correct 114 ms 18756 KB Output is correct
113 Correct 112 ms 18840 KB Output is correct
114 Correct 110 ms 18664 KB Output is correct
115 Correct 151 ms 18712 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14668 KB Output is correct
2 Correct 8 ms 14668 KB Output is correct
3 Correct 8 ms 14708 KB Output is correct
4 Correct 8 ms 14700 KB Output is correct
5 Correct 8 ms 14708 KB Output is correct
6 Correct 8 ms 14692 KB Output is correct
7 Correct 10 ms 14668 KB Output is correct
8 Correct 9 ms 14704 KB Output is correct
9 Correct 8 ms 14668 KB Output is correct
10 Correct 8 ms 14668 KB Output is correct
11 Correct 9 ms 14668 KB Output is correct
12 Correct 9 ms 14600 KB Output is correct
13 Correct 12 ms 14772 KB Output is correct
14 Correct 41 ms 15276 KB Output is correct
15 Correct 72 ms 15864 KB Output is correct
16 Correct 106 ms 16524 KB Output is correct
17 Correct 109 ms 16452 KB Output is correct
18 Correct 107 ms 16580 KB Output is correct
19 Correct 102 ms 16496 KB Output is correct
20 Correct 107 ms 16512 KB Output is correct
21 Correct 108 ms 16500 KB Output is correct
22 Correct 146 ms 16520 KB Output is correct
23 Correct 102 ms 16488 KB Output is correct
24 Correct 102 ms 16424 KB Output is correct
25 Correct 102 ms 16496 KB Output is correct
26 Correct 9 ms 14668 KB Output is correct
27 Correct 9 ms 14668 KB Output is correct
28 Correct 14 ms 14668 KB Output is correct
29 Correct 41 ms 15428 KB Output is correct
30 Correct 74 ms 15976 KB Output is correct
31 Correct 106 ms 16788 KB Output is correct
32 Correct 123 ms 16584 KB Output is correct
33 Correct 108 ms 16648 KB Output is correct
34 Correct 111 ms 16580 KB Output is correct
35 Correct 105 ms 16624 KB Output is correct
36 Correct 106 ms 16628 KB Output is correct
37 Correct 141 ms 16752 KB Output is correct
38 Correct 109 ms 16580 KB Output is correct
39 Correct 111 ms 16600 KB Output is correct
40 Correct 116 ms 16656 KB Output is correct
41 Correct 8 ms 14700 KB Output is correct
42 Correct 9 ms 14668 KB Output is correct
43 Correct 9 ms 14668 KB Output is correct
44 Correct 12 ms 14668 KB Output is correct
45 Correct 12 ms 14796 KB Output is correct
46 Correct 12 ms 14736 KB Output is correct
47 Correct 34 ms 15064 KB Output is correct
48 Correct 32 ms 15052 KB Output is correct
49 Correct 45 ms 15436 KB Output is correct
50 Correct 82 ms 16200 KB Output is correct
51 Correct 126 ms 17004 KB Output is correct
52 Correct 115 ms 16964 KB Output is correct
53 Correct 151 ms 16992 KB Output is correct
54 Correct 108 ms 17000 KB Output is correct
55 Correct 109 ms 16972 KB Output is correct
56 Correct 110 ms 17016 KB Output is correct
57 Correct 146 ms 16968 KB Output is correct
58 Correct 118 ms 17000 KB Output is correct
59 Correct 118 ms 16996 KB Output is correct
60 Correct 113 ms 16996 KB Output is correct
61 Correct 116 ms 17008 KB Output is correct
62 Correct 132 ms 16996 KB Output is correct
63 Correct 111 ms 16884 KB Output is correct
64 Correct 109 ms 17004 KB Output is correct
65 Correct 111 ms 16888 KB Output is correct
66 Correct 113 ms 17000 KB Output is correct
67 Correct 116 ms 16964 KB Output is correct
68 Correct 112 ms 17012 KB Output is correct
69 Correct 118 ms 17016 KB Output is correct
70 Correct 116 ms 17000 KB Output is correct
71 Correct 26 ms 15128 KB Output is correct
72 Correct 28 ms 15100 KB Output is correct
73 Correct 28 ms 15008 KB Output is correct
74 Correct 26 ms 15052 KB Output is correct
75 Correct 26 ms 15112 KB Output is correct
76 Correct 56 ms 15480 KB Output is correct
77 Correct 70 ms 15520 KB Output is correct
78 Correct 44 ms 15556 KB Output is correct
79 Correct 43 ms 15564 KB Output is correct
80 Correct 44 ms 15540 KB Output is correct
81 Correct 84 ms 16500 KB Output is correct
82 Correct 85 ms 16392 KB Output is correct
83 Correct 80 ms 16420 KB Output is correct
84 Correct 79 ms 16452 KB Output is correct
85 Correct 79 ms 16584 KB Output is correct
86 Correct 81 ms 16596 KB Output is correct
87 Correct 81 ms 16608 KB Output is correct
88 Correct 84 ms 16580 KB Output is correct
89 Correct 87 ms 16608 KB Output is correct
90 Correct 88 ms 16620 KB Output is correct
91 Correct 118 ms 17872 KB Output is correct
92 Correct 120 ms 17976 KB Output is correct
93 Correct 121 ms 17972 KB Output is correct
94 Correct 116 ms 17972 KB Output is correct
95 Correct 119 ms 17952 KB Output is correct
96 Correct 116 ms 18440 KB Output is correct
97 Correct 123 ms 18560 KB Output is correct
98 Correct 118 ms 18520 KB Output is correct
99 Correct 114 ms 18524 KB Output is correct
100 Correct 116 ms 18596 KB Output is correct
101 Correct 151 ms 18524 KB Output is correct
102 Correct 117 ms 18592 KB Output is correct
103 Correct 118 ms 18528 KB Output is correct
104 Correct 117 ms 18636 KB Output is correct
105 Correct 118 ms 18536 KB Output is correct
106 Correct 138 ms 18752 KB Output is correct
107 Correct 124 ms 18684 KB Output is correct
108 Correct 109 ms 18764 KB Output is correct
109 Correct 126 ms 18760 KB Output is correct
110 Correct 138 ms 18712 KB Output is correct
111 Correct 121 ms 18680 KB Output is correct
112 Correct 114 ms 18756 KB Output is correct
113 Correct 112 ms 18840 KB Output is correct
114 Correct 110 ms 18664 KB Output is correct
115 Correct 151 ms 18712 KB Output is correct
116 Execution timed out 7020 ms 16608 KB Time limit exceeded
117 Halted 0 ms 0 KB -