oj.uz

Submission #1100920

# Submission time Handle Problem Language Result Execution time Memory
1100920 2024-10-15T03:32:14 Z sitablechair Fortune Telling 2 (JOI14_fortune_telling2) C++17
35 / 100
 61 ms 42176 KB 
#include<bits/stdc++.h>
#define ll long long
#define sz(x) (signed)x.size()
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define For(i,l,r) for(int i=l;i<=r;i++)
#define ForD(i,l,r) for(int i=r;i>=l;i--)
#define F "CHOTMH"
#define fio freopen(F".inp","r",stdin);freopen(F".out","w",stdout);
using namespace std;

int n,k;

const int N=2e5+3;

struct BIT {
    int pf[N];
    void upd(int u,int val) {
        while(u<=k) {
            pf[u]=pf[u]+val;
            u+=u&(-u);
        }
    }
    int query(int u) {
        int ans=0;
        while(u>0) {
            ans+=pf[u];
            u-=u&(-u);
        }
        return ans;
    }
};
struct BITT {
    int pf[N];
    void upd(int u,int val) {
        while(u<=k) {
            pf[u]=min(pf[u],val);
            u+=u&(-u);
        }
    }
    int query(int u) {
        int ans=2e9;
        while(u>0) {
            ans=min(pf[u],ans);
            u-=u&(-u);
        }
        return ans;
    }
};
BIT bit;
BITT sus;
vector<int> in[N],sigma[N],sigma1[N],big;
pair<int,int> a[N];
bool huhu[N];
int q[N],pf[N],pp[N];
int main() {
    cin.tie(0)->sync_with_stdio(0);
    //fio
    cin >> n >> k;
    ll ans=0;
    For(i,1,n) {
        cin >> a[i].ff >> a[i].ss;
        big.pb(a[i].ff);
        big.pb(a[i].ss);

    }
    For(i,1,k) {
        bit.pf[i]=0;
        sus.pf[i]=2e9;
        cin >> q[i];
        big.pb(q[i]);
        pf[i]=max(pf[i-1],q[i]);
    }
    sort(big.begin(),big.end());
    big.resize(unique(big.begin(),big.end())-big.begin());
    For(i,1,k) {
        int ind=lower_bound(big.begin(),big.end(),q[i])-big.begin();
        in[ind+1].pb(i);
    }
    For(i,1,n) {
        int ind=lower_bound(big.begin(),big.end(),a[i].ff)-big.begin();
        int ind1=lower_bound(big.begin(),big.end(),a[i].ss)-big.begin();
        if (a[i].ff!=a[i].ss) {
            sigma[min(ind,ind1)+1].pb(i);
            sigma1[max(ind,ind1)+1].pb(i);
        }
        else ans+=a[i].ff,huhu[i]=1;
    }
    ForD(i,1,sz(big)) {
        for(auto el: in[i]) sus.upd(k-el+1,q[el]);
        for(auto el: sigma[i]) {
            int l=(a[el].ff<a[el].ss?(lower_bound(pf+1,pf+1+k,a[el].ff)-pf)+1:1),r=k;
            int cc=l;
            if (l>k+1) {
                ans+=a[el].ff;
                huhu[el]=1;
            }
            if (a[el].ff<a[el].ss) swap(a[el].ff,a[el].ss);
            while(l<r) {
                int mid=l+(r-l+1)/2;
                if (sus.query(k-mid+1)<a[el].ff) l=mid;
                else r=mid-1;
            }
            if (sus.query(k-l+1)<a[el].ff) pp[el]=l;
            else pp[el]=cc;
        }
    }
    ForD(i,1,sz(big)) {
        for(auto el: in[i]) bit.upd(el,1);
        for(auto el: sigma1[i]) {
            if (huhu[el]) continue;
            int tm=bit.query(k)-bit.query(pp[el]-1);
            if (tm%2) ans+=a[el].ss;
            else ans+=a[el].ff;
        }
    }
    cout << ans << endl;
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 4 ms 18768 KB Output is correct
3 Correct 4 ms 19024 KB Output is correct
4 Correct 5 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 5 ms 19024 KB Output is correct
7 Correct 5 ms 19024 KB Output is correct
8 Correct 4 ms 19024 KB Output is correct
9 Correct 4 ms 19024 KB Output is correct
10 Correct 4 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 4 ms 19192 KB Output is correct
13 Correct 4 ms 18880 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 4 ms 18768 KB Output is correct
3 Correct 4 ms 19024 KB Output is correct
4 Correct 5 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 5 ms 19024 KB Output is correct
7 Correct 5 ms 19024 KB Output is correct
8 Correct 4 ms 19024 KB Output is correct
9 Correct 4 ms 19024 KB Output is correct
10 Correct 4 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 4 ms 19192 KB Output is correct
13 Correct 4 ms 18880 KB Output is correct
14 Correct 14 ms 20048 KB Output is correct
15 Correct 26 ms 21204 KB Output is correct
16 Correct 45 ms 22216 KB Output is correct
17 Correct 61 ms 23248 KB Output is correct
18 Correct 53 ms 23240 KB Output is correct
19 Correct 61 ms 23244 KB Output is correct
20 Correct 53 ms 23240 KB Output is correct
21 Correct 49 ms 23320 KB Output is correct
22 Correct 34 ms 22992 KB Output is correct
23 Correct 35 ms 22992 KB Output is correct
24 Correct 33 ms 22928 KB Output is correct
25 Correct 35 ms 23240 KB Output is correct
26 Correct 38 ms 21984 KB Output is correct
27 Correct 49 ms 22264 KB Output is correct
28 Correct 38 ms 22216 KB Output is correct
29 Correct 51 ms 22728 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18768 KB Output is correct
2 Correct 4 ms 18768 KB Output is correct
3 Correct 4 ms 19024 KB Output is correct
4 Correct 5 ms 19024 KB Output is correct
5 Correct 4 ms 19024 KB Output is correct
6 Correct 5 ms 19024 KB Output is correct
7 Correct 5 ms 19024 KB Output is correct
8 Correct 4 ms 19024 KB Output is correct
9 Correct 4 ms 19024 KB Output is correct
10 Correct 4 ms 19024 KB Output is correct
11 Correct 4 ms 19024 KB Output is correct
12 Correct 4 ms 19192 KB Output is correct
13 Correct 4 ms 18880 KB Output is correct
14 Correct 14 ms 20048 KB Output is correct
15 Correct 26 ms 21204 KB Output is correct
16 Correct 45 ms 22216 KB Output is correct
17 Correct 61 ms 23248 KB Output is correct
18 Correct 53 ms 23240 KB Output is correct
19 Correct 61 ms 23244 KB Output is correct
20 Correct 53 ms 23240 KB Output is correct
21 Correct 49 ms 23320 KB Output is correct
22 Correct 34 ms 22992 KB Output is correct
23 Correct 35 ms 22992 KB Output is correct
24 Correct 33 ms 22928 KB Output is correct
25 Correct 35 ms 23240 KB Output is correct
26 Correct 38 ms 21984 KB Output is correct
27 Correct 49 ms 22264 KB Output is correct
28 Correct 38 ms 22216 KB Output is correct
29 Correct 51 ms 22728 KB Output is correct
30 Runtime error 57 ms 42176 KB Execution killed with signal 11
31 Halted 0 ms 0 KB -