oj.uz

Submission #1014353

# Submission time Handle Problem Language Result Execution time Memory
1014353 2024-07-04T17:50:49 Z hengliao Flooding Wall (BOI24_wall) C++17
58 / 100
 5000 ms 253952 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("popcnt")
#include<bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;
 
#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;
 
const ll mod=1e9+7;
const ll mxN=5e5+5;
 
struct segtree{
    ll tree[8*mxN];
    ll lazy[8*mxN];
    ll treelen;
 
    void init(ll siz){
        treelen=siz+1;
        while(__builtin_popcount(treelen)!=1){
            treelen++;
        }
        memset(tree, 0, sizeof(tree));
        for(ll i=0;i<2*treelen;i++) lazy[i]=1;
    }
 
    void push(ll idx, ll low, ll high){
        if(low!=high){
            lazy[2*idx]*=lazy[idx];
            lazy[2*idx]%=mod;
            lazy[2*idx+1]*=lazy[idx];
            lazy[2*idx+1]%=mod;
        }
    }
 
    void check(ll idx, ll low, ll high){
        if(lazy[idx]==1) return;
        tree[idx]*=lazy[idx];
        tree[idx]%=mod;
        push(idx, low, high);
        lazy[idx]=1;
    }
 
    void update1(ll idx, ll low, ll high, ll qlow, ll qhigh, ll val){
        //check(idx, low, high);
        if(low>=qlow && high<=qhigh){
            lazy[idx]*=val;
            lazy[idx]%=mod;
            check(idx, low, high);
            return;
        }
        if(low>qhigh || high<qlow){
            return;
        }
        ll mid=(low+high)/2;
        check(2*idx, low, mid);
        if(qlow<=mid) update1(2*idx, low, mid, qlow, qhigh, val);
        check(2*idx+1, mid+1, high);
        if(qhigh>=mid+1) update1(2*idx+1, mid+1, high, qlow, qhigh, val);
        tree[idx]=tree[2*idx]+tree[2*idx+1];
    }
 
    ll getsum1(ll idx, ll low, ll high, ll qlow, ll qhigh){
        check(idx, low, high);
        if(low>=qlow && high<=qhigh){
            return tree[idx];
        }
        if(low>qhigh || high<qlow){
            return 0LL;
        }
        ll mid=(low+high)/2;
        ll re=0;
        if(qlow<=mid) re+=getsum1(2*idx, low, mid, qlow, qhigh);
        if(qhigh>=mid+1) re+=getsum1(2*idx+1, mid+1, high, qlow, qhigh);
        return re;
    }
 
    void setto1(ll idx, ll low, ll high, ll qlow, ll qhigh, ll val){
        //check(idx, low, high);
        if(low>=qlow && high<=qhigh){
            tree[idx]=val;
            tree[idx]%=mod;
            //check(idx, low, high);
            return;
        }
        if(low>qhigh || high<qlow){
            return;
        }
        ll mid=(low+high)/2;
        check(2*idx, low, mid);
        if(qlow<=mid) setto1(2*idx, low, mid, qlow, qhigh, val);
        check(2*idx+1, mid+1, high);
        if(qhigh>=mid+1) setto1(2*idx+1, mid+1, high, qlow, qhigh, val);
        tree[idx]=tree[2*idx]+tree[2*idx+1];
    }
 
    void update(ll qlow, ll qhigh, ll val){
        update1(1, 0, treelen-1, qlow, qhigh, val);
    }
 
    ll getsum(ll qlow, ll qhigh){
        return getsum1(1, 0, treelen-1, qlow, qhigh);
    }
 
    void setto(ll idx, ll val){
        setto1(1, 0, treelen-1, idx, idx, val);
    }
};
 
ll pw(ll a, ll b){
    ll re=1;
    a%=mod;
    for(ll i=0;i<32;i++){
        if(b&(1LL<<i)){
            re*=a;
            re%=mod;
        }
        a*=a;
        a%=mod;
    }
    return re;
}
 
ll inv(ll a){
    return pw(a, mod-2);
}
 
ll seg[mxN];
ll lef[mxN][2];
ll rig[mxN][2];
ll pw2[mxN];
bool good[mxN][2];
ll n;
ll a[mxN][2];
vector<pair<ll, pll>> v;
segtree SEG, SEG2, SEG3, SEG4;
ll inv2;
ll val, id, id2, pre, cur;
 
bool compare(pair<ll, pll> &a, pair<ll, pll> &b){
    if(a.F!=b.F){
        return a.F>b.F;
    }
    return a.S.F<b.S.F;
}
 
bool compare2(pair<ll, pll> &a, pair<ll, pll> &b){
    if(a.F!=b.F){
        return a.F>b.F;
    }
    return a.S.F>b.S.F;
}
 
void solve(){
    memset(good, 0, sizeof(good));
	cin>>n;
    SEG.init(2*n+10);
    SEG2.init(2*n+10);
    SEG3.init(n+10);
    for(ll i=0;i<n;i++){
        cin>>a[i][0];
    }
    for(ll i=0;i<n;i++){
        cin>>a[i][1];
    }
    for(ll i=0;i<n;i++){
        v.pb({a[i][0], {i, 0}});
        v.pb({a[i][1], {i, 1}});
        seg[i]=2;
    }
    ll pre=2;
    SEG3.setto(n, 1);
    for(ll i=n-1;i>=0;i--){
        SEG3.setto(i, pre);
        pre*=2;
        pre%=mod;
    }
    sort(v.begin(), v.end(), compare);
    ll ans=0;
    for(auto &it:v){
        val=it.F;
        id=it.S.F;
        id2=it.S.S;
        pre=1;
        cur=0;
        if(id>0){
            cur=id*SEG2.getsum(0, 2*id-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            cur-=SEG.getsum(0, 2*id-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            if(seg[id]==2){
                cur*=inv2;
                cur%=mod;
            }
        }
        ans+=cur*val;
        ans%=mod;
        ans+=(((val*((SEG3.getsum(0, 0)*inv(SEG3.getsum(id, id)))%mod)))%mod)
        *SEG3.getsum(id+1, id+1);
        ans%=mod;
        ll tep=pw2[id]*SEG3.getsum(id+1, id+1);
        tep%=mod;
        SEG2.setto(2*id+id2, tep);
        SEG.setto(2*id+id2, (id*tep)%mod);
        seg[id]--;
        if(seg[id]==1){
            SEG3.update(0, id, inv2);
            if(id>0){
                SEG.update(0, 2*id-1, inv2);
                SEG2.update(0, 2*id-1, inv2);
            }
        }
        else{
            SEG3.update(0, id, 0);
            if(id>0){
                SEG.update(0, 2*id-1, 0);
                SEG2.update(0, 2*id-1, 0);
            }
        }
    }
    //if(n>=10005) return;
    SEG.init(2*n+10);
    SEG2.init(2*n+10);
    SEG3.init(n+10);
    pre=2;
    SEG3.setto(n, 1);
    for(ll i=0;i<n;i++){
        SEG3.setto(i, pre);
        pre*=2;
        pre%=mod;
    }
    sort(v.begin(), v.end(), compare2);
    memset(good, 0, sizeof(good));
    for(ll i=0;i<n;i++){
        seg[i]=2;
    }
    for(auto &it:v){
        val=it.F;
        id=it.S.F;
        id2=it.S.S;
        pre=1;
        cur=0;
        if(id<n-1){
            cur-=id*SEG2.getsum(2*(id+1), 2*n-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            cur+=SEG.getsum(2*(id+1), 2*n-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            if(seg[id]==2){
                cur*=inv2;
                cur%=mod;
            }
        }
        ans+=cur*val;
        ans%=mod;
        ll tep;
        if(id>0) tep=pw2[n-id-1]*SEG3.getsum(id-1, id-1);
        else tep=pw2[n-id-1];
        tep%=mod;
        SEG2.setto(2*id+id2, tep);
        SEG.setto(2*id+id2, (id*tep)%mod);
        seg[id]--;
        if(seg[id]==1){
            SEG3.update(id, n-1, inv2);
            if(id<n-1){
                SEG.update(2*(id+1), 2*n-1, inv2);
                SEG2.update(2*(id+1), 2*n-1, inv2);
            }
        }
        else{
            SEG3.update(id, n-1, 0);
            if(id<n-1){
                SEG.update(2*(id+1), 2*n-1, 0);
                SEG2.update(2*(id+1), 2*n-1, 0);
            }
        }
    }
    SEG.init(2*n+10);
    SEG2.init(2*n+10);
    SEG3.init(n+10);
    SEG4.init(n+10);
    pre=2;
    SEG3.setto(n, 1);
    for(ll i=0;i<n;i++){
        SEG3.setto(i, pre);
        pre*=2;
        pre%=mod;
    }
    pre=2;
    SEG4.setto(n, 1);
    for(ll i=n-1;i>=0;i--){
        SEG4.setto(i, pre);
        pre*=2;
        pre%=mod;
    }
    memset(good, 0, sizeof(good));
    for(ll i=0;i<n;i++){
        seg[i]=2;
    }
    ll preval=0;
    vector<pair<ll, pll>> waiting;
    //if(n>=10005) return;
    ll pt=0;
    pair<ll, pll> it2;
    for(auto &it:v){
        val=it.F;
        id=it.S.F;
        id2=it.S.S;
        pre=1;
        cur=0;
        if(val!=preval){
            for(;pt<waiting.size();pt++){
                it2=waiting[pt];
                ll val2=it2.F;
                ll id23=it2.S.F;
                ll id22=it2.S.S;
                SEG2.setto(2*id23+id22, 0);
                SEG.setto(2*id23+id22, 0);
                if(seg[id23]==1){
                    SEG4.update(0, id23, inv2);
                    
                }
                else{
                    SEG4.update(0, id23, 0);
                    
                }
            }
        }
        if(id<n-1){
            cur-=id*SEG2.getsum(2*(id+1), 2*n-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            cur+=SEG.getsum(2*(id+1), 2*n-1);
            cur%=mod;
            if(cur<0) cur+=mod;
            if(seg[id]==2){
                cur*=inv2;
                cur%=mod;
            }
        }
        ans-=cur*val;
        ans%=mod;
        if(ans<0) ans+=mod;
        ll tep;
        if(id>0) tep=SEG4.getsum(id+1, id+1)*SEG3.getsum(id-1, id-1);
        else tep=SEG4.getsum(id+1, id+1);
        tep%=mod;
        SEG2.setto(2*id+id2, tep);
        SEG.setto(2*id+id2, (id*tep)%mod);
        seg[id]--;
        if(seg[id]==1){
            SEG3.update(id, n-1, inv2);
            if(id<n-1){
                SEG.update(2*(id+1), 2*n-1, inv2);
                SEG2.update(2*(id+1), 2*n-1, inv2);
            }
        }
        else{
            SEG3.update(id, n-1, 0);
            if(id<n-1){
                SEG.update(2*(id+1), 2*n-1, 0);
                SEG2.update(2*(id+1), 2*n-1, 0);
            }
        }
        preval=val;
        waiting.pb(it);
    }
    //cout<<ans<<'\n';
    for(ll i=0;i<n;i++){
        for(ll j=0;j<2;j++){
            ans-=a[i][j]*pw2[n-1];
            ans%=mod;
            if(ans<0) ans+=mod;
        }
    }
    cout<<ans<<'\n';
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
    inv2=inv(2);
    pw2[0]=1;
    for(ll i=1;i<mxN;i++){
        pw2[i]=pw2[i-1]*2;
        pw2[i]%=mod;
    }
 
	solve();
	return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:320:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  320 |             for(;pt<waiting.size();pt++){
      |                  ~~^~~~~~~~~~~~~~~
Main.cpp:322:20: warning: unused variable 'val2' [-Wunused-variable]
  322 |                 ll val2=it2.F;
      |                    ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 130532 KB Output is correct
2 Correct 59 ms 130580 KB Output is correct
3 Correct 59 ms 130416 KB Output is correct
4 Correct 61 ms 130520 KB Output is correct
5 Correct 57 ms 130644 KB Output is correct
6 Correct 61 ms 130628 KB Output is correct
7 Correct 62 ms 130388 KB Output is correct
8 Correct 61 ms 130624 KB Output is correct
9 Correct 63 ms 130644 KB Output is correct
10 Correct 57 ms 130384 KB Output is correct
11 Correct 63 ms 130560 KB Output is correct
12 Correct 60 ms 130420 KB Output is correct
13 Correct 61 ms 130644 KB Output is correct
14 Correct 63 ms 130624 KB Output is correct
15 Correct 62 ms 130644 KB Output is correct
16 Correct 60 ms 130444 KB Output is correct
17 Correct 61 ms 130640 KB Output is correct
18 Correct 62 ms 130636 KB Output is correct
19 Correct 60 ms 130644 KB Output is correct
20 Correct 60 ms 130640 KB Output is correct
21 Correct 61 ms 130644 KB Output is correct
22 Correct 61 ms 130640 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 130644 KB Output is correct
2 Correct 62 ms 130560 KB Output is correct
3 Correct 61 ms 130640 KB Output is correct
4 Correct 62 ms 130388 KB Output is correct
5 Correct 58 ms 130460 KB Output is correct
6 Correct 69 ms 130664 KB Output is correct
7 Correct 61 ms 130640 KB Output is correct
8 Correct 61 ms 130544 KB Output is correct
9 Correct 61 ms 130392 KB Output is correct
10 Correct 61 ms 130560 KB Output is correct
11 Correct 62 ms 130644 KB Output is correct
12 Correct 62 ms 130640 KB Output is correct
13 Correct 61 ms 130640 KB Output is correct
14 Correct 61 ms 130644 KB Output is correct
15 Correct 62 ms 130644 KB Output is correct
16 Correct 62 ms 130548 KB Output is correct
17 Correct 64 ms 130664 KB Output is correct
18 Correct 65 ms 130512 KB Output is correct
19 Correct 61 ms 130640 KB Output is correct
20 Correct 61 ms 130640 KB Output is correct
21 Correct 63 ms 130592 KB Output is correct
22 Correct 62 ms 130644 KB Output is correct
23 Correct 62 ms 130640 KB Output is correct
24 Correct 61 ms 130644 KB Output is correct
25 Correct 67 ms 130592 KB Output is correct
26 Correct 61 ms 130576 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 130644 KB Output is correct
2 Correct 62 ms 130560 KB Output is correct
3 Correct 61 ms 130640 KB Output is correct
4 Correct 62 ms 130388 KB Output is correct
5 Correct 58 ms 130460 KB Output is correct
6 Correct 69 ms 130664 KB Output is correct
7 Correct 61 ms 130640 KB Output is correct
8 Correct 61 ms 130544 KB Output is correct
9 Correct 61 ms 130392 KB Output is correct
10 Correct 61 ms 130560 KB Output is correct
11 Correct 62 ms 130644 KB Output is correct
12 Correct 62 ms 130640 KB Output is correct
13 Correct 61 ms 130640 KB Output is correct
14 Correct 61 ms 130644 KB Output is correct
15 Correct 62 ms 130644 KB Output is correct
16 Correct 62 ms 130548 KB Output is correct
17 Correct 64 ms 130664 KB Output is correct
18 Correct 65 ms 130512 KB Output is correct
19 Correct 61 ms 130640 KB Output is correct
20 Correct 61 ms 130640 KB Output is correct
21 Correct 63 ms 130592 KB Output is correct
22 Correct 62 ms 130644 KB Output is correct
23 Correct 62 ms 130640 KB Output is correct
24 Correct 61 ms 130644 KB Output is correct
25 Correct 67 ms 130592 KB Output is correct
26 Correct 61 ms 130576 KB Output is correct
27 Correct 175 ms 134088 KB Output is correct
28 Correct 188 ms 134084 KB Output is correct
29 Correct 144 ms 133856 KB Output is correct
30 Correct 137 ms 134088 KB Output is correct
31 Correct 144 ms 134088 KB Output is correct
32 Correct 170 ms 134044 KB Output is correct
33 Correct 136 ms 133856 KB Output is correct
34 Correct 149 ms 134084 KB Output is correct
35 Correct 170 ms 134068 KB Output is correct
36 Correct 156 ms 134084 KB Output is correct
37 Correct 133 ms 133852 KB Output is correct
38 Correct 142 ms 134088 KB Output is correct
39 Correct 144 ms 134088 KB Output is correct
40 Correct 151 ms 134088 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 130532 KB Output is correct
2 Correct 59 ms 130580 KB Output is correct
3 Correct 59 ms 130416 KB Output is correct
4 Correct 61 ms 130520 KB Output is correct
5 Correct 57 ms 130644 KB Output is correct
6 Correct 61 ms 130628 KB Output is correct
7 Correct 62 ms 130388 KB Output is correct
8 Correct 61 ms 130624 KB Output is correct
9 Correct 63 ms 130644 KB Output is correct
10 Correct 57 ms 130384 KB Output is correct
11 Correct 63 ms 130560 KB Output is correct
12 Correct 60 ms 130420 KB Output is correct
13 Correct 61 ms 130644 KB Output is correct
14 Correct 63 ms 130624 KB Output is correct
15 Correct 62 ms 130644 KB Output is correct
16 Correct 60 ms 130444 KB Output is correct
17 Correct 61 ms 130640 KB Output is correct
18 Correct 62 ms 130636 KB Output is correct
19 Correct 60 ms 130644 KB Output is correct
20 Correct 60 ms 130640 KB Output is correct
21 Correct 61 ms 130644 KB Output is correct
22 Correct 61 ms 130640 KB Output is correct
23 Correct 68 ms 130644 KB Output is correct
24 Correct 62 ms 130560 KB Output is correct
25 Correct 61 ms 130640 KB Output is correct
26 Correct 62 ms 130388 KB Output is correct
27 Correct 58 ms 130460 KB Output is correct
28 Correct 69 ms 130664 KB Output is correct
29 Correct 61 ms 130640 KB Output is correct
30 Correct 61 ms 130544 KB Output is correct
31 Correct 61 ms 130392 KB Output is correct
32 Correct 61 ms 130560 KB Output is correct
33 Correct 62 ms 130644 KB Output is correct
34 Correct 62 ms 130640 KB Output is correct
35 Correct 61 ms 130640 KB Output is correct
36 Correct 61 ms 130644 KB Output is correct
37 Correct 62 ms 130644 KB Output is correct
38 Correct 62 ms 130548 KB Output is correct
39 Correct 64 ms 130664 KB Output is correct
40 Correct 65 ms 130512 KB Output is correct
41 Correct 61 ms 130640 KB Output is correct
42 Correct 61 ms 130640 KB Output is correct
43 Correct 63 ms 130592 KB Output is correct
44 Correct 62 ms 130644 KB Output is correct
45 Correct 62 ms 130640 KB Output is correct
46 Correct 61 ms 130644 KB Output is correct
47 Correct 67 ms 130592 KB Output is correct
48 Correct 61 ms 130576 KB Output is correct
49 Correct 175 ms 134088 KB Output is correct
50 Correct 188 ms 134084 KB Output is correct
51 Correct 144 ms 133856 KB Output is correct
52 Correct 137 ms 134088 KB Output is correct
53 Correct 144 ms 134088 KB Output is correct
54 Correct 170 ms 134044 KB Output is correct
55 Correct 136 ms 133856 KB Output is correct
56 Correct 149 ms 134084 KB Output is correct
57 Correct 170 ms 134068 KB Output is correct
58 Correct 156 ms 134084 KB Output is correct
59 Correct 133 ms 133852 KB Output is correct
60 Correct 142 ms 134088 KB Output is correct
61 Correct 144 ms 134088 KB Output is correct
62 Correct 151 ms 134088 KB Output is correct
63 Correct 188 ms 134060 KB Output is correct
64 Correct 190 ms 134152 KB Output is correct
65 Correct 147 ms 134040 KB Output is correct
66 Correct 158 ms 134084 KB Output is correct
67 Correct 145 ms 134088 KB Output is correct
68 Correct 169 ms 134084 KB Output is correct
69 Correct 155 ms 134088 KB Output is correct
70 Correct 172 ms 133972 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 130640 KB Output is correct
2 Correct 60 ms 130644 KB Output is correct
3 Correct 57 ms 130600 KB Output is correct
4 Correct 58 ms 130640 KB Output is correct
5 Correct 61 ms 130408 KB Output is correct
6 Correct 57 ms 130392 KB Output is correct
7 Correct 57 ms 130640 KB Output is correct
8 Correct 57 ms 130644 KB Output is correct
9 Correct 56 ms 130644 KB Output is correct
10 Correct 133 ms 134184 KB Output is correct
11 Correct 135 ms 134004 KB Output is correct
12 Correct 158 ms 133836 KB Output is correct
13 Correct 152 ms 134088 KB Output is correct
14 Correct 4666 ms 253908 KB Output is correct
15 Execution timed out 5024 ms 253952 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 130532 KB Output is correct
2 Correct 59 ms 130580 KB Output is correct
3 Correct 59 ms 130416 KB Output is correct
4 Correct 61 ms 130520 KB Output is correct
5 Correct 57 ms 130644 KB Output is correct
6 Correct 61 ms 130628 KB Output is correct
7 Correct 62 ms 130388 KB Output is correct
8 Correct 61 ms 130624 KB Output is correct
9 Correct 63 ms 130644 KB Output is correct
10 Correct 57 ms 130384 KB Output is correct
11 Correct 63 ms 130560 KB Output is correct
12 Correct 60 ms 130420 KB Output is correct
13 Correct 61 ms 130644 KB Output is correct
14 Correct 63 ms 130624 KB Output is correct
15 Correct 62 ms 130644 KB Output is correct
16 Correct 60 ms 130444 KB Output is correct
17 Correct 61 ms 130640 KB Output is correct
18 Correct 62 ms 130636 KB Output is correct
19 Correct 60 ms 130644 KB Output is correct
20 Correct 60 ms 130640 KB Output is correct
21 Correct 61 ms 130644 KB Output is correct
22 Correct 61 ms 130640 KB Output is correct
23 Correct 68 ms 130644 KB Output is correct
24 Correct 62 ms 130560 KB Output is correct
25 Correct 61 ms 130640 KB Output is correct
26 Correct 62 ms 130388 KB Output is correct
27 Correct 58 ms 130460 KB Output is correct
28 Correct 69 ms 130664 KB Output is correct
29 Correct 61 ms 130640 KB Output is correct
30 Correct 61 ms 130544 KB Output is correct
31 Correct 61 ms 130392 KB Output is correct
32 Correct 61 ms 130560 KB Output is correct
33 Correct 62 ms 130644 KB Output is correct
34 Correct 62 ms 130640 KB Output is correct
35 Correct 61 ms 130640 KB Output is correct
36 Correct 61 ms 130644 KB Output is correct
37 Correct 62 ms 130644 KB Output is correct
38 Correct 62 ms 130548 KB Output is correct
39 Correct 64 ms 130664 KB Output is correct
40 Correct 65 ms 130512 KB Output is correct
41 Correct 61 ms 130640 KB Output is correct
42 Correct 61 ms 130640 KB Output is correct
43 Correct 63 ms 130592 KB Output is correct
44 Correct 62 ms 130644 KB Output is correct
45 Correct 62 ms 130640 KB Output is correct
46 Correct 61 ms 130644 KB Output is correct
47 Correct 67 ms 130592 KB Output is correct
48 Correct 61 ms 130576 KB Output is correct
49 Correct 175 ms 134088 KB Output is correct
50 Correct 188 ms 134084 KB Output is correct
51 Correct 144 ms 133856 KB Output is correct
52 Correct 137 ms 134088 KB Output is correct
53 Correct 144 ms 134088 KB Output is correct
54 Correct 170 ms 134044 KB Output is correct
55 Correct 136 ms 133856 KB Output is correct
56 Correct 149 ms 134084 KB Output is correct
57 Correct 170 ms 134068 KB Output is correct
58 Correct 156 ms 134084 KB Output is correct
59 Correct 133 ms 133852 KB Output is correct
60 Correct 142 ms 134088 KB Output is correct
61 Correct 144 ms 134088 KB Output is correct
62 Correct 151 ms 134088 KB Output is correct
63 Correct 188 ms 134060 KB Output is correct
64 Correct 190 ms 134152 KB Output is correct
65 Correct 147 ms 134040 KB Output is correct
66 Correct 158 ms 134084 KB Output is correct
67 Correct 145 ms 134088 KB Output is correct
68 Correct 169 ms 134084 KB Output is correct
69 Correct 155 ms 134088 KB Output is correct
70 Correct 172 ms 133972 KB Output is correct
71 Correct 62 ms 130640 KB Output is correct
72 Correct 60 ms 130644 KB Output is correct
73 Correct 57 ms 130600 KB Output is correct
74 Correct 58 ms 130640 KB Output is correct
75 Correct 61 ms 130408 KB Output is correct
76 Correct 57 ms 130392 KB Output is correct
77 Correct 57 ms 130640 KB Output is correct
78 Correct 57 ms 130644 KB Output is correct
79 Correct 56 ms 130644 KB Output is correct
80 Correct 133 ms 134184 KB Output is correct
81 Correct 135 ms 134004 KB Output is correct
82 Correct 158 ms 133836 KB Output is correct
83 Correct 152 ms 134088 KB Output is correct
84 Correct 4666 ms 253908 KB Output is correct
85 Execution timed out 5024 ms 253952 KB Time limit exceeded
86 Halted 0 ms 0 KB -