oj.uz

답안 #526208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526208 2022-02-13T23:00:58 Z Plurm Diversity (CEOI21_diversity) C++11
64 / 100
 7000 ms 16892 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 = 1400;
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14672 KB Output is correct
2 Correct 9 ms 14668 KB Output is correct
3 Correct 8 ms 14668 KB Output is correct
4 Correct 8 ms 14668 KB Output is correct
5 Correct 8 ms 14668 KB Output is correct
6 Correct 8 ms 14668 KB Output is correct
7 Correct 9 ms 14712 KB Output is correct
8 Correct 8 ms 14668 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14668 KB Output is correct
2 Correct 8 ms 14688 KB Output is correct
3 Correct 12 ms 14636 KB Output is correct
4 Correct 45 ms 15104 KB Output is correct
5 Correct 88 ms 15476 KB Output is correct
6 Correct 116 ms 15820 KB Output is correct
7 Correct 128 ms 15820 KB Output is correct
8 Correct 121 ms 15812 KB Output is correct
9 Correct 117 ms 15800 KB Output is correct
10 Correct 116 ms 15864 KB Output is correct
11 Correct 114 ms 15860 KB Output is correct
12 Correct 115 ms 15812 KB Output is correct
13 Correct 118 ms 15852 KB Output is correct
14 Correct 130 ms 15852 KB Output is correct
15 Correct 119 ms 15856 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 14688 KB Output is correct
3 Correct 12 ms 14636 KB Output is correct
4 Correct 45 ms 15104 KB Output is correct
5 Correct 88 ms 15476 KB Output is correct
6 Correct 116 ms 15820 KB Output is correct
7 Correct 128 ms 15820 KB Output is correct
8 Correct 121 ms 15812 KB Output is correct
9 Correct 117 ms 15800 KB Output is correct
10 Correct 116 ms 15864 KB Output is correct
11 Correct 114 ms 15860 KB Output is correct
12 Correct 115 ms 15812 KB Output is correct
13 Correct 118 ms 15852 KB Output is correct
14 Correct 130 ms 15852 KB Output is correct
15 Correct 119 ms 15856 KB Output is correct
16 Correct 11 ms 14644 KB Output is correct
17 Correct 9 ms 14716 KB Output is correct
18 Correct 13 ms 14704 KB Output is correct
19 Correct 47 ms 15080 KB Output is correct
20 Correct 87 ms 15476 KB Output is correct
21 Correct 132 ms 15748 KB Output is correct
22 Correct 118 ms 15780 KB Output is correct
23 Correct 121 ms 15928 KB Output is correct
24 Correct 132 ms 15860 KB Output is correct
25 Correct 120 ms 15744 KB Output is correct
26 Correct 119 ms 15812 KB Output is correct
27 Correct 127 ms 15860 KB Output is correct
28 Correct 122 ms 15860 KB Output is correct
29 Correct 132 ms 15856 KB Output is correct
30 Correct 123 ms 15784 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 14688 KB Output is correct
3 Correct 12 ms 14636 KB Output is correct
4 Correct 45 ms 15104 KB Output is correct
5 Correct 88 ms 15476 KB Output is correct
6 Correct 116 ms 15820 KB Output is correct
7 Correct 128 ms 15820 KB Output is correct
8 Correct 121 ms 15812 KB Output is correct
9 Correct 117 ms 15800 KB Output is correct
10 Correct 116 ms 15864 KB Output is correct
11 Correct 114 ms 15860 KB Output is correct
12 Correct 115 ms 15812 KB Output is correct
13 Correct 118 ms 15852 KB Output is correct
14 Correct 130 ms 15852 KB Output is correct
15 Correct 119 ms 15856 KB Output is correct
16 Correct 11 ms 14644 KB Output is correct
17 Correct 9 ms 14716 KB Output is correct
18 Correct 13 ms 14704 KB Output is correct
19 Correct 47 ms 15080 KB Output is correct
20 Correct 87 ms 15476 KB Output is correct
21 Correct 132 ms 15748 KB Output is correct
22 Correct 118 ms 15780 KB Output is correct
23 Correct 121 ms 15928 KB Output is correct
24 Correct 132 ms 15860 KB Output is correct
25 Correct 120 ms 15744 KB Output is correct
26 Correct 119 ms 15812 KB Output is correct
27 Correct 127 ms 15860 KB Output is correct
28 Correct 122 ms 15860 KB Output is correct
29 Correct 132 ms 15856 KB Output is correct
30 Correct 123 ms 15784 KB Output is correct
31 Correct 10 ms 14668 KB Output is correct
32 Correct 9 ms 14716 KB Output is correct
33 Correct 9 ms 14668 KB Output is correct
34 Correct 19 ms 14708 KB Output is correct
35 Correct 11 ms 14668 KB Output is correct
36 Correct 13 ms 14668 KB Output is correct
37 Correct 27 ms 14796 KB Output is correct
38 Correct 28 ms 14908 KB Output is correct
39 Correct 47 ms 15100 KB Output is correct
40 Correct 84 ms 15468 KB Output is correct
41 Correct 121 ms 15836 KB Output is correct
42 Correct 123 ms 15860 KB Output is correct
43 Correct 135 ms 15860 KB Output is correct
44 Correct 139 ms 15864 KB Output is correct
45 Correct 121 ms 15820 KB Output is correct
46 Correct 130 ms 15860 KB Output is correct
47 Correct 126 ms 15796 KB Output is correct
48 Correct 121 ms 15856 KB Output is correct
49 Correct 127 ms 15852 KB Output is correct
50 Correct 128 ms 15856 KB Output is correct
51 Correct 124 ms 15848 KB Output is correct
52 Correct 132 ms 15808 KB Output is correct
53 Correct 125 ms 15812 KB Output is correct
54 Correct 124 ms 15812 KB Output is correct
55 Correct 126 ms 15812 KB Output is correct
56 Correct 128 ms 15856 KB Output is correct
57 Correct 148 ms 15820 KB Output is correct
58 Correct 129 ms 15868 KB Output is correct
59 Correct 126 ms 15856 KB Output is correct
60 Correct 125 ms 15820 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14672 KB Output is correct
2 Correct 9 ms 14668 KB Output is correct
3 Correct 8 ms 14668 KB Output is correct
4 Correct 8 ms 14668 KB Output is correct
5 Correct 8 ms 14668 KB Output is correct
6 Correct 8 ms 14668 KB Output is correct
7 Correct 9 ms 14712 KB Output is correct
8 Correct 8 ms 14668 KB Output is correct
9 Correct 8 ms 14668 KB Output is correct
10 Correct 8 ms 14668 KB Output is correct
11 Correct 7 ms 14668 KB Output is correct
12 Correct 8 ms 14688 KB Output is correct
13 Correct 12 ms 14636 KB Output is correct
14 Correct 45 ms 15104 KB Output is correct
15 Correct 88 ms 15476 KB Output is correct
16 Correct 116 ms 15820 KB Output is correct
17 Correct 128 ms 15820 KB Output is correct
18 Correct 121 ms 15812 KB Output is correct
19 Correct 117 ms 15800 KB Output is correct
20 Correct 116 ms 15864 KB Output is correct
21 Correct 114 ms 15860 KB Output is correct
22 Correct 115 ms 15812 KB Output is correct
23 Correct 118 ms 15852 KB Output is correct
24 Correct 130 ms 15852 KB Output is correct
25 Correct 119 ms 15856 KB Output is correct
26 Correct 11 ms 14644 KB Output is correct
27 Correct 9 ms 14716 KB Output is correct
28 Correct 13 ms 14704 KB Output is correct
29 Correct 47 ms 15080 KB Output is correct
30 Correct 87 ms 15476 KB Output is correct
31 Correct 132 ms 15748 KB Output is correct
32 Correct 118 ms 15780 KB Output is correct
33 Correct 121 ms 15928 KB Output is correct
34 Correct 132 ms 15860 KB Output is correct
35 Correct 120 ms 15744 KB Output is correct
36 Correct 119 ms 15812 KB Output is correct
37 Correct 127 ms 15860 KB Output is correct
38 Correct 122 ms 15860 KB Output is correct
39 Correct 132 ms 15856 KB Output is correct
40 Correct 123 ms 15784 KB Output is correct
41 Correct 10 ms 14668 KB Output is correct
42 Correct 9 ms 14716 KB Output is correct
43 Correct 9 ms 14668 KB Output is correct
44 Correct 19 ms 14708 KB Output is correct
45 Correct 11 ms 14668 KB Output is correct
46 Correct 13 ms 14668 KB Output is correct
47 Correct 27 ms 14796 KB Output is correct
48 Correct 28 ms 14908 KB Output is correct
49 Correct 47 ms 15100 KB Output is correct
50 Correct 84 ms 15468 KB Output is correct
51 Correct 121 ms 15836 KB Output is correct
52 Correct 123 ms 15860 KB Output is correct
53 Correct 135 ms 15860 KB Output is correct
54 Correct 139 ms 15864 KB Output is correct
55 Correct 121 ms 15820 KB Output is correct
56 Correct 130 ms 15860 KB Output is correct
57 Correct 126 ms 15796 KB Output is correct
58 Correct 121 ms 15856 KB Output is correct
59 Correct 127 ms 15852 KB Output is correct
60 Correct 128 ms 15856 KB Output is correct
61 Correct 124 ms 15848 KB Output is correct
62 Correct 132 ms 15808 KB Output is correct
63 Correct 125 ms 15812 KB Output is correct
64 Correct 124 ms 15812 KB Output is correct
65 Correct 126 ms 15812 KB Output is correct
66 Correct 128 ms 15856 KB Output is correct
67 Correct 148 ms 15820 KB Output is correct
68 Correct 129 ms 15868 KB Output is correct
69 Correct 126 ms 15856 KB Output is correct
70 Correct 125 ms 15820 KB Output is correct
71 Correct 28 ms 14908 KB Output is correct
72 Correct 27 ms 14840 KB Output is correct
73 Correct 28 ms 14796 KB Output is correct
74 Correct 28 ms 14904 KB Output is correct
75 Correct 29 ms 14856 KB Output is correct
76 Correct 50 ms 15052 KB Output is correct
77 Correct 48 ms 15104 KB Output is correct
78 Correct 51 ms 15116 KB Output is correct
79 Correct 50 ms 15052 KB Output is correct
80 Correct 55 ms 15116 KB Output is correct
81 Correct 104 ms 15504 KB Output is correct
82 Correct 90 ms 15584 KB Output is correct
83 Correct 100 ms 15516 KB Output is correct
84 Correct 91 ms 15504 KB Output is correct
85 Correct 92 ms 15512 KB Output is correct
86 Correct 108 ms 15564 KB Output is correct
87 Correct 94 ms 15556 KB Output is correct
88 Correct 91 ms 15552 KB Output is correct
89 Correct 95 ms 15548 KB Output is correct
90 Correct 92 ms 15468 KB Output is correct
91 Correct 136 ms 16376 KB Output is correct
92 Correct 142 ms 16252 KB Output is correct
93 Correct 128 ms 16240 KB Output is correct
94 Correct 133 ms 16224 KB Output is correct
95 Correct 139 ms 16252 KB Output is correct
96 Correct 131 ms 16640 KB Output is correct
97 Correct 129 ms 16640 KB Output is correct
98 Correct 135 ms 16632 KB Output is correct
99 Correct 132 ms 16728 KB Output is correct
100 Correct 126 ms 16608 KB Output is correct
101 Correct 128 ms 16636 KB Output is correct
102 Correct 131 ms 16580 KB Output is correct
103 Correct 128 ms 16640 KB Output is correct
104 Correct 143 ms 16564 KB Output is correct
105 Correct 129 ms 16700 KB Output is correct
106 Correct 121 ms 16740 KB Output is correct
107 Correct 128 ms 16804 KB Output is correct
108 Correct 127 ms 16836 KB Output is correct
109 Correct 122 ms 16832 KB Output is correct
110 Correct 127 ms 16844 KB Output is correct
111 Correct 123 ms 16736 KB Output is correct
112 Correct 125 ms 16832 KB Output is correct
113 Correct 131 ms 16836 KB Output is correct
114 Correct 127 ms 16892 KB Output is correct
115 Correct 124 ms 16832 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14672 KB Output is correct
2 Correct 9 ms 14668 KB Output is correct
3 Correct 8 ms 14668 KB Output is correct
4 Correct 8 ms 14668 KB Output is correct
5 Correct 8 ms 14668 KB Output is correct
6 Correct 8 ms 14668 KB Output is correct
7 Correct 9 ms 14712 KB Output is correct
8 Correct 8 ms 14668 KB Output is correct
9 Correct 8 ms 14668 KB Output is correct
10 Correct 8 ms 14668 KB Output is correct
11 Correct 7 ms 14668 KB Output is correct
12 Correct 8 ms 14688 KB Output is correct
13 Correct 12 ms 14636 KB Output is correct
14 Correct 45 ms 15104 KB Output is correct
15 Correct 88 ms 15476 KB Output is correct
16 Correct 116 ms 15820 KB Output is correct
17 Correct 128 ms 15820 KB Output is correct
18 Correct 121 ms 15812 KB Output is correct
19 Correct 117 ms 15800 KB Output is correct
20 Correct 116 ms 15864 KB Output is correct
21 Correct 114 ms 15860 KB Output is correct
22 Correct 115 ms 15812 KB Output is correct
23 Correct 118 ms 15852 KB Output is correct
24 Correct 130 ms 15852 KB Output is correct
25 Correct 119 ms 15856 KB Output is correct
26 Correct 11 ms 14644 KB Output is correct
27 Correct 9 ms 14716 KB Output is correct
28 Correct 13 ms 14704 KB Output is correct
29 Correct 47 ms 15080 KB Output is correct
30 Correct 87 ms 15476 KB Output is correct
31 Correct 132 ms 15748 KB Output is correct
32 Correct 118 ms 15780 KB Output is correct
33 Correct 121 ms 15928 KB Output is correct
34 Correct 132 ms 15860 KB Output is correct
35 Correct 120 ms 15744 KB Output is correct
36 Correct 119 ms 15812 KB Output is correct
37 Correct 127 ms 15860 KB Output is correct
38 Correct 122 ms 15860 KB Output is correct
39 Correct 132 ms 15856 KB Output is correct
40 Correct 123 ms 15784 KB Output is correct
41 Correct 10 ms 14668 KB Output is correct
42 Correct 9 ms 14716 KB Output is correct
43 Correct 9 ms 14668 KB Output is correct
44 Correct 19 ms 14708 KB Output is correct
45 Correct 11 ms 14668 KB Output is correct
46 Correct 13 ms 14668 KB Output is correct
47 Correct 27 ms 14796 KB Output is correct
48 Correct 28 ms 14908 KB Output is correct
49 Correct 47 ms 15100 KB Output is correct
50 Correct 84 ms 15468 KB Output is correct
51 Correct 121 ms 15836 KB Output is correct
52 Correct 123 ms 15860 KB Output is correct
53 Correct 135 ms 15860 KB Output is correct
54 Correct 139 ms 15864 KB Output is correct
55 Correct 121 ms 15820 KB Output is correct
56 Correct 130 ms 15860 KB Output is correct
57 Correct 126 ms 15796 KB Output is correct
58 Correct 121 ms 15856 KB Output is correct
59 Correct 127 ms 15852 KB Output is correct
60 Correct 128 ms 15856 KB Output is correct
61 Correct 124 ms 15848 KB Output is correct
62 Correct 132 ms 15808 KB Output is correct
63 Correct 125 ms 15812 KB Output is correct
64 Correct 124 ms 15812 KB Output is correct
65 Correct 126 ms 15812 KB Output is correct
66 Correct 128 ms 15856 KB Output is correct
67 Correct 148 ms 15820 KB Output is correct
68 Correct 129 ms 15868 KB Output is correct
69 Correct 126 ms 15856 KB Output is correct
70 Correct 125 ms 15820 KB Output is correct
71 Correct 28 ms 14908 KB Output is correct
72 Correct 27 ms 14840 KB Output is correct
73 Correct 28 ms 14796 KB Output is correct
74 Correct 28 ms 14904 KB Output is correct
75 Correct 29 ms 14856 KB Output is correct
76 Correct 50 ms 15052 KB Output is correct
77 Correct 48 ms 15104 KB Output is correct
78 Correct 51 ms 15116 KB Output is correct
79 Correct 50 ms 15052 KB Output is correct
80 Correct 55 ms 15116 KB Output is correct
81 Correct 104 ms 15504 KB Output is correct
82 Correct 90 ms 15584 KB Output is correct
83 Correct 100 ms 15516 KB Output is correct
84 Correct 91 ms 15504 KB Output is correct
85 Correct 92 ms 15512 KB Output is correct
86 Correct 108 ms 15564 KB Output is correct
87 Correct 94 ms 15556 KB Output is correct
88 Correct 91 ms 15552 KB Output is correct
89 Correct 95 ms 15548 KB Output is correct
90 Correct 92 ms 15468 KB Output is correct
91 Correct 136 ms 16376 KB Output is correct
92 Correct 142 ms 16252 KB Output is correct
93 Correct 128 ms 16240 KB Output is correct
94 Correct 133 ms 16224 KB Output is correct
95 Correct 139 ms 16252 KB Output is correct
96 Correct 131 ms 16640 KB Output is correct
97 Correct 129 ms 16640 KB Output is correct
98 Correct 135 ms 16632 KB Output is correct
99 Correct 132 ms 16728 KB Output is correct
100 Correct 126 ms 16608 KB Output is correct
101 Correct 128 ms 16636 KB Output is correct
102 Correct 131 ms 16580 KB Output is correct
103 Correct 128 ms 16640 KB Output is correct
104 Correct 143 ms 16564 KB Output is correct
105 Correct 129 ms 16700 KB Output is correct
106 Correct 121 ms 16740 KB Output is correct
107 Correct 128 ms 16804 KB Output is correct
108 Correct 127 ms 16836 KB Output is correct
109 Correct 122 ms 16832 KB Output is correct
110 Correct 127 ms 16844 KB Output is correct
111 Correct 123 ms 16736 KB Output is correct
112 Correct 125 ms 16832 KB Output is correct
113 Correct 131 ms 16836 KB Output is correct
114 Correct 127 ms 16892 KB Output is correct
115 Correct 124 ms 16832 KB Output is correct
116 Execution timed out 7036 ms 16068 KB Time limit exceeded
117 Halted 0 ms 0 KB -