oj.uz

Submission #420305

# Submission time Handle Problem Language Result Execution time Memory
420305 2021-06-08T09:27:09 Z b00n0rp Financial Report (JOI21_financial) C++17
100 / 100
 1477 ms 137192 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 300005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,d;
pii temp[MAXN];
int a[MAXN];
int rgt[MAXN];
int dsupar[MAXN];
int dp[MAXN];

int dsufind(int u){
    if(u == dsupar[u]) return u;
    return dsupar[u] = dsufind(dsupar[u]);
}

void dsumerge(int u,int v){
    u = dsufind(u);
    v = dsufind(v);
    if(u != v) dsupar[u] = v;
}

PQ(pii) seg[2*MAXN];

void upd(int ind,pii val){
    ind += n;
    while(ind){
        seg[ind].push(val);
        ind /= 2;
    }
}

int query(int l,int r,int x){
    int res = -1;
    l += n;
    r += n;
    while(l < r){
        if(l%2){
            while(seg[l].top().S < x) seg[l].pop();
            remax(res,seg[l].top().F);
            l++;
        }
        if(r%2){
            --r;
            while(seg[r].top().S < x) seg[r].pop();
            remax(res,seg[r].top().F);
        }
        l /= 2;
        r /= 2;
    }
    return res;
}
 
void solvethetestcase(){
    cin >> n >> d;
    FOR(i,1,n+1){
        rgt[i] = -1;
        cin >> temp[i].F;
        temp[i].S = -i;
        dsupar[i] = i;
    }
    REP(i,2*n) seg[i].push({-1,n});
    sort(temp+1,temp+n+1);
    set<int> st;
    FOR(i,1,n+1){
        int ind = -temp[i].S;
        a[ind] = i-1;
        auto j = st.lower_bound(ind);
        if(j != st.end() and (*j) <= ind+d){
            dsumerge(ind,(*j));
        }
        if(j != st.begin()){
            j--;
            if((*j)+d >= ind){
                dsumerge((*j),ind);
            }
        }
        st.insert(ind);
        rgt[ind] = dsufind(ind);
    }
    FOR(i,1,n+1){
        dp[i] = 1;
        remax(dp[i],query(0,a[i],i)+1);
        upd(a[i],{dp[i],rgt[i]+d});
    }
    int ans = 1;
    FOR(i,1,n+1){
        if(rgt[i]+d >= n) remax(ans,dp[i]);
    }
    cout << ans << "\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19020 KB Output is correct
2 Correct 13 ms 19016 KB Output is correct
3 Correct 11 ms 19132 KB Output is correct
4 Correct 13 ms 19128 KB Output is correct
5 Correct 12 ms 19020 KB Output is correct
6 Correct 13 ms 19104 KB Output is correct
7 Correct 11 ms 19020 KB Output is correct
8 Correct 13 ms 19136 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19020 KB Output is correct
11 Correct 13 ms 19016 KB Output is correct
12 Correct 12 ms 19020 KB Output is correct
13 Correct 11 ms 19020 KB Output is correct
14 Correct 11 ms 19132 KB Output is correct
15 Correct 12 ms 19020 KB Output is correct
16 Correct 11 ms 19020 KB Output is correct
17 Correct 11 ms 19020 KB Output is correct
18 Correct 11 ms 19020 KB Output is correct
19 Correct 11 ms 19080 KB Output is correct
20 Correct 11 ms 19020 KB Output is correct
21 Correct 13 ms 19072 KB Output is correct
22 Correct 11 ms 19104 KB Output is correct
23 Correct 13 ms 19136 KB Output is correct
24 Correct 11 ms 19020 KB Output is correct
25 Correct 12 ms 19020 KB Output is correct
26 Correct 11 ms 19052 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19020 KB Output is correct
2 Correct 13 ms 19016 KB Output is correct
3 Correct 11 ms 19132 KB Output is correct
4 Correct 13 ms 19128 KB Output is correct
5 Correct 12 ms 19020 KB Output is correct
6 Correct 13 ms 19104 KB Output is correct
7 Correct 11 ms 19020 KB Output is correct
8 Correct 13 ms 19136 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19020 KB Output is correct
11 Correct 13 ms 19016 KB Output is correct
12 Correct 12 ms 19020 KB Output is correct
13 Correct 11 ms 19020 KB Output is correct
14 Correct 11 ms 19132 KB Output is correct
15 Correct 12 ms 19020 KB Output is correct
16 Correct 11 ms 19020 KB Output is correct
17 Correct 11 ms 19020 KB Output is correct
18 Correct 11 ms 19020 KB Output is correct
19 Correct 11 ms 19080 KB Output is correct
20 Correct 11 ms 19020 KB Output is correct
21 Correct 13 ms 19072 KB Output is correct
22 Correct 11 ms 19104 KB Output is correct
23 Correct 13 ms 19136 KB Output is correct
24 Correct 11 ms 19020 KB Output is correct
25 Correct 12 ms 19020 KB Output is correct
26 Correct 11 ms 19052 KB Output is correct
27 Correct 12 ms 19148 KB Output is correct
28 Correct 12 ms 19248 KB Output is correct
29 Correct 13 ms 19148 KB Output is correct
30 Correct 12 ms 19240 KB Output is correct
31 Correct 11 ms 19148 KB Output is correct
32 Correct 13 ms 19204 KB Output is correct
33 Correct 11 ms 19148 KB Output is correct
34 Correct 11 ms 19184 KB Output is correct
35 Correct 12 ms 19148 KB Output is correct
36 Correct 14 ms 19260 KB Output is correct
37 Correct 11 ms 19228 KB Output is correct
38 Correct 12 ms 19164 KB Output is correct
39 Correct 11 ms 19148 KB Output is correct
40 Correct 11 ms 19172 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19020 KB Output is correct
2 Correct 13 ms 19016 KB Output is correct
3 Correct 11 ms 19132 KB Output is correct
4 Correct 13 ms 19128 KB Output is correct
5 Correct 12 ms 19020 KB Output is correct
6 Correct 13 ms 19104 KB Output is correct
7 Correct 11 ms 19020 KB Output is correct
8 Correct 13 ms 19136 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19020 KB Output is correct
11 Correct 13 ms 19016 KB Output is correct
12 Correct 12 ms 19020 KB Output is correct
13 Correct 11 ms 19020 KB Output is correct
14 Correct 11 ms 19132 KB Output is correct
15 Correct 12 ms 19020 KB Output is correct
16 Correct 11 ms 19020 KB Output is correct
17 Correct 11 ms 19020 KB Output is correct
18 Correct 11 ms 19020 KB Output is correct
19 Correct 11 ms 19080 KB Output is correct
20 Correct 11 ms 19020 KB Output is correct
21 Correct 13 ms 19072 KB Output is correct
22 Correct 11 ms 19104 KB Output is correct
23 Correct 13 ms 19136 KB Output is correct
24 Correct 11 ms 19020 KB Output is correct
25 Correct 12 ms 19020 KB Output is correct
26 Correct 11 ms 19052 KB Output is correct
27 Correct 12 ms 19148 KB Output is correct
28 Correct 12 ms 19248 KB Output is correct
29 Correct 13 ms 19148 KB Output is correct
30 Correct 12 ms 19240 KB Output is correct
31 Correct 11 ms 19148 KB Output is correct
32 Correct 13 ms 19204 KB Output is correct
33 Correct 11 ms 19148 KB Output is correct
34 Correct 11 ms 19184 KB Output is correct
35 Correct 12 ms 19148 KB Output is correct
36 Correct 14 ms 19260 KB Output is correct
37 Correct 11 ms 19228 KB Output is correct
38 Correct 12 ms 19164 KB Output is correct
39 Correct 11 ms 19148 KB Output is correct
40 Correct 11 ms 19172 KB Output is correct
41 Correct 22 ms 20888 KB Output is correct
42 Correct 22 ms 20892 KB Output is correct
43 Correct 20 ms 21304 KB Output is correct
44 Correct 21 ms 20928 KB Output is correct
45 Correct 21 ms 21256 KB Output is correct
46 Correct 26 ms 21324 KB Output is correct
47 Correct 22 ms 21012 KB Output is correct
48 Correct 27 ms 21016 KB Output is correct
49 Correct 28 ms 21096 KB Output is correct
50 Correct 23 ms 21224 KB Output is correct
51 Correct 22 ms 20936 KB Output is correct
52 Correct 27 ms 20812 KB Output is correct
53 Correct 26 ms 21236 KB Output is correct
54 Correct 22 ms 21348 KB Output is correct
55 Correct 23 ms 21372 KB Output is correct
56 Correct 22 ms 21308 KB Output is correct
57 Correct 21 ms 21324 KB Output is correct
58 Correct 22 ms 21428 KB Output is correct
59 Correct 22 ms 21336 KB Output is correct
60 Correct 23 ms 21324 KB Output is correct
61 Correct 21 ms 21332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 130568 KB Output is correct
2 Correct 671 ms 128800 KB Output is correct
3 Correct 905 ms 124012 KB Output is correct
4 Correct 1322 ms 102412 KB Output is correct
5 Correct 1081 ms 112368 KB Output is correct
6 Correct 1401 ms 103388 KB Output is correct
7 Correct 662 ms 129932 KB Output is correct
8 Correct 460 ms 130292 KB Output is correct
9 Correct 686 ms 128072 KB Output is correct
10 Correct 506 ms 125532 KB Output is correct
11 Correct 905 ms 103208 KB Output is correct
12 Correct 971 ms 101912 KB Output is correct
13 Correct 1071 ms 101452 KB Output is correct
14 Correct 1241 ms 102368 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 130616 KB Output is correct
2 Correct 828 ms 137192 KB Output is correct
3 Correct 1265 ms 136476 KB Output is correct
4 Correct 1384 ms 134172 KB Output is correct
5 Correct 1102 ms 134580 KB Output is correct
6 Correct 1477 ms 134132 KB Output is correct
7 Correct 592 ms 130716 KB Output is correct
8 Correct 426 ms 130608 KB Output is correct
9 Correct 623 ms 127592 KB Output is correct
10 Correct 856 ms 129180 KB Output is correct
11 Correct 1331 ms 133852 KB Output is correct
12 Correct 1120 ms 131360 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19020 KB Output is correct
2 Correct 13 ms 19016 KB Output is correct
3 Correct 11 ms 19132 KB Output is correct
4 Correct 13 ms 19128 KB Output is correct
5 Correct 12 ms 19020 KB Output is correct
6 Correct 13 ms 19104 KB Output is correct
7 Correct 11 ms 19020 KB Output is correct
8 Correct 13 ms 19136 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19020 KB Output is correct
11 Correct 13 ms 19016 KB Output is correct
12 Correct 12 ms 19020 KB Output is correct
13 Correct 11 ms 19020 KB Output is correct
14 Correct 11 ms 19132 KB Output is correct
15 Correct 12 ms 19020 KB Output is correct
16 Correct 11 ms 19020 KB Output is correct
17 Correct 11 ms 19020 KB Output is correct
18 Correct 11 ms 19020 KB Output is correct
19 Correct 11 ms 19080 KB Output is correct
20 Correct 11 ms 19020 KB Output is correct
21 Correct 13 ms 19072 KB Output is correct
22 Correct 11 ms 19104 KB Output is correct
23 Correct 13 ms 19136 KB Output is correct
24 Correct 11 ms 19020 KB Output is correct
25 Correct 12 ms 19020 KB Output is correct
26 Correct 11 ms 19052 KB Output is correct
27 Correct 12 ms 19148 KB Output is correct
28 Correct 12 ms 19248 KB Output is correct
29 Correct 13 ms 19148 KB Output is correct
30 Correct 12 ms 19240 KB Output is correct
31 Correct 11 ms 19148 KB Output is correct
32 Correct 13 ms 19204 KB Output is correct
33 Correct 11 ms 19148 KB Output is correct
34 Correct 11 ms 19184 KB Output is correct
35 Correct 12 ms 19148 KB Output is correct
36 Correct 14 ms 19260 KB Output is correct
37 Correct 11 ms 19228 KB Output is correct
38 Correct 12 ms 19164 KB Output is correct
39 Correct 11 ms 19148 KB Output is correct
40 Correct 11 ms 19172 KB Output is correct
41 Correct 22 ms 20888 KB Output is correct
42 Correct 22 ms 20892 KB Output is correct
43 Correct 20 ms 21304 KB Output is correct
44 Correct 21 ms 20928 KB Output is correct
45 Correct 21 ms 21256 KB Output is correct
46 Correct 26 ms 21324 KB Output is correct
47 Correct 22 ms 21012 KB Output is correct
48 Correct 27 ms 21016 KB Output is correct
49 Correct 28 ms 21096 KB Output is correct
50 Correct 23 ms 21224 KB Output is correct
51 Correct 22 ms 20936 KB Output is correct
52 Correct 27 ms 20812 KB Output is correct
53 Correct 26 ms 21236 KB Output is correct
54 Correct 22 ms 21348 KB Output is correct
55 Correct 23 ms 21372 KB Output is correct
56 Correct 22 ms 21308 KB Output is correct
57 Correct 21 ms 21324 KB Output is correct
58 Correct 22 ms 21428 KB Output is correct
59 Correct 22 ms 21336 KB Output is correct
60 Correct 23 ms 21324 KB Output is correct
61 Correct 21 ms 21332 KB Output is correct
62 Correct 427 ms 130568 KB Output is correct
63 Correct 671 ms 128800 KB Output is correct
64 Correct 905 ms 124012 KB Output is correct
65 Correct 1322 ms 102412 KB Output is correct
66 Correct 1081 ms 112368 KB Output is correct
67 Correct 1401 ms 103388 KB Output is correct
68 Correct 662 ms 129932 KB Output is correct
69 Correct 460 ms 130292 KB Output is correct
70 Correct 686 ms 128072 KB Output is correct
71 Correct 506 ms 125532 KB Output is correct
72 Correct 905 ms 103208 KB Output is correct
73 Correct 971 ms 101912 KB Output is correct
74 Correct 1071 ms 101452 KB Output is correct
75 Correct 1241 ms 102368 KB Output is correct
76 Correct 437 ms 130616 KB Output is correct
77 Correct 828 ms 137192 KB Output is correct
78 Correct 1265 ms 136476 KB Output is correct
79 Correct 1384 ms 134172 KB Output is correct
80 Correct 1102 ms 134580 KB Output is correct
81 Correct 1477 ms 134132 KB Output is correct
82 Correct 592 ms 130716 KB Output is correct
83 Correct 426 ms 130608 KB Output is correct
84 Correct 623 ms 127592 KB Output is correct
85 Correct 856 ms 129180 KB Output is correct
86 Correct 1331 ms 133852 KB Output is correct
87 Correct 1120 ms 131360 KB Output is correct
88 Correct 1179 ms 115748 KB Output is correct
89 Correct 1362 ms 103312 KB Output is correct
90 Correct 1424 ms 112616 KB Output is correct
91 Correct 1359 ms 131604 KB Output is correct
92 Correct 724 ms 136384 KB Output is correct
93 Correct 1275 ms 136372 KB Output is correct
94 Correct 1339 ms 134404 KB Output is correct
95 Correct 1147 ms 107808 KB Output is correct
96 Correct 1269 ms 114748 KB Output is correct
97 Correct 1384 ms 115452 KB Output is correct
98 Correct 1343 ms 131404 KB Output is correct
99 Correct 1455 ms 134112 KB Output is correct
100 Correct 1454 ms 134020 KB Output is correct
101 Correct 770 ms 126232 KB Output is correct
102 Correct 749 ms 126992 KB Output is correct
103 Correct 762 ms 128420 KB Output is correct
104 Correct 798 ms 129308 KB Output is correct
105 Correct 996 ms 129972 KB Output is correct
106 Correct 627 ms 120516 KB Output is correct
107 Correct 887 ms 125268 KB Output is correct
108 Correct 1223 ms 132624 KB Output is correct
109 Correct 1012 ms 102900 KB Output is correct
110 Correct 1373 ms 124076 KB Output is correct
111 Correct 1317 ms 129960 KB Output is correct
112 Correct 971 ms 126652 KB Output is correct
113 Correct 1366 ms 134012 KB Output is correct
114 Correct 1329 ms 133684 KB Output is correct
115 Correct 461 ms 130608 KB Output is correct
116 Correct 473 ms 130636 KB Output is correct
117 Correct 539 ms 131132 KB Output is correct
118 Correct 546 ms 130996 KB Output is correct
119 Correct 840 ms 134900 KB Output is correct
120 Correct 797 ms 134932 KB Output is correct