oj.uz

답안 #401778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401778 2021-05-10T19:56:27 Z b00n0rp The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 327356 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 = 2000005;
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,t;
int a[MAXN],low[MAXN];
int rem[MAXN];
vi gg[2*MAXN];
 
int seg[4*MAXN];
int lazy[4*MAXN];

void update(int node,int l,int r,int x,int y,int val){
    if(lazy[node]){
        seg[node] += lazy[node];
        if(l != r){
            lazy[2*node] += lazy[node];
            lazy[2*node+1] += lazy[node];
        }
        lazy[node] = 0;
    }
    if(x > r or l > y) return;
    if(l >= x and r <= y){
        seg[node] += val;
        if(l != r){
            lazy[2*node] += val;
            lazy[2*node+1] += val;
        }
        return;
    }
    int mid = (l+r)/2;
    update(node*2,l,mid,x,y,val);
    update(node*2+1,mid+1,r,x,y,val);
    seg[node] = max(seg[2*node],seg[2*node+1]);
}
 
int query(int node,int l,int r){
    if(l == r) return l;
    int mid = (l+r)/2;
    if(seg[node*2] > seg[node*2+1]) return query(node*2,l,mid);
    return query(node*2+1,mid+1,r);
}
 
void solvethetestcase(){
    cin >> n >> d >> t;
    FOR(i,1,n+1){
        cin >> a[i];
        rem[i] = 0;
    }
    stack<int> st;
    int ans = 0;
    FOR(i,1,n+1){
        while(st.size() and a[st.top()]+i-st.top() > t) st.pop();
 
        if(a[i] <= t or st.empty()){
            low[i] = -1;
            if(a[i] <= t) ans++;
        }
        else{
            ans++;
            low[i] = st.top();
            int l = low[i]+n,r = i+n;
            while(l < r){
                if(l&1){
                    gg[l++].pb(i);
                }
                if(r&1){
                    gg[--r].pb(i);
                }
                l >>= 1;
                r >>= 1;
            }
            update(1,1,n,low[i],i-1,1);
        }
        if(a[i] < t){
            while(st.size() and a[st.top()]-st.top() >= a[i]-i) st.pop();
            st.push(i);
        }
    }
    REP(i,d){
        int ind = query(1,1,n);
        ind += n;
        vi bruh;
        while(ind){
            for(auto x:gg[ind]){
                if(!rem[x]){
                    rem[x] = 1;
                    ans--;
                    bruh.pb(x);
                }
            }
            gg[ind].clear();
            ind /= 2;
        }
        for(auto x:bruh){
            update(1,1,n,low[x],x-1,-1);
        }
    }
    cout << ans << "\n";
    // cout << runtime() << "\n";
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 94148 KB Output is correct
2 Correct 54 ms 94232 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 55 ms 94236 KB Output is correct
5 Correct 54 ms 94284 KB Output is correct
6 Correct 53 ms 94240 KB Output is correct
7 Correct 53 ms 94184 KB Output is correct
8 Correct 53 ms 94268 KB Output is correct
9 Correct 54 ms 94284 KB Output is correct
10 Correct 54 ms 94276 KB Output is correct
11 Correct 54 ms 94176 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 94192 KB Output is correct
2 Correct 232 ms 115648 KB Output is correct
3 Correct 196 ms 112672 KB Output is correct
4 Correct 269 ms 118488 KB Output is correct
5 Correct 295 ms 122692 KB Output is correct
6 Correct 262 ms 117168 KB Output is correct
7 Correct 787 ms 162464 KB Output is correct
8 Correct 278 ms 120424 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 94148 KB Output is correct
2 Correct 54 ms 94232 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 55 ms 94236 KB Output is correct
5 Correct 54 ms 94284 KB Output is correct
6 Correct 53 ms 94240 KB Output is correct
7 Correct 53 ms 94184 KB Output is correct
8 Correct 53 ms 94268 KB Output is correct
9 Correct 54 ms 94284 KB Output is correct
10 Correct 54 ms 94276 KB Output is correct
11 Correct 54 ms 94176 KB Output is correct
12 Correct 54 ms 94216 KB Output is correct
13 Correct 54 ms 94208 KB Output is correct
14 Correct 53 ms 94284 KB Output is correct
15 Correct 55 ms 94220 KB Output is correct
16 Correct 54 ms 94376 KB Output is correct
17 Correct 53 ms 94244 KB Output is correct
18 Correct 54 ms 94208 KB Output is correct
19 Correct 54 ms 94276 KB Output is correct
20 Correct 53 ms 94212 KB Output is correct
21 Correct 54 ms 94180 KB Output is correct
22 Correct 53 ms 94276 KB Output is correct
23 Correct 55 ms 94448 KB Output is correct
24 Correct 55 ms 94444 KB Output is correct
25 Correct 57 ms 94532 KB Output is correct
26 Correct 54 ms 94404 KB Output is correct
27 Correct 56 ms 94528 KB Output is correct
28 Correct 53 ms 94412 KB Output is correct
29 Correct 56 ms 94356 KB Output is correct
30 Correct 54 ms 94404 KB Output is correct
31 Correct 55 ms 94372 KB Output is correct
32 Correct 55 ms 94336 KB Output is correct
33 Correct 54 ms 94416 KB Output is correct
34 Correct 57 ms 94476 KB Output is correct
35 Correct 55 ms 94404 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 94184 KB Output is correct
2 Correct 84 ms 98672 KB Output is correct
3 Correct 79 ms 98244 KB Output is correct
4 Correct 116 ms 101232 KB Output is correct
5 Correct 124 ms 102088 KB Output is correct
6 Correct 123 ms 102220 KB Output is correct
7 Correct 81 ms 98316 KB Output is correct
8 Correct 80 ms 97824 KB Output is correct
9 Correct 146 ms 104108 KB Output is correct
10 Correct 73 ms 97188 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 94148 KB Output is correct
2 Correct 54 ms 94232 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 55 ms 94236 KB Output is correct
5 Correct 54 ms 94284 KB Output is correct
6 Correct 53 ms 94240 KB Output is correct
7 Correct 53 ms 94184 KB Output is correct
8 Correct 53 ms 94268 KB Output is correct
9 Correct 54 ms 94284 KB Output is correct
10 Correct 54 ms 94276 KB Output is correct
11 Correct 54 ms 94176 KB Output is correct
12 Correct 54 ms 94216 KB Output is correct
13 Correct 54 ms 94208 KB Output is correct
14 Correct 53 ms 94284 KB Output is correct
15 Correct 55 ms 94220 KB Output is correct
16 Correct 54 ms 94376 KB Output is correct
17 Correct 53 ms 94244 KB Output is correct
18 Correct 54 ms 94208 KB Output is correct
19 Correct 54 ms 94276 KB Output is correct
20 Correct 53 ms 94212 KB Output is correct
21 Correct 54 ms 94180 KB Output is correct
22 Correct 53 ms 94276 KB Output is correct
23 Correct 55 ms 94448 KB Output is correct
24 Correct 55 ms 94444 KB Output is correct
25 Correct 57 ms 94532 KB Output is correct
26 Correct 54 ms 94404 KB Output is correct
27 Correct 56 ms 94528 KB Output is correct
28 Correct 53 ms 94412 KB Output is correct
29 Correct 56 ms 94356 KB Output is correct
30 Correct 54 ms 94404 KB Output is correct
31 Correct 55 ms 94372 KB Output is correct
32 Correct 55 ms 94336 KB Output is correct
33 Correct 54 ms 94416 KB Output is correct
34 Correct 57 ms 94476 KB Output is correct
35 Correct 55 ms 94404 KB Output is correct
36 Correct 54 ms 94184 KB Output is correct
37 Correct 84 ms 98672 KB Output is correct
38 Correct 79 ms 98244 KB Output is correct
39 Correct 116 ms 101232 KB Output is correct
40 Correct 124 ms 102088 KB Output is correct
41 Correct 123 ms 102220 KB Output is correct
42 Correct 81 ms 98316 KB Output is correct
43 Correct 80 ms 97824 KB Output is correct
44 Correct 146 ms 104108 KB Output is correct
45 Correct 73 ms 97188 KB Output is correct
46 Correct 53 ms 94148 KB Output is correct
47 Correct 54 ms 94284 KB Output is correct
48 Correct 55 ms 94300 KB Output is correct
49 Correct 54 ms 94412 KB Output is correct
50 Correct 58 ms 94188 KB Output is correct
51 Correct 54 ms 94236 KB Output is correct
52 Correct 53 ms 94192 KB Output is correct
53 Correct 53 ms 94184 KB Output is correct
54 Correct 54 ms 94288 KB Output is correct
55 Correct 54 ms 94260 KB Output is correct
56 Correct 55 ms 94276 KB Output is correct
57 Correct 56 ms 94384 KB Output is correct
58 Correct 55 ms 94376 KB Output is correct
59 Correct 55 ms 94404 KB Output is correct
60 Correct 55 ms 94332 KB Output is correct
61 Correct 57 ms 94404 KB Output is correct
62 Correct 55 ms 94340 KB Output is correct
63 Correct 55 ms 94532 KB Output is correct
64 Correct 55 ms 94400 KB Output is correct
65 Correct 56 ms 94404 KB Output is correct
66 Correct 57 ms 94412 KB Output is correct
67 Correct 55 ms 94324 KB Output is correct
68 Correct 56 ms 94428 KB Output is correct
69 Correct 56 ms 94428 KB Output is correct
70 Correct 53 ms 94192 KB Output is correct
71 Correct 82 ms 98608 KB Output is correct
72 Correct 79 ms 98288 KB Output is correct
73 Correct 116 ms 101192 KB Output is correct
74 Correct 125 ms 102084 KB Output is correct
75 Correct 128 ms 102340 KB Output is correct
76 Correct 81 ms 98296 KB Output is correct
77 Correct 81 ms 97860 KB Output is correct
78 Correct 146 ms 104128 KB Output is correct
79 Correct 75 ms 97164 KB Output is correct
80 Correct 87 ms 98380 KB Output is correct
81 Correct 98 ms 98588 KB Output is correct
82 Correct 92 ms 98280 KB Output is correct
83 Correct 119 ms 100940 KB Output is correct
84 Correct 100 ms 99028 KB Output is correct
85 Correct 131 ms 102540 KB Output is correct
86 Correct 103 ms 99396 KB Output is correct
87 Correct 87 ms 97732 KB Output is correct
88 Correct 130 ms 102668 KB Output is correct
89 Correct 117 ms 104084 KB Output is correct
90 Correct 107 ms 101540 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 94148 KB Output is correct
2 Correct 54 ms 94232 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 55 ms 94236 KB Output is correct
5 Correct 54 ms 94284 KB Output is correct
6 Correct 53 ms 94240 KB Output is correct
7 Correct 53 ms 94184 KB Output is correct
8 Correct 53 ms 94268 KB Output is correct
9 Correct 54 ms 94284 KB Output is correct
10 Correct 54 ms 94276 KB Output is correct
11 Correct 54 ms 94176 KB Output is correct
12 Correct 56 ms 94192 KB Output is correct
13 Correct 232 ms 115648 KB Output is correct
14 Correct 196 ms 112672 KB Output is correct
15 Correct 269 ms 118488 KB Output is correct
16 Correct 295 ms 122692 KB Output is correct
17 Correct 262 ms 117168 KB Output is correct
18 Correct 787 ms 162464 KB Output is correct
19 Correct 278 ms 120424 KB Output is correct
20 Correct 54 ms 94216 KB Output is correct
21 Correct 54 ms 94208 KB Output is correct
22 Correct 53 ms 94284 KB Output is correct
23 Correct 55 ms 94220 KB Output is correct
24 Correct 54 ms 94376 KB Output is correct
25 Correct 53 ms 94244 KB Output is correct
26 Correct 54 ms 94208 KB Output is correct
27 Correct 54 ms 94276 KB Output is correct
28 Correct 53 ms 94212 KB Output is correct
29 Correct 54 ms 94180 KB Output is correct
30 Correct 53 ms 94276 KB Output is correct
31 Correct 55 ms 94448 KB Output is correct
32 Correct 55 ms 94444 KB Output is correct
33 Correct 57 ms 94532 KB Output is correct
34 Correct 54 ms 94404 KB Output is correct
35 Correct 56 ms 94528 KB Output is correct
36 Correct 53 ms 94412 KB Output is correct
37 Correct 56 ms 94356 KB Output is correct
38 Correct 54 ms 94404 KB Output is correct
39 Correct 55 ms 94372 KB Output is correct
40 Correct 55 ms 94336 KB Output is correct
41 Correct 54 ms 94416 KB Output is correct
42 Correct 57 ms 94476 KB Output is correct
43 Correct 55 ms 94404 KB Output is correct
44 Correct 54 ms 94184 KB Output is correct
45 Correct 84 ms 98672 KB Output is correct
46 Correct 79 ms 98244 KB Output is correct
47 Correct 116 ms 101232 KB Output is correct
48 Correct 124 ms 102088 KB Output is correct
49 Correct 123 ms 102220 KB Output is correct
50 Correct 81 ms 98316 KB Output is correct
51 Correct 80 ms 97824 KB Output is correct
52 Correct 146 ms 104108 KB Output is correct
53 Correct 73 ms 97188 KB Output is correct
54 Correct 53 ms 94148 KB Output is correct
55 Correct 54 ms 94284 KB Output is correct
56 Correct 55 ms 94300 KB Output is correct
57 Correct 54 ms 94412 KB Output is correct
58 Correct 58 ms 94188 KB Output is correct
59 Correct 54 ms 94236 KB Output is correct
60 Correct 53 ms 94192 KB Output is correct
61 Correct 53 ms 94184 KB Output is correct
62 Correct 54 ms 94288 KB Output is correct
63 Correct 54 ms 94260 KB Output is correct
64 Correct 55 ms 94276 KB Output is correct
65 Correct 56 ms 94384 KB Output is correct
66 Correct 55 ms 94376 KB Output is correct
67 Correct 55 ms 94404 KB Output is correct
68 Correct 55 ms 94332 KB Output is correct
69 Correct 57 ms 94404 KB Output is correct
70 Correct 55 ms 94340 KB Output is correct
71 Correct 55 ms 94532 KB Output is correct
72 Correct 55 ms 94400 KB Output is correct
73 Correct 56 ms 94404 KB Output is correct
74 Correct 57 ms 94412 KB Output is correct
75 Correct 55 ms 94324 KB Output is correct
76 Correct 56 ms 94428 KB Output is correct
77 Correct 56 ms 94428 KB Output is correct
78 Correct 53 ms 94192 KB Output is correct
79 Correct 82 ms 98608 KB Output is correct
80 Correct 79 ms 98288 KB Output is correct
81 Correct 116 ms 101192 KB Output is correct
82 Correct 125 ms 102084 KB Output is correct
83 Correct 128 ms 102340 KB Output is correct
84 Correct 81 ms 98296 KB Output is correct
85 Correct 81 ms 97860 KB Output is correct
86 Correct 146 ms 104128 KB Output is correct
87 Correct 75 ms 97164 KB Output is correct
88 Correct 87 ms 98380 KB Output is correct
89 Correct 98 ms 98588 KB Output is correct
90 Correct 92 ms 98280 KB Output is correct
91 Correct 119 ms 100940 KB Output is correct
92 Correct 100 ms 99028 KB Output is correct
93 Correct 131 ms 102540 KB Output is correct
94 Correct 103 ms 99396 KB Output is correct
95 Correct 87 ms 97732 KB Output is correct
96 Correct 130 ms 102668 KB Output is correct
97 Correct 117 ms 104084 KB Output is correct
98 Correct 107 ms 101540 KB Output is correct
99 Correct 55 ms 94148 KB Output is correct
100 Correct 54 ms 94284 KB Output is correct
101 Correct 56 ms 94240 KB Output is correct
102 Correct 55 ms 94216 KB Output is correct
103 Correct 55 ms 94204 KB Output is correct
104 Correct 54 ms 94288 KB Output is correct
105 Correct 54 ms 94220 KB Output is correct
106 Correct 54 ms 94240 KB Output is correct
107 Correct 54 ms 94276 KB Output is correct
108 Correct 52 ms 94284 KB Output is correct
109 Correct 53 ms 94260 KB Output is correct
110 Correct 53 ms 94368 KB Output is correct
111 Correct 231 ms 115652 KB Output is correct
112 Correct 197 ms 112704 KB Output is correct
113 Correct 263 ms 118536 KB Output is correct
114 Correct 296 ms 122684 KB Output is correct
115 Correct 257 ms 117028 KB Output is correct
116 Correct 795 ms 162504 KB Output is correct
117 Correct 277 ms 120240 KB Output is correct
118 Correct 54 ms 94392 KB Output is correct
119 Correct 56 ms 94404 KB Output is correct
120 Correct 55 ms 94456 KB Output is correct
121 Correct 55 ms 94412 KB Output is correct
122 Correct 57 ms 94340 KB Output is correct
123 Correct 55 ms 94404 KB Output is correct
124 Correct 54 ms 94424 KB Output is correct
125 Correct 55 ms 94324 KB Output is correct
126 Correct 55 ms 94344 KB Output is correct
127 Correct 56 ms 94404 KB Output is correct
128 Correct 54 ms 94312 KB Output is correct
129 Correct 56 ms 94468 KB Output is correct
130 Correct 55 ms 94484 KB Output is correct
131 Correct 54 ms 94264 KB Output is correct
132 Correct 84 ms 98628 KB Output is correct
133 Correct 78 ms 98296 KB Output is correct
134 Correct 118 ms 101324 KB Output is correct
135 Correct 126 ms 102084 KB Output is correct
136 Correct 127 ms 102208 KB Output is correct
137 Correct 79 ms 98244 KB Output is correct
138 Correct 80 ms 97840 KB Output is correct
139 Correct 146 ms 104136 KB Output is correct
140 Correct 73 ms 97224 KB Output is correct
141 Correct 85 ms 98244 KB Output is correct
142 Correct 96 ms 98628 KB Output is correct
143 Correct 91 ms 98268 KB Output is correct
144 Correct 115 ms 100932 KB Output is correct
145 Correct 100 ms 98996 KB Output is correct
146 Correct 129 ms 102376 KB Output is correct
147 Correct 103 ms 99396 KB Output is correct
148 Correct 87 ms 97732 KB Output is correct
149 Correct 130 ms 102660 KB Output is correct
150 Correct 117 ms 103956 KB Output is correct
151 Correct 108 ms 101488 KB Output is correct
152 Correct 805 ms 180076 KB Output is correct
153 Correct 849 ms 183568 KB Output is correct
154 Correct 768 ms 177348 KB Output is correct
155 Correct 1811 ms 240316 KB Output is correct
156 Correct 1442 ms 208256 KB Output is correct
157 Correct 637 ms 158240 KB Output is correct
158 Correct 1056 ms 192480 KB Output is correct
159 Execution timed out 2121 ms 327356 KB Time limit exceeded
160 Halted 0 ms 0 KB -