oj.uz

Submission #1019451

# Submission time Handle Problem Language Result Execution time Memory
1019451 2024-07-10T21:17:35 Z ttamx Fish (IOI08_fish) C++17
85 / 100
 275 ms 18468 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;

const int N=5e5+5;
const int K=1<<20;

int n,k,mod;
pair<int,int> a[N];
int b[N],ord[N],last[N],nxt[N];
bool ok[N];
int cnt;
ll ans;

struct SegTree{
    ll t[N];
    void build(int l,int r,int i){
        t[i]=1;
        if(l==r)return;
        int m=(l+r)/2;
        build(l,m,i*2);
        build(m+1,r,i*2+1);
    }
    void build(){
        build(1,k,1);
    }
    void update(int l,int r,int i,int x,int v){
        if(x<l||r<x)return;
        if(l==r)return void(t[i]+=v);
        int m=(l+r)/2;
        update(l,m,i*2,x,v);
        update(m+1,r,i*2+1,x,v);
        t[i]=t[i*2]*t[i*2+1]%mod;
    }
    void update(int x,int v){
        update(1,k,1,x,v);
    }
    ll query(int l,int r,int i,int x,int y){
        if(y<l||r<x)return 1;
        if(x<=l&&r<=y)return t[i];
        int m=(l+r)/2;
        return query(l,m,i*2,x,y)*query(m+1,r,i*2+1,x,y)%mod;
    }
    ll query(int x,int y){
        return query(1,k,1,x,y);
    }
}seg;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k >> mod;
    for(int i=1;i<=n;i++)cin >> a[i].first >> a[i].second;
    sort(a+1,a+n+1);
    cnt=k;
    for(int i=n;i>=1;i--){
        auto [l,t]=a[i];
        if(!ord[t]){
            b[cnt]=l;
            ord[t]=cnt;
            last[t]=l;
            ok[i]=true;
            cnt--;
        }
        nxt[i]=last[t];
        last[t]=l;
    }
    seg.build();
    for(int i=1,j=1;i<=n;i++)if(ok[i]){
        auto [l,t]=a[i];
        while(j<=n&&l>=a[j].first*2){
            int x=a[j].second;
            seg.update(ord[x],1);
            last[x]=nxt[j];
            j++;
        }
        int id=lower_bound(b+1,b+k+1,last[t]*2)-b-1;
        ans+=seg.query(1,ord[t]);
        ans+=(1LL*seg.query(1,ord[t]-1)*(mod+seg.query(ord[t]+1,id)-1))%mod;
        ans%=mod;
        assert(0<=ans&&ans<mod);
    }
    cout << ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 98 ms 11512 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5212 KB Output is correct
2 Correct 57 ms 6228 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 480 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 7580 KB Output is correct
2 Correct 122 ms 12048 KB Output is correct
3 Correct 139 ms 13084 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 12116 KB Output is correct
2 Correct 116 ms 12372 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 8180 KB Output is correct
2 Correct 118 ms 12628 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 11604 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 13648 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 12116 KB Output is correct
2 Correct 131 ms 16728 KB Output is correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 204 ms 17908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 229 ms 16732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 275 ms 18468 KB Output isn't correct
2 Halted 0 ms 0 KB -