oj.uz

Submission #783852

# Submission time Handle Problem Language Result Execution time Memory
783852 2023-07-15T11:25:35 Z YassineBenYounes Council (JOI23_council) C++17
56 / 100
 4000 ms 12484 KB 
#include<bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pair<ll, ll>, null_type, less<pair<ll,ll>>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}

const int mx = (1 << 20)+5;
const int LOG = 25;
const ll inf = 1e18;
const ll mod = 1e8;

int arr[mx];

int sum[25];

int freq[mx], cnt[mx];

int done[mx];

void run_case(){
    int n, m;cin >> n >> m; 
    for(int i = 0; i < n;i++){
        for(int j = 0;j < m;j++){
            int a;cin >> a;
            arr[i] += (1 << j) * a;
            sum[j] += a;
        }
        freq[arr[i]]++;
    }
    vector<int> v;
    for(int i = 0; i < (1 << m);i++){
        if(freq[i] != 0){
            v.push_back(i);
        }
        for(int j = 0;j < m;j++){
            if((1 << j) & i){
                cnt[i]++;
            }
        }
    }
    memset(done, -1, sizeof done);
    for(int i = 0; i < n;i++){
        if(done[arr[i]] != -1){
            cout << done[arr[i]] << endl;
            continue;
        }
        int res = 0, ans = 0;
        int x = 0;
        for(int j = 0;j < m;j++){
            bool p =(arr[i] & (1 << j));
            sum[j] -= p;
            if(sum[j] == n/2)x += (1 << j);
            if(sum[j] >= n/2)res++;
        }
        //cout << res << endl;
        for(int mask : v){
            int k = x & mask;
            int target = cnt[k];
            //cout << mask << " " << target << endl;
            if(mask == arr[i]){
                if(freq[mask] >= 2){
                    ans = max(ans, res-target);
                }
            }
            else if(freq[mask] >= 1){
                ans = max(ans, res-target);
            }
        }
        cout << ans << endl;
        for(int j = 0;j < m;j++){
            bool p =(arr[i] & (1 << j));
            sum[j] += p;
        }
        done[arr[i]] = ans;
    }
}

int32_t main(){
    speed;
    int t = 1;
    //cin >> t;
    while(t--){
        run_case();
    }
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

council.cpp: In function 'void usaco_problem()':
council.cpp:11:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp: In function 'void init()':
council.cpp:18:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:20:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 68 ms 8456 KB Output is correct
6 Correct 69 ms 8524 KB Output is correct
7 Correct 69 ms 8512 KB Output is correct
8 Correct 68 ms 8480 KB Output is correct
9 Correct 72 ms 9580 KB Output is correct
10 Correct 68 ms 8472 KB Output is correct
11 Correct 69 ms 8524 KB Output is correct
12 Correct 71 ms 9548 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4384 KB Output is correct
21 Correct 2 ms 4352 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 2 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4436 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4436 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4436 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 3 ms 4436 KB Output is correct
42 Correct 3 ms 4436 KB Output is correct
43 Correct 3 ms 4524 KB Output is correct
44 Correct 3 ms 4436 KB Output is correct
45 Correct 3 ms 4436 KB Output is correct
46 Correct 10 ms 4948 KB Output is correct
47 Correct 11 ms 4908 KB Output is correct
48 Correct 10 ms 4948 KB Output is correct
49 Correct 10 ms 4952 KB Output is correct
50 Correct 10 ms 5092 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 68 ms 8456 KB Output is correct
6 Correct 69 ms 8524 KB Output is correct
7 Correct 69 ms 8512 KB Output is correct
8 Correct 68 ms 8480 KB Output is correct
9 Correct 72 ms 9580 KB Output is correct
10 Correct 68 ms 8472 KB Output is correct
11 Correct 69 ms 8524 KB Output is correct
12 Correct 71 ms 9548 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4384 KB Output is correct
21 Correct 2 ms 4352 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 2 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4436 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4436 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4436 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 3 ms 4436 KB Output is correct
42 Correct 3 ms 4436 KB Output is correct
43 Correct 3 ms 4524 KB Output is correct
44 Correct 3 ms 4436 KB Output is correct
45 Correct 3 ms 4436 KB Output is correct
46 Correct 10 ms 4948 KB Output is correct
47 Correct 11 ms 4908 KB Output is correct
48 Correct 10 ms 4948 KB Output is correct
49 Correct 10 ms 4952 KB Output is correct
50 Correct 10 ms 5092 KB Output is correct
51 Correct 73 ms 8448 KB Output is correct
52 Correct 73 ms 8528 KB Output is correct
53 Correct 88 ms 12364 KB Output is correct
54 Correct 105 ms 12484 KB Output is correct
55 Correct 5 ms 4436 KB Output is correct
56 Correct 32 ms 5504 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 315 ms 6156 KB Output is correct
3 Correct 319 ms 6292 KB Output is correct
4 Correct 305 ms 6144 KB Output is correct
5 Correct 324 ms 6104 KB Output is correct
6 Correct 346 ms 6156 KB Output is correct
7 Correct 345 ms 6124 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 2 ms 4436 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 5 ms 4436 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 315 ms 6156 KB Output is correct
3 Correct 319 ms 6292 KB Output is correct
4 Correct 305 ms 6144 KB Output is correct
5 Correct 324 ms 6104 KB Output is correct
6 Correct 346 ms 6156 KB Output is correct
7 Correct 345 ms 6124 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 2 ms 4436 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 5 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 430 ms 6204 KB Output is correct
21 Correct 402 ms 6212 KB Output is correct
22 Correct 409 ms 6092 KB Output is correct
23 Correct 404 ms 6460 KB Output is correct
24 Correct 404 ms 6204 KB Output is correct
25 Correct 473 ms 6228 KB Output is correct
26 Correct 415 ms 6196 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4344 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4400 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4480 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 2 ms 4436 KB Output is correct
42 Correct 2 ms 4436 KB Output is correct
43 Correct 2 ms 4436 KB Output is correct
44 Correct 2 ms 4436 KB Output is correct
45 Correct 2 ms 4436 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 315 ms 6156 KB Output is correct
3 Correct 319 ms 6292 KB Output is correct
4 Correct 305 ms 6144 KB Output is correct
5 Correct 324 ms 6104 KB Output is correct
6 Correct 346 ms 6156 KB Output is correct
7 Correct 345 ms 6124 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 2 ms 4436 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 5 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 430 ms 6204 KB Output is correct
21 Correct 402 ms 6212 KB Output is correct
22 Correct 409 ms 6092 KB Output is correct
23 Correct 404 ms 6460 KB Output is correct
24 Correct 404 ms 6204 KB Output is correct
25 Correct 473 ms 6228 KB Output is correct
26 Correct 415 ms 6196 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4344 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4400 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4480 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 2 ms 4436 KB Output is correct
42 Correct 2 ms 4436 KB Output is correct
43 Correct 2 ms 4436 KB Output is correct
44 Correct 2 ms 4436 KB Output is correct
45 Correct 2 ms 4436 KB Output is correct
46 Correct 2 ms 4436 KB Output is correct
47 Correct 480 ms 6332 KB Output is correct
48 Correct 490 ms 6192 KB Output is correct
49 Correct 472 ms 6200 KB Output is correct
50 Correct 497 ms 6512 KB Output is correct
51 Correct 441 ms 6252 KB Output is correct
52 Correct 767 ms 6456 KB Output is correct
53 Correct 771 ms 6660 KB Output is correct
54 Correct 3 ms 4436 KB Output is correct
55 Correct 3 ms 4436 KB Output is correct
56 Correct 3 ms 4436 KB Output is correct
57 Correct 3 ms 4436 KB Output is correct
58 Correct 3 ms 4436 KB Output is correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 315 ms 6156 KB Output is correct
3 Correct 319 ms 6292 KB Output is correct
4 Correct 305 ms 6144 KB Output is correct
5 Correct 324 ms 6104 KB Output is correct
6 Correct 346 ms 6156 KB Output is correct
7 Correct 345 ms 6124 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 2 ms 4436 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4436 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 5 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 430 ms 6204 KB Output is correct
21 Correct 402 ms 6212 KB Output is correct
22 Correct 409 ms 6092 KB Output is correct
23 Correct 404 ms 6460 KB Output is correct
24 Correct 404 ms 6204 KB Output is correct
25 Correct 473 ms 6228 KB Output is correct
26 Correct 415 ms 6196 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4344 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4400 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4480 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 2 ms 4436 KB Output is correct
42 Correct 2 ms 4436 KB Output is correct
43 Correct 2 ms 4436 KB Output is correct
44 Correct 2 ms 4436 KB Output is correct
45 Correct 2 ms 4436 KB Output is correct
46 Correct 2 ms 4436 KB Output is correct
47 Correct 480 ms 6332 KB Output is correct
48 Correct 490 ms 6192 KB Output is correct
49 Correct 472 ms 6200 KB Output is correct
50 Correct 497 ms 6512 KB Output is correct
51 Correct 441 ms 6252 KB Output is correct
52 Correct 767 ms 6456 KB Output is correct
53 Correct 771 ms 6660 KB Output is correct
54 Correct 3 ms 4436 KB Output is correct
55 Correct 3 ms 4436 KB Output is correct
56 Correct 3 ms 4436 KB Output is correct
57 Correct 3 ms 4436 KB Output is correct
58 Correct 3 ms 4436 KB Output is correct
59 Correct 2324 ms 7392 KB Output is correct
60 Execution timed out 4062 ms 6596 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 68 ms 8456 KB Output is correct
6 Correct 69 ms 8524 KB Output is correct
7 Correct 69 ms 8512 KB Output is correct
8 Correct 68 ms 8480 KB Output is correct
9 Correct 72 ms 9580 KB Output is correct
10 Correct 68 ms 8472 KB Output is correct
11 Correct 69 ms 8524 KB Output is correct
12 Correct 71 ms 9548 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4436 KB Output is correct
16 Correct 1 ms 4436 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4436 KB Output is correct
19 Correct 2 ms 4436 KB Output is correct
20 Correct 2 ms 4384 KB Output is correct
21 Correct 2 ms 4352 KB Output is correct
22 Correct 2 ms 4436 KB Output is correct
23 Correct 2 ms 4436 KB Output is correct
24 Correct 2 ms 4436 KB Output is correct
25 Correct 2 ms 4436 KB Output is correct
26 Correct 2 ms 4436 KB Output is correct
27 Correct 2 ms 4436 KB Output is correct
28 Correct 2 ms 4436 KB Output is correct
29 Correct 2 ms 4436 KB Output is correct
30 Correct 2 ms 4436 KB Output is correct
31 Correct 2 ms 4436 KB Output is correct
32 Correct 2 ms 4436 KB Output is correct
33 Correct 2 ms 4436 KB Output is correct
34 Correct 2 ms 4436 KB Output is correct
35 Correct 2 ms 4436 KB Output is correct
36 Correct 2 ms 4436 KB Output is correct
37 Correct 2 ms 4436 KB Output is correct
38 Correct 2 ms 4436 KB Output is correct
39 Correct 2 ms 4436 KB Output is correct
40 Correct 2 ms 4436 KB Output is correct
41 Correct 3 ms 4436 KB Output is correct
42 Correct 3 ms 4436 KB Output is correct
43 Correct 3 ms 4524 KB Output is correct
44 Correct 3 ms 4436 KB Output is correct
45 Correct 3 ms 4436 KB Output is correct
46 Correct 10 ms 4948 KB Output is correct
47 Correct 11 ms 4908 KB Output is correct
48 Correct 10 ms 4948 KB Output is correct
49 Correct 10 ms 4952 KB Output is correct
50 Correct 10 ms 5092 KB Output is correct
51 Correct 73 ms 8448 KB Output is correct
52 Correct 73 ms 8528 KB Output is correct
53 Correct 88 ms 12364 KB Output is correct
54 Correct 105 ms 12484 KB Output is correct
55 Correct 5 ms 4436 KB Output is correct
56 Correct 32 ms 5504 KB Output is correct
57 Correct 2 ms 4436 KB Output is correct
58 Correct 315 ms 6156 KB Output is correct
59 Correct 319 ms 6292 KB Output is correct
60 Correct 305 ms 6144 KB Output is correct
61 Correct 324 ms 6104 KB Output is correct
62 Correct 346 ms 6156 KB Output is correct
63 Correct 345 ms 6124 KB Output is correct
64 Correct 2 ms 4436 KB Output is correct
65 Correct 2 ms 4436 KB Output is correct
66 Correct 2 ms 4436 KB Output is correct
67 Correct 2 ms 4436 KB Output is correct
68 Correct 2 ms 4436 KB Output is correct
69 Correct 2 ms 4436 KB Output is correct
70 Correct 2 ms 4436 KB Output is correct
71 Correct 2 ms 4436 KB Output is correct
72 Correct 2 ms 4436 KB Output is correct
73 Correct 5 ms 4436 KB Output is correct
74 Correct 2 ms 4436 KB Output is correct
75 Correct 2 ms 4436 KB Output is correct
76 Correct 430 ms 6204 KB Output is correct
77 Correct 402 ms 6212 KB Output is correct
78 Correct 409 ms 6092 KB Output is correct
79 Correct 404 ms 6460 KB Output is correct
80 Correct 404 ms 6204 KB Output is correct
81 Correct 473 ms 6228 KB Output is correct
82 Correct 415 ms 6196 KB Output is correct
83 Correct 2 ms 4436 KB Output is correct
84 Correct 2 ms 4436 KB Output is correct
85 Correct 2 ms 4344 KB Output is correct
86 Correct 2 ms 4436 KB Output is correct
87 Correct 2 ms 4436 KB Output is correct
88 Correct 2 ms 4400 KB Output is correct
89 Correct 2 ms 4436 KB Output is correct
90 Correct 2 ms 4480 KB Output is correct
91 Correct 2 ms 4436 KB Output is correct
92 Correct 2 ms 4436 KB Output is correct
93 Correct 2 ms 4436 KB Output is correct
94 Correct 2 ms 4436 KB Output is correct
95 Correct 2 ms 4436 KB Output is correct
96 Correct 2 ms 4436 KB Output is correct
97 Correct 2 ms 4436 KB Output is correct
98 Correct 2 ms 4436 KB Output is correct
99 Correct 2 ms 4436 KB Output is correct
100 Correct 2 ms 4436 KB Output is correct
101 Correct 2 ms 4436 KB Output is correct
102 Correct 2 ms 4436 KB Output is correct
103 Correct 480 ms 6332 KB Output is correct
104 Correct 490 ms 6192 KB Output is correct
105 Correct 472 ms 6200 KB Output is correct
106 Correct 497 ms 6512 KB Output is correct
107 Correct 441 ms 6252 KB Output is correct
108 Correct 767 ms 6456 KB Output is correct
109 Correct 771 ms 6660 KB Output is correct
110 Correct 3 ms 4436 KB Output is correct
111 Correct 3 ms 4436 KB Output is correct
112 Correct 3 ms 4436 KB Output is correct
113 Correct 3 ms 4436 KB Output is correct
114 Correct 3 ms 4436 KB Output is correct
115 Correct 2324 ms 7392 KB Output is correct
116 Execution timed out 4062 ms 6596 KB Time limit exceeded
117 Halted 0 ms 0 KB -