oj.uz

답안 #1090164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090164 2024-09-17T22:52:05 Z urd05 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 12572 KB 
# pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
# pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
using namespace std;
 
int n,q;
int arr[300005];
int cnt[300005];
const int sq=5000;
const int sz=524288;
typedef pair<long long,long long> P;
long long tree1[300005];
long long tree2[300005];
typedef pair<P,int> Pi;
const int MAX=300000;
 
P pl(P a,P b) {
    return P(a.first+b.first,a.second+b.second);
}
 
P mi(P a,P b) {
    return P(a.first-b.first,a.second-b.second);
}
 
inline long long sum1(int i) {
    long long ret=0;
    while (i>0) {
        ret+=tree1[i];
        i-=(i&-i);
    }
    return ret;
}
 
inline long long sum2(int i) {
    long long ret=0;
    while (i>0) {
        ret+=tree2[i];
        i-=(i&-i);
    }
    return ret;
}
 
inline P sum(int l,int r,int node=1,int nodel=0,int noder=sz-1) {
    return P(sum1(r+1)-sum1(l),sum2(r+1)-sum2(l));
}
 
inline void upd1(int i,int val) {
    while (i<=300004) {
        tree1[i]+=val;
        i+=(i&-i);
    }
}
 
inline void upd2(int i,int val) {
    while (i<=300004) {
        tree2[i]+=val;
        i+=(i&-i);
    }
}
 
inline void update(int i,P val) {
    upd1(i+1,val.first);
    upd2(i+1,val.second);
}
 
int pos[300005];
int tree[300005];
 
inline int sum(int i) {
    i++;
    int ret=0;
    while (i>0) {
        ret+=tree[i];
        i-=(i&-i);
    }
    return ret;
}
 
inline void upd(int i,int val) {
    i++;
    while (i<=300004) {
        tree[i]+=val;
        i+=(i&-i);
    }
}
 
bool comp(Pi a,Pi b) {
    if (a.first.first/sq==b.first.first/sq) {
        return a.first.second<b.first.second;
    }
    return a.first.first/sq<b.first.first/sq;
}
 
long long value=0;
 
void push(int ind) {
    int now=arr[ind];
    int p=sum(cnt[now])-1;
    p=pos[p];
    upd(cnt[now],-1);
    upd(cnt[now]+1,1);
    cnt[now]++;
    P got=sum(0,p-1);
    value+=p*got.second-got.first;
    got=sum(p+1,MAX-1);
    value+=got.first-p*got.second;
    update(p,P(p,1));
}
 
void out(int ind) {
    int now=arr[ind];
    int p=sum(cnt[now]-1);
    p=pos[p];
    upd(cnt[now],-1);
    upd(cnt[now]-1,1);
    cnt[now]--;
    P got=sum(0,p-1);
    value-=p*got.second-got.first;
    got=sum(p+1,MAX-1);
    value-=got.first-p*got.second;
    update(p,P(-p,-1));
}
 
long long ret[50005];
 
int main(void) {
    scanf("%d %d",&n,&q);
    for(int i=0;i<n;i++) {
        scanf("%d",&arr[i]);
    }
    vector<int> v;
    for(int i=1;i<=300000;i++) {
        v.push_back(i-1);
    }
    sort(v.begin(),v.end());
    vector<long long> v1;
    for(int i=0;i<v.size();i+=2) {
        v1.push_back(v[i]);
    }
    vector<long long> v2;
    for(int i=1;i<v.size();i+=2) {
        v2.push_back(v[i]);
    }
    reverse(v2.begin(),v2.end());
    for(auto x:v2) {
        v1.push_back(x);
    }
    for(int i=0;i<300000;i++) {
        pos[v1[i]]=i;
    }
    upd(0,300000);
    vector<Pi> query;
    for(int i=0;i<q;i++) {
        int l,r;
        scanf("%d %d",&l,&r);
        l--;
        r--;
        query.push_back(Pi(P(l,r),i));
    }
    sort(query.begin(),query.end(),comp);
    int l=query[0].first.first;
    int r=query[0].first.first-1;
    for(int i=0;i<q;i++) {
        int nl=query[i].first.first;
        int nr=query[i].first.second;
        while (l>nl) {
            l--;
            push(l);
        }
        while (r<nr) {
            r++;
            push(r);
        }
        while (l<nl) {
            out(l);
            l++;
        }
        while (r>nr) {
            out(r);
            r--;
        }
        int len=nr-nl+1;
        ret[query[i].second]=value+1LL*len*(len+1)/2;
    }
    for(int i=0;i<q;i++) {
        printf("%lld\n",ret[i]);
    }
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:139:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |     for(int i=0;i<v.size();i+=2) {
      |                 ~^~~~~~~~~
diversity.cpp:143:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |     for(int i=1;i<v.size();i+=2) {
      |                 ~^~~~~~~~~
diversity.cpp:129:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  129 |     scanf("%d %d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~~
diversity.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         scanf("%d",&arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~
diversity.cpp:157:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  157 |         scanf("%d %d",&l,&r);
      |         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6864 KB Output is correct
2 Correct 10 ms 6904 KB Output is correct
3 Correct 10 ms 6868 KB Output is correct
4 Correct 11 ms 6868 KB Output is correct
5 Correct 11 ms 6948 KB Output is correct
6 Correct 11 ms 6956 KB Output is correct
7 Correct 17 ms 6868 KB Output is correct
8 Correct 17 ms 6868 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 12 ms 6868 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 6896 KB Output is correct
2 Correct 17 ms 6868 KB Output is correct
3 Correct 13 ms 6868 KB Output is correct
4 Correct 27 ms 7380 KB Output is correct
5 Correct 79 ms 7668 KB Output is correct
6 Correct 58 ms 8144 KB Output is correct
7 Correct 56 ms 8208 KB Output is correct
8 Correct 62 ms 8056 KB Output is correct
9 Correct 60 ms 8148 KB Output is correct
10 Correct 73 ms 8136 KB Output is correct
11 Correct 57 ms 8036 KB Output is correct
12 Correct 92 ms 8132 KB Output is correct
13 Correct 56 ms 8148 KB Output is correct
14 Correct 58 ms 8148 KB Output is correct
15 Correct 57 ms 8148 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 6896 KB Output is correct
2 Correct 17 ms 6868 KB Output is correct
3 Correct 13 ms 6868 KB Output is correct
4 Correct 27 ms 7380 KB Output is correct
5 Correct 79 ms 7668 KB Output is correct
6 Correct 58 ms 8144 KB Output is correct
7 Correct 56 ms 8208 KB Output is correct
8 Correct 62 ms 8056 KB Output is correct
9 Correct 60 ms 8148 KB Output is correct
10 Correct 73 ms 8136 KB Output is correct
11 Correct 57 ms 8036 KB Output is correct
12 Correct 92 ms 8132 KB Output is correct
13 Correct 56 ms 8148 KB Output is correct
14 Correct 58 ms 8148 KB Output is correct
15 Correct 57 ms 8148 KB Output is correct
16 Correct 11 ms 6868 KB Output is correct
17 Correct 11 ms 6956 KB Output is correct
18 Correct 12 ms 6920 KB Output is correct
19 Correct 26 ms 7332 KB Output is correct
20 Correct 43 ms 7828 KB Output is correct
21 Correct 66 ms 8104 KB Output is correct
22 Correct 59 ms 8060 KB Output is correct
23 Correct 59 ms 8136 KB Output is correct
24 Correct 59 ms 8148 KB Output is correct
25 Correct 62 ms 8136 KB Output is correct
26 Correct 59 ms 8140 KB Output is correct
27 Correct 59 ms 8148 KB Output is correct
28 Correct 89 ms 8140 KB Output is correct
29 Correct 61 ms 8136 KB Output is correct
30 Correct 65 ms 8056 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 6896 KB Output is correct
2 Correct 17 ms 6868 KB Output is correct
3 Correct 13 ms 6868 KB Output is correct
4 Correct 27 ms 7380 KB Output is correct
5 Correct 79 ms 7668 KB Output is correct
6 Correct 58 ms 8144 KB Output is correct
7 Correct 56 ms 8208 KB Output is correct
8 Correct 62 ms 8056 KB Output is correct
9 Correct 60 ms 8148 KB Output is correct
10 Correct 73 ms 8136 KB Output is correct
11 Correct 57 ms 8036 KB Output is correct
12 Correct 92 ms 8132 KB Output is correct
13 Correct 56 ms 8148 KB Output is correct
14 Correct 58 ms 8148 KB Output is correct
15 Correct 57 ms 8148 KB Output is correct
16 Correct 11 ms 6868 KB Output is correct
17 Correct 11 ms 6956 KB Output is correct
18 Correct 12 ms 6920 KB Output is correct
19 Correct 26 ms 7332 KB Output is correct
20 Correct 43 ms 7828 KB Output is correct
21 Correct 66 ms 8104 KB Output is correct
22 Correct 59 ms 8060 KB Output is correct
23 Correct 59 ms 8136 KB Output is correct
24 Correct 59 ms 8148 KB Output is correct
25 Correct 62 ms 8136 KB Output is correct
26 Correct 59 ms 8140 KB Output is correct
27 Correct 59 ms 8148 KB Output is correct
28 Correct 89 ms 8140 KB Output is correct
29 Correct 61 ms 8136 KB Output is correct
30 Correct 65 ms 8056 KB Output is correct
31 Correct 11 ms 6864 KB Output is correct
32 Correct 11 ms 6868 KB Output is correct
33 Correct 11 ms 6868 KB Output is correct
34 Correct 12 ms 6864 KB Output is correct
35 Correct 13 ms 7012 KB Output is correct
36 Correct 14 ms 6868 KB Output is correct
37 Correct 19 ms 7092 KB Output is correct
38 Correct 19 ms 7160 KB Output is correct
39 Correct 27 ms 7380 KB Output is correct
40 Correct 44 ms 7612 KB Output is correct
41 Correct 64 ms 8020 KB Output is correct
42 Correct 59 ms 8144 KB Output is correct
43 Correct 59 ms 8140 KB Output is correct
44 Correct 59 ms 8188 KB Output is correct
45 Correct 58 ms 8144 KB Output is correct
46 Correct 59 ms 8144 KB Output is correct
47 Correct 58 ms 8148 KB Output is correct
48 Correct 59 ms 8140 KB Output is correct
49 Correct 59 ms 8148 KB Output is correct
50 Correct 59 ms 8044 KB Output is correct
51 Correct 60 ms 8148 KB Output is correct
52 Correct 59 ms 8136 KB Output is correct
53 Correct 59 ms 8052 KB Output is correct
54 Correct 63 ms 8148 KB Output is correct
55 Correct 60 ms 8140 KB Output is correct
56 Correct 59 ms 8148 KB Output is correct
57 Correct 59 ms 8148 KB Output is correct
58 Correct 59 ms 8144 KB Output is correct
59 Correct 58 ms 8056 KB Output is correct
60 Correct 59 ms 8148 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6864 KB Output is correct
2 Correct 10 ms 6904 KB Output is correct
3 Correct 10 ms 6868 KB Output is correct
4 Correct 11 ms 6868 KB Output is correct
5 Correct 11 ms 6948 KB Output is correct
6 Correct 11 ms 6956 KB Output is correct
7 Correct 17 ms 6868 KB Output is correct
8 Correct 17 ms 6868 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 12 ms 6868 KB Output is correct
11 Correct 11 ms 6896 KB Output is correct
12 Correct 17 ms 6868 KB Output is correct
13 Correct 13 ms 6868 KB Output is correct
14 Correct 27 ms 7380 KB Output is correct
15 Correct 79 ms 7668 KB Output is correct
16 Correct 58 ms 8144 KB Output is correct
17 Correct 56 ms 8208 KB Output is correct
18 Correct 62 ms 8056 KB Output is correct
19 Correct 60 ms 8148 KB Output is correct
20 Correct 73 ms 8136 KB Output is correct
21 Correct 57 ms 8036 KB Output is correct
22 Correct 92 ms 8132 KB Output is correct
23 Correct 56 ms 8148 KB Output is correct
24 Correct 58 ms 8148 KB Output is correct
25 Correct 57 ms 8148 KB Output is correct
26 Correct 11 ms 6868 KB Output is correct
27 Correct 11 ms 6956 KB Output is correct
28 Correct 12 ms 6920 KB Output is correct
29 Correct 26 ms 7332 KB Output is correct
30 Correct 43 ms 7828 KB Output is correct
31 Correct 66 ms 8104 KB Output is correct
32 Correct 59 ms 8060 KB Output is correct
33 Correct 59 ms 8136 KB Output is correct
34 Correct 59 ms 8148 KB Output is correct
35 Correct 62 ms 8136 KB Output is correct
36 Correct 59 ms 8140 KB Output is correct
37 Correct 59 ms 8148 KB Output is correct
38 Correct 89 ms 8140 KB Output is correct
39 Correct 61 ms 8136 KB Output is correct
40 Correct 65 ms 8056 KB Output is correct
41 Correct 11 ms 6864 KB Output is correct
42 Correct 11 ms 6868 KB Output is correct
43 Correct 11 ms 6868 KB Output is correct
44 Correct 12 ms 6864 KB Output is correct
45 Correct 13 ms 7012 KB Output is correct
46 Correct 14 ms 6868 KB Output is correct
47 Correct 19 ms 7092 KB Output is correct
48 Correct 19 ms 7160 KB Output is correct
49 Correct 27 ms 7380 KB Output is correct
50 Correct 44 ms 7612 KB Output is correct
51 Correct 64 ms 8020 KB Output is correct
52 Correct 59 ms 8144 KB Output is correct
53 Correct 59 ms 8140 KB Output is correct
54 Correct 59 ms 8188 KB Output is correct
55 Correct 58 ms 8144 KB Output is correct
56 Correct 59 ms 8144 KB Output is correct
57 Correct 58 ms 8148 KB Output is correct
58 Correct 59 ms 8140 KB Output is correct
59 Correct 59 ms 8148 KB Output is correct
60 Correct 59 ms 8044 KB Output is correct
61 Correct 60 ms 8148 KB Output is correct
62 Correct 59 ms 8136 KB Output is correct
63 Correct 59 ms 8052 KB Output is correct
64 Correct 63 ms 8148 KB Output is correct
65 Correct 60 ms 8140 KB Output is correct
66 Correct 59 ms 8148 KB Output is correct
67 Correct 59 ms 8148 KB Output is correct
68 Correct 59 ms 8144 KB Output is correct
69 Correct 58 ms 8056 KB Output is correct
70 Correct 59 ms 8148 KB Output is correct
71 Correct 20 ms 7124 KB Output is correct
72 Correct 19 ms 7124 KB Output is correct
73 Correct 20 ms 7124 KB Output is correct
74 Correct 19 ms 7124 KB Output is correct
75 Correct 20 ms 7124 KB Output is correct
76 Correct 34 ms 7380 KB Output is correct
77 Correct 30 ms 7380 KB Output is correct
78 Correct 29 ms 7376 KB Output is correct
79 Correct 29 ms 7380 KB Output is correct
80 Correct 29 ms 7380 KB Output is correct
81 Correct 47 ms 7704 KB Output is correct
82 Correct 46 ms 7632 KB Output is correct
83 Correct 54 ms 7636 KB Output is correct
84 Correct 48 ms 7636 KB Output is correct
85 Correct 47 ms 7628 KB Output is correct
86 Correct 48 ms 7628 KB Output is correct
87 Correct 48 ms 7628 KB Output is correct
88 Correct 51 ms 7624 KB Output is correct
89 Correct 49 ms 7636 KB Output is correct
90 Correct 57 ms 7712 KB Output is correct
91 Correct 68 ms 9644 KB Output is correct
92 Correct 75 ms 9668 KB Output is correct
93 Correct 71 ms 9660 KB Output is correct
94 Correct 70 ms 9520 KB Output is correct
95 Correct 69 ms 9652 KB Output is correct
96 Correct 79 ms 11536 KB Output is correct
97 Correct 73 ms 11452 KB Output is correct
98 Correct 69 ms 11452 KB Output is correct
99 Correct 71 ms 11452 KB Output is correct
100 Correct 78 ms 11468 KB Output is correct
101 Correct 73 ms 11448 KB Output is correct
102 Correct 72 ms 11452 KB Output is correct
103 Correct 71 ms 11400 KB Output is correct
104 Correct 72 ms 11452 KB Output is correct
105 Correct 71 ms 11448 KB Output is correct
106 Correct 72 ms 12496 KB Output is correct
107 Correct 71 ms 12472 KB Output is correct
108 Correct 74 ms 12572 KB Output is correct
109 Correct 77 ms 12380 KB Output is correct
110 Correct 71 ms 12360 KB Output is correct
111 Correct 76 ms 12472 KB Output is correct
112 Correct 72 ms 12412 KB Output is correct
113 Correct 71 ms 12476 KB Output is correct
114 Correct 77 ms 12472 KB Output is correct
115 Correct 74 ms 12472 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 6864 KB Output is correct
2 Correct 10 ms 6904 KB Output is correct
3 Correct 10 ms 6868 KB Output is correct
4 Correct 11 ms 6868 KB Output is correct
5 Correct 11 ms 6948 KB Output is correct
6 Correct 11 ms 6956 KB Output is correct
7 Correct 17 ms 6868 KB Output is correct
8 Correct 17 ms 6868 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 12 ms 6868 KB Output is correct
11 Correct 11 ms 6896 KB Output is correct
12 Correct 17 ms 6868 KB Output is correct
13 Correct 13 ms 6868 KB Output is correct
14 Correct 27 ms 7380 KB Output is correct
15 Correct 79 ms 7668 KB Output is correct
16 Correct 58 ms 8144 KB Output is correct
17 Correct 56 ms 8208 KB Output is correct
18 Correct 62 ms 8056 KB Output is correct
19 Correct 60 ms 8148 KB Output is correct
20 Correct 73 ms 8136 KB Output is correct
21 Correct 57 ms 8036 KB Output is correct
22 Correct 92 ms 8132 KB Output is correct
23 Correct 56 ms 8148 KB Output is correct
24 Correct 58 ms 8148 KB Output is correct
25 Correct 57 ms 8148 KB Output is correct
26 Correct 11 ms 6868 KB Output is correct
27 Correct 11 ms 6956 KB Output is correct
28 Correct 12 ms 6920 KB Output is correct
29 Correct 26 ms 7332 KB Output is correct
30 Correct 43 ms 7828 KB Output is correct
31 Correct 66 ms 8104 KB Output is correct
32 Correct 59 ms 8060 KB Output is correct
33 Correct 59 ms 8136 KB Output is correct
34 Correct 59 ms 8148 KB Output is correct
35 Correct 62 ms 8136 KB Output is correct
36 Correct 59 ms 8140 KB Output is correct
37 Correct 59 ms 8148 KB Output is correct
38 Correct 89 ms 8140 KB Output is correct
39 Correct 61 ms 8136 KB Output is correct
40 Correct 65 ms 8056 KB Output is correct
41 Correct 11 ms 6864 KB Output is correct
42 Correct 11 ms 6868 KB Output is correct
43 Correct 11 ms 6868 KB Output is correct
44 Correct 12 ms 6864 KB Output is correct
45 Correct 13 ms 7012 KB Output is correct
46 Correct 14 ms 6868 KB Output is correct
47 Correct 19 ms 7092 KB Output is correct
48 Correct 19 ms 7160 KB Output is correct
49 Correct 27 ms 7380 KB Output is correct
50 Correct 44 ms 7612 KB Output is correct
51 Correct 64 ms 8020 KB Output is correct
52 Correct 59 ms 8144 KB Output is correct
53 Correct 59 ms 8140 KB Output is correct
54 Correct 59 ms 8188 KB Output is correct
55 Correct 58 ms 8144 KB Output is correct
56 Correct 59 ms 8144 KB Output is correct
57 Correct 58 ms 8148 KB Output is correct
58 Correct 59 ms 8140 KB Output is correct
59 Correct 59 ms 8148 KB Output is correct
60 Correct 59 ms 8044 KB Output is correct
61 Correct 60 ms 8148 KB Output is correct
62 Correct 59 ms 8136 KB Output is correct
63 Correct 59 ms 8052 KB Output is correct
64 Correct 63 ms 8148 KB Output is correct
65 Correct 60 ms 8140 KB Output is correct
66 Correct 59 ms 8148 KB Output is correct
67 Correct 59 ms 8148 KB Output is correct
68 Correct 59 ms 8144 KB Output is correct
69 Correct 58 ms 8056 KB Output is correct
70 Correct 59 ms 8148 KB Output is correct
71 Correct 20 ms 7124 KB Output is correct
72 Correct 19 ms 7124 KB Output is correct
73 Correct 20 ms 7124 KB Output is correct
74 Correct 19 ms 7124 KB Output is correct
75 Correct 20 ms 7124 KB Output is correct
76 Correct 34 ms 7380 KB Output is correct
77 Correct 30 ms 7380 KB Output is correct
78 Correct 29 ms 7376 KB Output is correct
79 Correct 29 ms 7380 KB Output is correct
80 Correct 29 ms 7380 KB Output is correct
81 Correct 47 ms 7704 KB Output is correct
82 Correct 46 ms 7632 KB Output is correct
83 Correct 54 ms 7636 KB Output is correct
84 Correct 48 ms 7636 KB Output is correct
85 Correct 47 ms 7628 KB Output is correct
86 Correct 48 ms 7628 KB Output is correct
87 Correct 48 ms 7628 KB Output is correct
88 Correct 51 ms 7624 KB Output is correct
89 Correct 49 ms 7636 KB Output is correct
90 Correct 57 ms 7712 KB Output is correct
91 Correct 68 ms 9644 KB Output is correct
92 Correct 75 ms 9668 KB Output is correct
93 Correct 71 ms 9660 KB Output is correct
94 Correct 70 ms 9520 KB Output is correct
95 Correct 69 ms 9652 KB Output is correct
96 Correct 79 ms 11536 KB Output is correct
97 Correct 73 ms 11452 KB Output is correct
98 Correct 69 ms 11452 KB Output is correct
99 Correct 71 ms 11452 KB Output is correct
100 Correct 78 ms 11468 KB Output is correct
101 Correct 73 ms 11448 KB Output is correct
102 Correct 72 ms 11452 KB Output is correct
103 Correct 71 ms 11400 KB Output is correct
104 Correct 72 ms 11452 KB Output is correct
105 Correct 71 ms 11448 KB Output is correct
106 Correct 72 ms 12496 KB Output is correct
107 Correct 71 ms 12472 KB Output is correct
108 Correct 74 ms 12572 KB Output is correct
109 Correct 77 ms 12380 KB Output is correct
110 Correct 71 ms 12360 KB Output is correct
111 Correct 76 ms 12472 KB Output is correct
112 Correct 72 ms 12412 KB Output is correct
113 Correct 71 ms 12476 KB Output is correct
114 Correct 77 ms 12472 KB Output is correct
115 Correct 74 ms 12472 KB Output is correct
116 Execution timed out 7060 ms 9668 KB Time limit exceeded
117 Halted 0 ms 0 KB -