oj.uz

답안 #1090173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090173 2024-09-17T23:07:25 Z urd05 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 13764 KB 
# pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

int n,q;
int arr[300005];
int cnt[300005];
const int sq=500;
typedef pair<long long,long long> P;
long long tree1[300005];
long long tree2[300005];
typedef pair<P,int> Pi;
const int MAX=300000;
long long h1,h2;

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;
    i++;
    while (i>0) {
        ret+=tree1[i];
        i-=(i&-i);
    }
    return ret;
}

inline long long sum2(int i) {
    long long ret=0;
    i++;
    while (i>0) {
        ret+=tree2[i];
        i-=(i&-i);
    }
    return ret;
}

inline P sum3(int i) {
    i++;
    P ret=P(0,0);
    while (i>0) {
        ret.first+=tree1[i];
        ret.second+=tree2[i];
        i-=(i&-i);
    }
    return ret;
}

inline void update(int i,P val) {
    i++;
    h1+=val.first;
    h2+=val.second;
    while (i<=300004) {
        tree1[i]+=val.first;
        tree2[i]+=val.second;
        i+=(i&-i);
    }
}

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;

inline 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=sum3(p);
    long long one=got.first;
    long long two=got.second;
    value+=p*got.second-got.first;
    got=P(h1-one,h2-two);
    value+=got.first-p*got.second;
    update(p,P(p,1));
}

inline 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=sum3(p);
    long long one=got.first;
    long long two=got.second;
    value-=p*got.second-got.first;
    got=P(h1-one,h2-two);
    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--;
        ret[i]=1LL*(r-l+1)*(r-l+2)/2;
        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--;
        }
        ret[query[i].second]+=value;
    }
    for(int i=0;i<q;i++) {
        printf("%lld\n",ret[i]);
    }
}

Compilation message

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

Subtask #1
4.0 / 4.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6900 KB Output is correct
2 Correct 11 ms 6972 KB Output is correct
3 Correct 12 ms 6880 KB Output is correct
4 Correct 25 ms 7480 KB Output is correct
5 Correct 34 ms 8148 KB Output is correct
6 Correct 47 ms 8680 KB Output is correct
7 Correct 59 ms 8724 KB Output is correct
8 Correct 51 ms 8816 KB Output is correct
9 Correct 45 ms 8804 KB Output is correct
10 Correct 45 ms 8904 KB Output is correct
11 Correct 49 ms 8652 KB Output is correct
12 Correct 47 ms 8652 KB Output is correct
13 Correct 48 ms 8652 KB Output is correct
14 Correct 49 ms 8660 KB Output is correct
15 Correct 50 ms 8788 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6900 KB Output is correct
2 Correct 11 ms 6972 KB Output is correct
3 Correct 12 ms 6880 KB Output is correct
4 Correct 25 ms 7480 KB Output is correct
5 Correct 34 ms 8148 KB Output is correct
6 Correct 47 ms 8680 KB Output is correct
7 Correct 59 ms 8724 KB Output is correct
8 Correct 51 ms 8816 KB Output is correct
9 Correct 45 ms 8804 KB Output is correct
10 Correct 45 ms 8904 KB Output is correct
11 Correct 49 ms 8652 KB Output is correct
12 Correct 47 ms 8652 KB Output is correct
13 Correct 48 ms 8652 KB Output is correct
14 Correct 49 ms 8660 KB Output is correct
15 Correct 50 ms 8788 KB Output is correct
16 Correct 10 ms 6864 KB Output is correct
17 Correct 11 ms 6868 KB Output is correct
18 Correct 15 ms 6880 KB Output is correct
19 Correct 23 ms 7636 KB Output is correct
20 Correct 39 ms 8140 KB Output is correct
21 Correct 81 ms 8692 KB Output is correct
22 Correct 51 ms 8700 KB Output is correct
23 Correct 47 ms 8604 KB Output is correct
24 Correct 49 ms 8652 KB Output is correct
25 Correct 47 ms 8648 KB Output is correct
26 Correct 47 ms 8904 KB Output is correct
27 Correct 49 ms 8656 KB Output is correct
28 Correct 48 ms 8788 KB Output is correct
29 Correct 47 ms 8900 KB Output is correct
30 Correct 48 ms 8648 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6900 KB Output is correct
2 Correct 11 ms 6972 KB Output is correct
3 Correct 12 ms 6880 KB Output is correct
4 Correct 25 ms 7480 KB Output is correct
5 Correct 34 ms 8148 KB Output is correct
6 Correct 47 ms 8680 KB Output is correct
7 Correct 59 ms 8724 KB Output is correct
8 Correct 51 ms 8816 KB Output is correct
9 Correct 45 ms 8804 KB Output is correct
10 Correct 45 ms 8904 KB Output is correct
11 Correct 49 ms 8652 KB Output is correct
12 Correct 47 ms 8652 KB Output is correct
13 Correct 48 ms 8652 KB Output is correct
14 Correct 49 ms 8660 KB Output is correct
15 Correct 50 ms 8788 KB Output is correct
16 Correct 10 ms 6864 KB Output is correct
17 Correct 11 ms 6868 KB Output is correct
18 Correct 15 ms 6880 KB Output is correct
19 Correct 23 ms 7636 KB Output is correct
20 Correct 39 ms 8140 KB Output is correct
21 Correct 81 ms 8692 KB Output is correct
22 Correct 51 ms 8700 KB Output is correct
23 Correct 47 ms 8604 KB Output is correct
24 Correct 49 ms 8652 KB Output is correct
25 Correct 47 ms 8648 KB Output is correct
26 Correct 47 ms 8904 KB Output is correct
27 Correct 49 ms 8656 KB Output is correct
28 Correct 48 ms 8788 KB Output is correct
29 Correct 47 ms 8900 KB Output is correct
30 Correct 48 ms 8648 KB Output is correct
31 Correct 11 ms 6976 KB Output is correct
32 Correct 10 ms 7044 KB Output is correct
33 Correct 10 ms 6868 KB Output is correct
34 Correct 11 ms 7124 KB Output is correct
35 Correct 12 ms 6972 KB Output is correct
36 Correct 12 ms 7376 KB Output is correct
37 Correct 17 ms 7376 KB Output is correct
38 Correct 17 ms 7380 KB Output is correct
39 Correct 24 ms 7672 KB Output is correct
40 Correct 37 ms 8344 KB Output is correct
41 Correct 78 ms 9244 KB Output is correct
42 Correct 49 ms 9200 KB Output is correct
43 Correct 49 ms 9164 KB Output is correct
44 Correct 51 ms 9108 KB Output is correct
45 Correct 50 ms 9168 KB Output is correct
46 Correct 83 ms 9280 KB Output is correct
47 Correct 50 ms 9164 KB Output is correct
48 Correct 49 ms 9172 KB Output is correct
49 Correct 49 ms 9160 KB Output is correct
50 Correct 49 ms 9160 KB Output is correct
51 Correct 55 ms 9188 KB Output is correct
52 Correct 50 ms 9164 KB Output is correct
53 Correct 49 ms 9160 KB Output is correct
54 Correct 87 ms 9164 KB Output is correct
55 Correct 50 ms 9164 KB Output is correct
56 Correct 51 ms 8904 KB Output is correct
57 Correct 60 ms 8972 KB Output is correct
58 Correct 88 ms 8908 KB Output is correct
59 Correct 50 ms 8912 KB Output is correct
60 Correct 50 ms 8908 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6868 KB Output is correct
2 Correct 10 ms 6868 KB Output is correct
3 Correct 13 ms 6868 KB Output is correct
4 Correct 11 ms 6868 KB Output is correct
5 Correct 10 ms 6868 KB Output is correct
6 Correct 11 ms 6868 KB Output is correct
7 Correct 11 ms 6868 KB Output is correct
8 Correct 13 ms 6904 KB Output is correct
9 Correct 10 ms 6868 KB Output is correct
10 Correct 10 ms 6868 KB Output is correct
11 Correct 10 ms 6900 KB Output is correct
12 Correct 11 ms 6972 KB Output is correct
13 Correct 12 ms 6880 KB Output is correct
14 Correct 25 ms 7480 KB Output is correct
15 Correct 34 ms 8148 KB Output is correct
16 Correct 47 ms 8680 KB Output is correct
17 Correct 59 ms 8724 KB Output is correct
18 Correct 51 ms 8816 KB Output is correct
19 Correct 45 ms 8804 KB Output is correct
20 Correct 45 ms 8904 KB Output is correct
21 Correct 49 ms 8652 KB Output is correct
22 Correct 47 ms 8652 KB Output is correct
23 Correct 48 ms 8652 KB Output is correct
24 Correct 49 ms 8660 KB Output is correct
25 Correct 50 ms 8788 KB Output is correct
26 Correct 10 ms 6864 KB Output is correct
27 Correct 11 ms 6868 KB Output is correct
28 Correct 15 ms 6880 KB Output is correct
29 Correct 23 ms 7636 KB Output is correct
30 Correct 39 ms 8140 KB Output is correct
31 Correct 81 ms 8692 KB Output is correct
32 Correct 51 ms 8700 KB Output is correct
33 Correct 47 ms 8604 KB Output is correct
34 Correct 49 ms 8652 KB Output is correct
35 Correct 47 ms 8648 KB Output is correct
36 Correct 47 ms 8904 KB Output is correct
37 Correct 49 ms 8656 KB Output is correct
38 Correct 48 ms 8788 KB Output is correct
39 Correct 47 ms 8900 KB Output is correct
40 Correct 48 ms 8648 KB Output is correct
41 Correct 11 ms 6976 KB Output is correct
42 Correct 10 ms 7044 KB Output is correct
43 Correct 10 ms 6868 KB Output is correct
44 Correct 11 ms 7124 KB Output is correct
45 Correct 12 ms 6972 KB Output is correct
46 Correct 12 ms 7376 KB Output is correct
47 Correct 17 ms 7376 KB Output is correct
48 Correct 17 ms 7380 KB Output is correct
49 Correct 24 ms 7672 KB Output is correct
50 Correct 37 ms 8344 KB Output is correct
51 Correct 78 ms 9244 KB Output is correct
52 Correct 49 ms 9200 KB Output is correct
53 Correct 49 ms 9164 KB Output is correct
54 Correct 51 ms 9108 KB Output is correct
55 Correct 50 ms 9168 KB Output is correct
56 Correct 83 ms 9280 KB Output is correct
57 Correct 50 ms 9164 KB Output is correct
58 Correct 49 ms 9172 KB Output is correct
59 Correct 49 ms 9160 KB Output is correct
60 Correct 49 ms 9160 KB Output is correct
61 Correct 55 ms 9188 KB Output is correct
62 Correct 50 ms 9164 KB Output is correct
63 Correct 49 ms 9160 KB Output is correct
64 Correct 87 ms 9164 KB Output is correct
65 Correct 50 ms 9164 KB Output is correct
66 Correct 51 ms 8904 KB Output is correct
67 Correct 60 ms 8972 KB Output is correct
68 Correct 88 ms 8908 KB Output is correct
69 Correct 50 ms 8912 KB Output is correct
70 Correct 50 ms 8908 KB Output is correct
71 Correct 18 ms 7380 KB Output is correct
72 Correct 18 ms 7380 KB Output is correct
73 Correct 18 ms 7380 KB Output is correct
74 Correct 19 ms 7380 KB Output is correct
75 Correct 18 ms 7380 KB Output is correct
76 Correct 24 ms 7892 KB Output is correct
77 Correct 45 ms 7888 KB Output is correct
78 Correct 26 ms 7888 KB Output is correct
79 Correct 47 ms 7892 KB Output is correct
80 Correct 47 ms 7880 KB Output is correct
81 Correct 70 ms 8388 KB Output is correct
82 Correct 66 ms 8396 KB Output is correct
83 Correct 39 ms 8392 KB Output is correct
84 Correct 39 ms 8404 KB Output is correct
85 Correct 38 ms 8400 KB Output is correct
86 Correct 43 ms 8564 KB Output is correct
87 Correct 41 ms 8396 KB Output is correct
88 Correct 43 ms 8396 KB Output is correct
89 Correct 41 ms 8400 KB Output is correct
90 Correct 41 ms 8372 KB Output is correct
91 Correct 58 ms 10832 KB Output is correct
92 Correct 83 ms 10684 KB Output is correct
93 Correct 95 ms 10680 KB Output is correct
94 Correct 93 ms 10788 KB Output is correct
95 Correct 83 ms 10816 KB Output is correct
96 Correct 61 ms 12564 KB Output is correct
97 Correct 60 ms 12588 KB Output is correct
98 Correct 69 ms 12732 KB Output is correct
99 Correct 59 ms 12508 KB Output is correct
100 Correct 60 ms 12516 KB Output is correct
101 Correct 85 ms 12632 KB Output is correct
102 Correct 82 ms 12672 KB Output is correct
103 Correct 60 ms 12740 KB Output is correct
104 Correct 59 ms 12580 KB Output is correct
105 Correct 62 ms 12532 KB Output is correct
106 Correct 58 ms 13544 KB Output is correct
107 Correct 60 ms 13704 KB Output is correct
108 Correct 97 ms 13544 KB Output is correct
109 Correct 60 ms 13764 KB Output is correct
110 Correct 64 ms 13760 KB Output is correct
111 Correct 61 ms 13752 KB Output is correct
112 Correct 62 ms 13708 KB Output is correct
113 Correct 60 ms 13752 KB Output is correct
114 Correct 60 ms 13692 KB Output is correct
115 Correct 58 ms 13672 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6868 KB Output is correct
2 Correct 10 ms 6868 KB Output is correct
3 Correct 13 ms 6868 KB Output is correct
4 Correct 11 ms 6868 KB Output is correct
5 Correct 10 ms 6868 KB Output is correct
6 Correct 11 ms 6868 KB Output is correct
7 Correct 11 ms 6868 KB Output is correct
8 Correct 13 ms 6904 KB Output is correct
9 Correct 10 ms 6868 KB Output is correct
10 Correct 10 ms 6868 KB Output is correct
11 Correct 10 ms 6900 KB Output is correct
12 Correct 11 ms 6972 KB Output is correct
13 Correct 12 ms 6880 KB Output is correct
14 Correct 25 ms 7480 KB Output is correct
15 Correct 34 ms 8148 KB Output is correct
16 Correct 47 ms 8680 KB Output is correct
17 Correct 59 ms 8724 KB Output is correct
18 Correct 51 ms 8816 KB Output is correct
19 Correct 45 ms 8804 KB Output is correct
20 Correct 45 ms 8904 KB Output is correct
21 Correct 49 ms 8652 KB Output is correct
22 Correct 47 ms 8652 KB Output is correct
23 Correct 48 ms 8652 KB Output is correct
24 Correct 49 ms 8660 KB Output is correct
25 Correct 50 ms 8788 KB Output is correct
26 Correct 10 ms 6864 KB Output is correct
27 Correct 11 ms 6868 KB Output is correct
28 Correct 15 ms 6880 KB Output is correct
29 Correct 23 ms 7636 KB Output is correct
30 Correct 39 ms 8140 KB Output is correct
31 Correct 81 ms 8692 KB Output is correct
32 Correct 51 ms 8700 KB Output is correct
33 Correct 47 ms 8604 KB Output is correct
34 Correct 49 ms 8652 KB Output is correct
35 Correct 47 ms 8648 KB Output is correct
36 Correct 47 ms 8904 KB Output is correct
37 Correct 49 ms 8656 KB Output is correct
38 Correct 48 ms 8788 KB Output is correct
39 Correct 47 ms 8900 KB Output is correct
40 Correct 48 ms 8648 KB Output is correct
41 Correct 11 ms 6976 KB Output is correct
42 Correct 10 ms 7044 KB Output is correct
43 Correct 10 ms 6868 KB Output is correct
44 Correct 11 ms 7124 KB Output is correct
45 Correct 12 ms 6972 KB Output is correct
46 Correct 12 ms 7376 KB Output is correct
47 Correct 17 ms 7376 KB Output is correct
48 Correct 17 ms 7380 KB Output is correct
49 Correct 24 ms 7672 KB Output is correct
50 Correct 37 ms 8344 KB Output is correct
51 Correct 78 ms 9244 KB Output is correct
52 Correct 49 ms 9200 KB Output is correct
53 Correct 49 ms 9164 KB Output is correct
54 Correct 51 ms 9108 KB Output is correct
55 Correct 50 ms 9168 KB Output is correct
56 Correct 83 ms 9280 KB Output is correct
57 Correct 50 ms 9164 KB Output is correct
58 Correct 49 ms 9172 KB Output is correct
59 Correct 49 ms 9160 KB Output is correct
60 Correct 49 ms 9160 KB Output is correct
61 Correct 55 ms 9188 KB Output is correct
62 Correct 50 ms 9164 KB Output is correct
63 Correct 49 ms 9160 KB Output is correct
64 Correct 87 ms 9164 KB Output is correct
65 Correct 50 ms 9164 KB Output is correct
66 Correct 51 ms 8904 KB Output is correct
67 Correct 60 ms 8972 KB Output is correct
68 Correct 88 ms 8908 KB Output is correct
69 Correct 50 ms 8912 KB Output is correct
70 Correct 50 ms 8908 KB Output is correct
71 Correct 18 ms 7380 KB Output is correct
72 Correct 18 ms 7380 KB Output is correct
73 Correct 18 ms 7380 KB Output is correct
74 Correct 19 ms 7380 KB Output is correct
75 Correct 18 ms 7380 KB Output is correct
76 Correct 24 ms 7892 KB Output is correct
77 Correct 45 ms 7888 KB Output is correct
78 Correct 26 ms 7888 KB Output is correct
79 Correct 47 ms 7892 KB Output is correct
80 Correct 47 ms 7880 KB Output is correct
81 Correct 70 ms 8388 KB Output is correct
82 Correct 66 ms 8396 KB Output is correct
83 Correct 39 ms 8392 KB Output is correct
84 Correct 39 ms 8404 KB Output is correct
85 Correct 38 ms 8400 KB Output is correct
86 Correct 43 ms 8564 KB Output is correct
87 Correct 41 ms 8396 KB Output is correct
88 Correct 43 ms 8396 KB Output is correct
89 Correct 41 ms 8400 KB Output is correct
90 Correct 41 ms 8372 KB Output is correct
91 Correct 58 ms 10832 KB Output is correct
92 Correct 83 ms 10684 KB Output is correct
93 Correct 95 ms 10680 KB Output is correct
94 Correct 93 ms 10788 KB Output is correct
95 Correct 83 ms 10816 KB Output is correct
96 Correct 61 ms 12564 KB Output is correct
97 Correct 60 ms 12588 KB Output is correct
98 Correct 69 ms 12732 KB Output is correct
99 Correct 59 ms 12508 KB Output is correct
100 Correct 60 ms 12516 KB Output is correct
101 Correct 85 ms 12632 KB Output is correct
102 Correct 82 ms 12672 KB Output is correct
103 Correct 60 ms 12740 KB Output is correct
104 Correct 59 ms 12580 KB Output is correct
105 Correct 62 ms 12532 KB Output is correct
106 Correct 58 ms 13544 KB Output is correct
107 Correct 60 ms 13704 KB Output is correct
108 Correct 97 ms 13544 KB Output is correct
109 Correct 60 ms 13764 KB Output is correct
110 Correct 64 ms 13760 KB Output is correct
111 Correct 61 ms 13752 KB Output is correct
112 Correct 62 ms 13708 KB Output is correct
113 Correct 60 ms 13752 KB Output is correct
114 Correct 60 ms 13692 KB Output is correct
115 Correct 58 ms 13672 KB Output is correct
116 Correct 683 ms 10292 KB Output is correct
117 Correct 729 ms 9836 KB Output is correct
118 Correct 1136 ms 10252 KB Output is correct
119 Correct 1107 ms 10256 KB Output is correct
120 Correct 1206 ms 10264 KB Output is correct
121 Correct 2378 ms 10428 KB Output is correct
122 Correct 2327 ms 10468 KB Output is correct
123 Execution timed out 7060 ms 10180 KB Time limit exceeded
124 Halted 0 ms 0 KB -