oj.uz

Submission #1090159

# Submission time Handle Problem Language Result Execution time Memory
1090159 2024-09-17T22:33:13 Z urd05 Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 12476 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=500;
const int sz=524288;
typedef pair<long long,long long> P;
P tree1[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);
}

P sum1(int i) {
    P ret=P(0,0);
    while (i>0) {
        ret=pl(ret,tree1[i]);
        i-=(i&-i);
    }
    return ret;
}

P sum(int l,int r,int node=1,int nodel=0,int noder=sz-1) {
    return mi(sum1(r+1),sum1(l));
}

void update(int i,P val) {
    i++;
    while (i<=300004) {
        tree1[i]=pl(tree1[i],val);
        i+=(i&-i);
    }
}

int pos[300005];
int tree[300005];

int sum(int i) {
    i++;
    int ret=0;
    while (i>0) {
        ret+=tree[i];
        i-=(i&-i);
    }
    return ret;
}

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 11 ms 6896 KB Output is correct
4 Correct 10 ms 6868 KB Output is correct
5 Correct 11 ms 6864 KB Output is correct
6 Correct 11 ms 6952 KB Output is correct
7 Correct 11 ms 6868 KB Output is correct
8 Correct 11 ms 6864 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 11 ms 6868 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 12 ms 6868 KB Output is correct
4 Correct 30 ms 7376 KB Output is correct
5 Correct 40 ms 7632 KB Output is correct
6 Correct 59 ms 8144 KB Output is correct
7 Correct 54 ms 8120 KB Output is correct
8 Correct 68 ms 8140 KB Output is correct
9 Correct 58 ms 8076 KB Output is correct
10 Correct 55 ms 8228 KB Output is correct
11 Correct 55 ms 8000 KB Output is correct
12 Correct 60 ms 8148 KB Output is correct
13 Correct 55 ms 8140 KB Output is correct
14 Correct 56 ms 8144 KB Output is correct
15 Correct 56 ms 8028 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 12 ms 6868 KB Output is correct
4 Correct 30 ms 7376 KB Output is correct
5 Correct 40 ms 7632 KB Output is correct
6 Correct 59 ms 8144 KB Output is correct
7 Correct 54 ms 8120 KB Output is correct
8 Correct 68 ms 8140 KB Output is correct
9 Correct 58 ms 8076 KB Output is correct
10 Correct 55 ms 8228 KB Output is correct
11 Correct 55 ms 8000 KB Output is correct
12 Correct 60 ms 8148 KB Output is correct
13 Correct 55 ms 8140 KB Output is correct
14 Correct 56 ms 8144 KB Output is correct
15 Correct 56 ms 8028 KB Output is correct
16 Correct 12 ms 6856 KB Output is correct
17 Correct 11 ms 6868 KB Output is correct
18 Correct 13 ms 6868 KB Output is correct
19 Correct 29 ms 7380 KB Output is correct
20 Correct 41 ms 7624 KB Output is correct
21 Correct 57 ms 8056 KB Output is correct
22 Correct 60 ms 8140 KB Output is correct
23 Correct 57 ms 8140 KB Output is correct
24 Correct 57 ms 8140 KB Output is correct
25 Correct 57 ms 8052 KB Output is correct
26 Correct 57 ms 8140 KB Output is correct
27 Correct 56 ms 8164 KB Output is correct
28 Correct 57 ms 8060 KB Output is correct
29 Correct 58 ms 8108 KB Output is correct
30 Correct 63 ms 8144 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 12 ms 6868 KB Output is correct
4 Correct 30 ms 7376 KB Output is correct
5 Correct 40 ms 7632 KB Output is correct
6 Correct 59 ms 8144 KB Output is correct
7 Correct 54 ms 8120 KB Output is correct
8 Correct 68 ms 8140 KB Output is correct
9 Correct 58 ms 8076 KB Output is correct
10 Correct 55 ms 8228 KB Output is correct
11 Correct 55 ms 8000 KB Output is correct
12 Correct 60 ms 8148 KB Output is correct
13 Correct 55 ms 8140 KB Output is correct
14 Correct 56 ms 8144 KB Output is correct
15 Correct 56 ms 8028 KB Output is correct
16 Correct 12 ms 6856 KB Output is correct
17 Correct 11 ms 6868 KB Output is correct
18 Correct 13 ms 6868 KB Output is correct
19 Correct 29 ms 7380 KB Output is correct
20 Correct 41 ms 7624 KB Output is correct
21 Correct 57 ms 8056 KB Output is correct
22 Correct 60 ms 8140 KB Output is correct
23 Correct 57 ms 8140 KB Output is correct
24 Correct 57 ms 8140 KB Output is correct
25 Correct 57 ms 8052 KB Output is correct
26 Correct 57 ms 8140 KB Output is correct
27 Correct 56 ms 8164 KB Output is correct
28 Correct 57 ms 8060 KB Output is correct
29 Correct 58 ms 8108 KB Output is correct
30 Correct 63 ms 8144 KB Output is correct
31 Correct 11 ms 6864 KB Output is correct
32 Correct 13 ms 6868 KB Output is correct
33 Correct 11 ms 6868 KB Output is correct
34 Correct 13 ms 6936 KB Output is correct
35 Correct 12 ms 6868 KB Output is correct
36 Correct 14 ms 7040 KB Output is correct
37 Correct 20 ms 7144 KB Output is correct
38 Correct 20 ms 7120 KB Output is correct
39 Correct 28 ms 7388 KB Output is correct
40 Correct 44 ms 7632 KB Output is correct
41 Correct 56 ms 8160 KB Output is correct
42 Correct 59 ms 8148 KB Output is correct
43 Correct 61 ms 8148 KB Output is correct
44 Correct 59 ms 8136 KB Output is correct
45 Correct 57 ms 8148 KB Output is correct
46 Correct 67 ms 7972 KB Output is correct
47 Correct 57 ms 8148 KB Output is correct
48 Correct 59 ms 8148 KB Output is correct
49 Correct 57 ms 8140 KB Output is correct
50 Correct 55 ms 8144 KB Output is correct
51 Correct 57 ms 8136 KB Output is correct
52 Correct 58 ms 8136 KB Output is correct
53 Correct 57 ms 8148 KB Output is correct
54 Correct 56 ms 8140 KB Output is correct
55 Correct 56 ms 8148 KB Output is correct
56 Correct 57 ms 8136 KB Output is correct
57 Correct 70 ms 8148 KB Output is correct
58 Correct 56 ms 8132 KB Output is correct
59 Correct 60 ms 8168 KB Output is correct
60 Correct 56 ms 8148 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 11 ms 6896 KB Output is correct
4 Correct 10 ms 6868 KB Output is correct
5 Correct 11 ms 6864 KB Output is correct
6 Correct 11 ms 6952 KB Output is correct
7 Correct 11 ms 6868 KB Output is correct
8 Correct 11 ms 6864 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 11 ms 6868 KB Output is correct
11 Correct 11 ms 6864 KB Output is correct
12 Correct 11 ms 6868 KB Output is correct
13 Correct 12 ms 6868 KB Output is correct
14 Correct 30 ms 7376 KB Output is correct
15 Correct 40 ms 7632 KB Output is correct
16 Correct 59 ms 8144 KB Output is correct
17 Correct 54 ms 8120 KB Output is correct
18 Correct 68 ms 8140 KB Output is correct
19 Correct 58 ms 8076 KB Output is correct
20 Correct 55 ms 8228 KB Output is correct
21 Correct 55 ms 8000 KB Output is correct
22 Correct 60 ms 8148 KB Output is correct
23 Correct 55 ms 8140 KB Output is correct
24 Correct 56 ms 8144 KB Output is correct
25 Correct 56 ms 8028 KB Output is correct
26 Correct 12 ms 6856 KB Output is correct
27 Correct 11 ms 6868 KB Output is correct
28 Correct 13 ms 6868 KB Output is correct
29 Correct 29 ms 7380 KB Output is correct
30 Correct 41 ms 7624 KB Output is correct
31 Correct 57 ms 8056 KB Output is correct
32 Correct 60 ms 8140 KB Output is correct
33 Correct 57 ms 8140 KB Output is correct
34 Correct 57 ms 8140 KB Output is correct
35 Correct 57 ms 8052 KB Output is correct
36 Correct 57 ms 8140 KB Output is correct
37 Correct 56 ms 8164 KB Output is correct
38 Correct 57 ms 8060 KB Output is correct
39 Correct 58 ms 8108 KB Output is correct
40 Correct 63 ms 8144 KB Output is correct
41 Correct 11 ms 6864 KB Output is correct
42 Correct 13 ms 6868 KB Output is correct
43 Correct 11 ms 6868 KB Output is correct
44 Correct 13 ms 6936 KB Output is correct
45 Correct 12 ms 6868 KB Output is correct
46 Correct 14 ms 7040 KB Output is correct
47 Correct 20 ms 7144 KB Output is correct
48 Correct 20 ms 7120 KB Output is correct
49 Correct 28 ms 7388 KB Output is correct
50 Correct 44 ms 7632 KB Output is correct
51 Correct 56 ms 8160 KB Output is correct
52 Correct 59 ms 8148 KB Output is correct
53 Correct 61 ms 8148 KB Output is correct
54 Correct 59 ms 8136 KB Output is correct
55 Correct 57 ms 8148 KB Output is correct
56 Correct 67 ms 7972 KB Output is correct
57 Correct 57 ms 8148 KB Output is correct
58 Correct 59 ms 8148 KB Output is correct
59 Correct 57 ms 8140 KB Output is correct
60 Correct 55 ms 8144 KB Output is correct
61 Correct 57 ms 8136 KB Output is correct
62 Correct 58 ms 8136 KB Output is correct
63 Correct 57 ms 8148 KB Output is correct
64 Correct 56 ms 8140 KB Output is correct
65 Correct 56 ms 8148 KB Output is correct
66 Correct 57 ms 8136 KB Output is correct
67 Correct 70 ms 8148 KB Output is correct
68 Correct 56 ms 8132 KB Output is correct
69 Correct 60 ms 8168 KB Output is correct
70 Correct 56 ms 8148 KB Output is correct
71 Correct 19 ms 7120 KB Output is correct
72 Correct 20 ms 7124 KB Output is correct
73 Correct 19 ms 7120 KB Output is correct
74 Correct 19 ms 7120 KB Output is correct
75 Correct 19 ms 7124 KB Output is correct
76 Correct 29 ms 7380 KB Output is correct
77 Correct 27 ms 7380 KB Output is correct
78 Correct 27 ms 7380 KB Output is correct
79 Correct 27 ms 7376 KB Output is correct
80 Correct 27 ms 7376 KB Output is correct
81 Correct 43 ms 7636 KB Output is correct
82 Correct 43 ms 7644 KB Output is correct
83 Correct 43 ms 7636 KB Output is correct
84 Correct 43 ms 7624 KB Output is correct
85 Correct 45 ms 7628 KB Output is correct
86 Correct 46 ms 7740 KB Output is correct
87 Correct 46 ms 7652 KB Output is correct
88 Correct 46 ms 7624 KB Output is correct
89 Correct 45 ms 7632 KB Output is correct
90 Correct 51 ms 7632 KB Output is correct
91 Correct 65 ms 9412 KB Output is correct
92 Correct 68 ms 9656 KB Output is correct
93 Correct 64 ms 9404 KB Output is correct
94 Correct 64 ms 9640 KB Output is correct
95 Correct 64 ms 9520 KB Output is correct
96 Correct 68 ms 11508 KB Output is correct
97 Correct 74 ms 11424 KB Output is correct
98 Correct 68 ms 11420 KB Output is correct
99 Correct 68 ms 11540 KB Output is correct
100 Correct 67 ms 11464 KB Output is correct
101 Correct 68 ms 11452 KB Output is correct
102 Correct 68 ms 11464 KB Output is correct
103 Correct 70 ms 11448 KB Output is correct
104 Correct 68 ms 11364 KB Output is correct
105 Correct 67 ms 11604 KB Output is correct
106 Correct 70 ms 12472 KB Output is correct
107 Correct 67 ms 12448 KB Output is correct
108 Correct 69 ms 12476 KB Output is correct
109 Correct 68 ms 12332 KB Output is correct
110 Correct 68 ms 12472 KB Output is correct
111 Correct 69 ms 12352 KB Output is correct
112 Correct 68 ms 12432 KB Output is correct
113 Correct 68 ms 12424 KB Output is correct
114 Correct 67 ms 12476 KB Output is correct
115 Correct 67 ms 12476 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6864 KB Output is correct
2 Correct 11 ms 6868 KB Output is correct
3 Correct 11 ms 6896 KB Output is correct
4 Correct 10 ms 6868 KB Output is correct
5 Correct 11 ms 6864 KB Output is correct
6 Correct 11 ms 6952 KB Output is correct
7 Correct 11 ms 6868 KB Output is correct
8 Correct 11 ms 6864 KB Output is correct
9 Correct 11 ms 6868 KB Output is correct
10 Correct 11 ms 6868 KB Output is correct
11 Correct 11 ms 6864 KB Output is correct
12 Correct 11 ms 6868 KB Output is correct
13 Correct 12 ms 6868 KB Output is correct
14 Correct 30 ms 7376 KB Output is correct
15 Correct 40 ms 7632 KB Output is correct
16 Correct 59 ms 8144 KB Output is correct
17 Correct 54 ms 8120 KB Output is correct
18 Correct 68 ms 8140 KB Output is correct
19 Correct 58 ms 8076 KB Output is correct
20 Correct 55 ms 8228 KB Output is correct
21 Correct 55 ms 8000 KB Output is correct
22 Correct 60 ms 8148 KB Output is correct
23 Correct 55 ms 8140 KB Output is correct
24 Correct 56 ms 8144 KB Output is correct
25 Correct 56 ms 8028 KB Output is correct
26 Correct 12 ms 6856 KB Output is correct
27 Correct 11 ms 6868 KB Output is correct
28 Correct 13 ms 6868 KB Output is correct
29 Correct 29 ms 7380 KB Output is correct
30 Correct 41 ms 7624 KB Output is correct
31 Correct 57 ms 8056 KB Output is correct
32 Correct 60 ms 8140 KB Output is correct
33 Correct 57 ms 8140 KB Output is correct
34 Correct 57 ms 8140 KB Output is correct
35 Correct 57 ms 8052 KB Output is correct
36 Correct 57 ms 8140 KB Output is correct
37 Correct 56 ms 8164 KB Output is correct
38 Correct 57 ms 8060 KB Output is correct
39 Correct 58 ms 8108 KB Output is correct
40 Correct 63 ms 8144 KB Output is correct
41 Correct 11 ms 6864 KB Output is correct
42 Correct 13 ms 6868 KB Output is correct
43 Correct 11 ms 6868 KB Output is correct
44 Correct 13 ms 6936 KB Output is correct
45 Correct 12 ms 6868 KB Output is correct
46 Correct 14 ms 7040 KB Output is correct
47 Correct 20 ms 7144 KB Output is correct
48 Correct 20 ms 7120 KB Output is correct
49 Correct 28 ms 7388 KB Output is correct
50 Correct 44 ms 7632 KB Output is correct
51 Correct 56 ms 8160 KB Output is correct
52 Correct 59 ms 8148 KB Output is correct
53 Correct 61 ms 8148 KB Output is correct
54 Correct 59 ms 8136 KB Output is correct
55 Correct 57 ms 8148 KB Output is correct
56 Correct 67 ms 7972 KB Output is correct
57 Correct 57 ms 8148 KB Output is correct
58 Correct 59 ms 8148 KB Output is correct
59 Correct 57 ms 8140 KB Output is correct
60 Correct 55 ms 8144 KB Output is correct
61 Correct 57 ms 8136 KB Output is correct
62 Correct 58 ms 8136 KB Output is correct
63 Correct 57 ms 8148 KB Output is correct
64 Correct 56 ms 8140 KB Output is correct
65 Correct 56 ms 8148 KB Output is correct
66 Correct 57 ms 8136 KB Output is correct
67 Correct 70 ms 8148 KB Output is correct
68 Correct 56 ms 8132 KB Output is correct
69 Correct 60 ms 8168 KB Output is correct
70 Correct 56 ms 8148 KB Output is correct
71 Correct 19 ms 7120 KB Output is correct
72 Correct 20 ms 7124 KB Output is correct
73 Correct 19 ms 7120 KB Output is correct
74 Correct 19 ms 7120 KB Output is correct
75 Correct 19 ms 7124 KB Output is correct
76 Correct 29 ms 7380 KB Output is correct
77 Correct 27 ms 7380 KB Output is correct
78 Correct 27 ms 7380 KB Output is correct
79 Correct 27 ms 7376 KB Output is correct
80 Correct 27 ms 7376 KB Output is correct
81 Correct 43 ms 7636 KB Output is correct
82 Correct 43 ms 7644 KB Output is correct
83 Correct 43 ms 7636 KB Output is correct
84 Correct 43 ms 7624 KB Output is correct
85 Correct 45 ms 7628 KB Output is correct
86 Correct 46 ms 7740 KB Output is correct
87 Correct 46 ms 7652 KB Output is correct
88 Correct 46 ms 7624 KB Output is correct
89 Correct 45 ms 7632 KB Output is correct
90 Correct 51 ms 7632 KB Output is correct
91 Correct 65 ms 9412 KB Output is correct
92 Correct 68 ms 9656 KB Output is correct
93 Correct 64 ms 9404 KB Output is correct
94 Correct 64 ms 9640 KB Output is correct
95 Correct 64 ms 9520 KB Output is correct
96 Correct 68 ms 11508 KB Output is correct
97 Correct 74 ms 11424 KB Output is correct
98 Correct 68 ms 11420 KB Output is correct
99 Correct 68 ms 11540 KB Output is correct
100 Correct 67 ms 11464 KB Output is correct
101 Correct 68 ms 11452 KB Output is correct
102 Correct 68 ms 11464 KB Output is correct
103 Correct 70 ms 11448 KB Output is correct
104 Correct 68 ms 11364 KB Output is correct
105 Correct 67 ms 11604 KB Output is correct
106 Correct 70 ms 12472 KB Output is correct
107 Correct 67 ms 12448 KB Output is correct
108 Correct 69 ms 12476 KB Output is correct
109 Correct 68 ms 12332 KB Output is correct
110 Correct 68 ms 12472 KB Output is correct
111 Correct 69 ms 12352 KB Output is correct
112 Correct 68 ms 12432 KB Output is correct
113 Correct 68 ms 12424 KB Output is correct
114 Correct 67 ms 12476 KB Output is correct
115 Correct 67 ms 12476 KB Output is correct
116 Correct 960 ms 9816 KB Output is correct
117 Correct 981 ms 9812 KB Output is correct
118 Correct 1447 ms 10172 KB Output is correct
119 Correct 1419 ms 10236 KB Output is correct
120 Correct 1391 ms 10236 KB Output is correct
121 Correct 2942 ms 10432 KB Output is correct
122 Correct 2917 ms 11476 KB Output is correct
123 Execution timed out 7057 ms 11452 KB Time limit exceeded
124 Halted 0 ms 0 KB -