oj.uz

Submission #1060134

# Submission time Handle Problem Language Result Execution time Memory
1060134 2024-08-15T10:51:58 Z YassineBenYounes Vision Program (IOI19_vision) C++17
100 / 100
 65 ms 10956 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
////////////////////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 = 3e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 320;
 
#include "vision.h"
int n, m, k;
/*
int ind = 0;
int last = 0;
int arr[mx];


int best = 0;

int add_not(int x){
    best++;
    int y = !arr[x];
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_and(vi v){
    best += v.size();
    int y = 1;
    for(int i : v){
        y &= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_or(vi v){
    best += v.size();
    int y = 0;
    for(int i : v){
        y |= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_xor(vi v){
    best += v.size();
    int y = 0;
    for(int i : v){
        y ^= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 */
void construct_network(int H, int W, int K) {
    n=H,m=W,k=K;
    map<int, vi> dia1;
    map<int, vi> dia2;
    for(int i = 0; i < n;i++){
        for(int j = 0; j < m;j++){
            dia1[i-j].pb(i*m+j);
            dia2[i+j].pb(i*m+j);
        }
    }
    map<int, int> posdia1, posdia2;
    map<int, int> dia1_2, dia2_2;
    for(auto p : dia1){
        posdia1[p.ff] = add_or(p.ss);
        dia1_2[p.ff] = add_xor({posdia1[p.ff], add_xor(p.ss)});
    }
    for(auto p : dia2){
        posdia2[p.ff] = add_or(p.ss);
        dia2_2[p.ff] = add_xor({posdia2[p.ff], add_xor(p.ss)});
    }
    map<int, int> mp1_or, mp1_xor;
    vi tot1;
    for(int i = 1-m;i <= n-1;i++){
        vi v, v1;
        for(int j = i;j <= min(i+k-1, n-1);j++){
            v.pb(posdia1[j]);
            v1.pb(dia1_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        mp1_or[i] = a;
        int b = add_xor(v);
        mp1_xor[i] = b;
        int c = add_xor({a, b});
        tot1.pb(c);
        tot1.pb(l);
    }
    int k_1 = add_or(tot1);
    
    vi tot2;
    for(int i = 0;i <= (n-1+m-1);i++){
        vi v, v1;
        for(int j = i;j <= min(i+k-1, n-1+m-1);j++){
            v.pb(posdia2[j]);
            v1.pb(dia2_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot2.pb(c);
        tot2.pb(l);
    }
    int k_2 = add_or(tot2);
    tot1.clear();
    for(int i = 1-m;i <= n-1;i++){
        vi v, v1;
        v = {mp1_or[i]};
        if((i+k) <= (n-1))v.pb(posdia1[i+k]);
        for(int j = i;j <= min(i+k, n-1);j++){
            v1.pb(dia1_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        v = {mp1_xor[i]};
        if((i+k) <= (n-1))v.pb(posdia1[i+k]);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot1.pb(c);
        tot1.pb(l);
    }
    int k1 = add_or(tot1);
    tot2.clear();
    for(int i = 0;i <= (n-1+m-1);i++){
        vi v, v1;
        for(int j = i;j <= min(i+k, n-1+m-1);j++){
            v.pb(posdia2[j]);
            v1.pb(dia2_2[j]);
        }
        int l = add_or(v1);
        int a = add_or(v);
        int b = add_xor(v);
        int c = add_xor({a, b});
        tot2.pb(c);
        tot2.pb(l);
    }
    int k2 = add_or(tot2);
    int a = add_and({k1, k2});
    int b = add_and({k_1, k_2});
    int tem = add_not(b);
    int br = add_and({a, tem});
}
/*
int32_t main(){
    init();
    speed;
    arr[0] = 1;
    arr[5] = 1;
    ind = 200*200;
    construct_network(200, 200, 4);
    cout << endl;
    cout << last  << " " << best<< endl;
}
 */
/*
    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

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:196:9: warning: unused variable 'br' [-Wunused-variable]
  196 |     int br = add_and({a, tem});
      |         ^~
vision.cpp: In function 'void usaco_problem()':
vision.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp: In function 'void init()':
vision.cpp:43:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:45:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 10 ms 2140 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 4 ms 988 KB Output is correct
41 Correct 6 ms 912 KB Output is correct
42 Correct 11 ms 1880 KB Output is correct
43 Correct 4 ms 1240 KB Output is correct
44 Correct 15 ms 2140 KB Output is correct
45 Correct 15 ms 2772 KB Output is correct
46 Correct 16 ms 3048 KB Output is correct
47 Correct 33 ms 3272 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 12 ms 2008 KB Output is correct
3 Correct 21 ms 2104 KB Output is correct
4 Correct 27 ms 2452 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 8 ms 1592 KB Output is correct
7 Correct 12 ms 2260 KB Output is correct
8 Correct 13 ms 2408 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 8 ms 1468 KB Output is correct
11 Correct 11 ms 2008 KB Output is correct
12 Correct 13 ms 2008 KB Output is correct
13 Correct 14 ms 2396 KB Output is correct
14 Correct 14 ms 2364 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 7 ms 1496 KB Output is correct
17 Correct 11 ms 1872 KB Output is correct
18 Correct 13 ms 1880 KB Output is correct
19 Correct 13 ms 2260 KB Output is correct
20 Correct 18 ms 2440 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 5 ms 1116 KB Output is correct
5 Correct 6 ms 1372 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 8 ms 1628 KB Output is correct
10 Correct 10 ms 2000 KB Output is correct
11 Correct 12 ms 2396 KB Output is correct
12 Correct 15 ms 2392 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 15 ms 1752 KB Output is correct
15 Correct 16 ms 2392 KB Output is correct
16 Correct 13 ms 2520 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 18 ms 2076 KB Output is correct
19 Correct 14 ms 2516 KB Output is correct
20 Correct 8 ms 2008 KB Output is correct
21 Correct 30 ms 4364 KB Output is correct
22 Correct 45 ms 5840 KB Output is correct
23 Correct 53 ms 6348 KB Output is correct
24 Correct 12 ms 2004 KB Output is correct
25 Correct 28 ms 5176 KB Output is correct
26 Correct 63 ms 6236 KB Output is correct
27 Correct 15 ms 3280 KB Output is correct
28 Correct 38 ms 6620 KB Output is correct
29 Correct 51 ms 9160 KB Output is correct
30 Correct 65 ms 10444 KB Output is correct
31 Correct 62 ms 10952 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3284 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 8 ms 1832 KB Output is correct
8 Correct 8 ms 2008 KB Output is correct
9 Correct 14 ms 3176 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 3 ms 604 KB Output is correct
35 Correct 2 ms 600 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 10 ms 2140 KB Output is correct
39 Correct 3 ms 860 KB Output is correct
40 Correct 4 ms 988 KB Output is correct
41 Correct 6 ms 912 KB Output is correct
42 Correct 11 ms 1880 KB Output is correct
43 Correct 4 ms 1240 KB Output is correct
44 Correct 15 ms 2140 KB Output is correct
45 Correct 15 ms 2772 KB Output is correct
46 Correct 16 ms 3048 KB Output is correct
47 Correct 33 ms 3272 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 12 ms 2008 KB Output is correct
50 Correct 21 ms 2104 KB Output is correct
51 Correct 27 ms 2452 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 8 ms 1592 KB Output is correct
54 Correct 12 ms 2260 KB Output is correct
55 Correct 13 ms 2408 KB Output is correct
56 Correct 3 ms 860 KB Output is correct
57 Correct 8 ms 1468 KB Output is correct
58 Correct 11 ms 2008 KB Output is correct
59 Correct 13 ms 2008 KB Output is correct
60 Correct 14 ms 2396 KB Output is correct
61 Correct 14 ms 2364 KB Output is correct
62 Correct 2 ms 856 KB Output is correct
63 Correct 7 ms 1496 KB Output is correct
64 Correct 11 ms 1872 KB Output is correct
65 Correct 13 ms 1880 KB Output is correct
66 Correct 13 ms 2260 KB Output is correct
67 Correct 18 ms 2440 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 2 ms 860 KB Output is correct
73 Correct 5 ms 1116 KB Output is correct
74 Correct 6 ms 1372 KB Output is correct
75 Correct 8 ms 1372 KB Output is correct
76 Correct 7 ms 1372 KB Output is correct
77 Correct 6 ms 860 KB Output is correct
78 Correct 8 ms 1628 KB Output is correct
79 Correct 10 ms 2000 KB Output is correct
80 Correct 12 ms 2396 KB Output is correct
81 Correct 15 ms 2392 KB Output is correct
82 Correct 3 ms 860 KB Output is correct
83 Correct 15 ms 1752 KB Output is correct
84 Correct 16 ms 2392 KB Output is correct
85 Correct 13 ms 2520 KB Output is correct
86 Correct 2 ms 860 KB Output is correct
87 Correct 18 ms 2076 KB Output is correct
88 Correct 14 ms 2516 KB Output is correct
89 Correct 8 ms 2008 KB Output is correct
90 Correct 30 ms 4364 KB Output is correct
91 Correct 45 ms 5840 KB Output is correct
92 Correct 53 ms 6348 KB Output is correct
93 Correct 12 ms 2004 KB Output is correct
94 Correct 28 ms 5176 KB Output is correct
95 Correct 63 ms 6236 KB Output is correct
96 Correct 15 ms 3280 KB Output is correct
97 Correct 38 ms 6620 KB Output is correct
98 Correct 51 ms 9160 KB Output is correct
99 Correct 65 ms 10444 KB Output is correct
100 Correct 62 ms 10952 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 14 ms 3284 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 2 ms 860 KB Output is correct
106 Correct 3 ms 972 KB Output is correct
107 Correct 2 ms 860 KB Output is correct
108 Correct 2 ms 860 KB Output is correct
109 Correct 8 ms 1832 KB Output is correct
110 Correct 8 ms 2008 KB Output is correct
111 Correct 14 ms 3176 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 36 ms 6572 KB Output is correct
115 Correct 13 ms 2520 KB Output is correct
116 Correct 2 ms 856 KB Output is correct
117 Correct 35 ms 6124 KB Output is correct
118 Correct 17 ms 3284 KB Output is correct
119 Correct 50 ms 8908 KB Output is correct
120 Correct 51 ms 8904 KB Output is correct
121 Correct 51 ms 8904 KB Output is correct
122 Correct 50 ms 8908 KB Output is correct
123 Correct 14 ms 3280 KB Output is correct
124 Correct 41 ms 6600 KB Output is correct
125 Correct 65 ms 9044 KB Output is correct
126 Correct 51 ms 9156 KB Output is correct
127 Correct 59 ms 10432 KB Output is correct
128 Correct 63 ms 10956 KB Output is correct