oj.uz

Submission #396093

# Submission time Handle Problem Language Result Execution time Memory
396093 2021-04-29T12:50:20 Z MarcoMeijer Fish (IOI08_fish) C++14
0 / 100
 3000 ms 15152 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e6;
const int N = (1<<20);
 
int n, k, mod;
int l[MX], g[MX];
int sl[MX];
int mxGemCnt[MX];
vi gemCnt, firstUsed, lastChanged;
vi sk, rk;

int SEG[N*2];
void setSeg(int i, int x, int l=0, int r=N-1, int p=1) {
    if(i < l || i > r) return;
    if(l == r) {
        SEG[p] = x%mod;
        return;
    }
    int m=(l+r)/2;
    setSeg(i,x,l  ,m,p*2  );
    setSeg(i,x,m+1,r,p*2+1);
    SEG[p] = (SEG[p*2]*SEG[p*2+1])%mod;
}
int getSeg(int i, int j, int l=0, int r=N-1, int p=1) {
    if(j < l || i > r) return 1;
    if(i <= l && j >= r) return SEG[p];
    int m=(l+r)/2;
    int a=getSeg(i,j,l  ,m,p*2  );
    int b=getSeg(i,j,m+1,r,p*2+1);
    return (a*b)%mod;
}
int getBiggerFirstUsed(int x) {
    int lb=0, ub=k-1;
    while(lb != ub) {
        int mid=(lb+ub)/2;
        if(firstUsed[sk[mid]] > x) ub=mid;
        else lb=mid+1;
    }
    return getSeg(lb,k-1);
}


void program() {
    IN(n,k,mod);
    RE(i,n) IN(l[i], g[i]), g[i]--;
    RE(i,n) sl[i] = i;
    sort(sl,sl+n,[](int i, int j) {
        return l[i]<l[j];
    });
 
    // initial gem cnt
    gemCnt.assign(k,0), firstUsed.assign(k,0), lastChanged.assign(k,n);
    RE(i,n) gemCnt[g[i]]++;
 
    // sorted k
    REV(i,0,n)
        if(firstUsed[g[sl[i]]] == 0)
            firstUsed[g[sl[i]]] = i;
    RE(i,k) sk.pb(i);
    sort(all(sk), [](int i, int j) {return firstUsed[i] < firstUsed[j];});
    firstUsed = vi(k,0);
    rk.assign(k,0);
    RE(i,k) rk[sk[i]] = i;

    RE(i,k) setSeg(rk[i],gemCnt[i]+1);

    int lb=n-1;
    int ans=0;
    REV(i,0,n) {
        int cg = g[sl[i]];
        while(lb != -1 && l[sl[lb]]*2 > l[sl[i]]) {
            gemCnt[g[sl[lb]]]--, lastChanged[g[sl[lb]]] = i;
            setSeg(rk[g[sl[lb]]], gemCnt[g[sl[lb]]] + 1);
            lb--;
        }

        if(firstUsed[cg] == 0) {
            // this is the longest fish with gem cg
            // it must have zero of the gems that larger fish have, or...
            setSeg(rk[cg], gemCnt[cg]);
            ll curWays = getBiggerFirstUsed(0);
            setSeg(rk[cg], gemCnt[cg]+1);
            ans = (ans + curWays)%mod;

            // or it should have more gems of type cg, than the other fish could eat
            curWays = 1;
            RE(x,k)
                if(x != cg)
                    curWays = (curWays*ll(firstUsed[x] > lastChanged[cg] ? 1 : gemCnt[x]+1))%mod;
            ans = (ans + curWays)%mod;

            // mark this gem type as used
            firstUsed[cg] = i;
        }
    }
 
    OUTL(ans);
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 328 ms 9776 KB Output isn't correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 460 KB Output isn't correct

Subtask #9
0 / 6.0

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

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 504 KB Output is correct
2 Incorrect 11 ms 560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
0 / 7.0

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

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1101 ms 9440 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2250 ms 10180 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3074 ms 9832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3073 ms 13204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3077 ms 13172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 15152 KB Time limit exceeded
2 Halted 0 ms 0 KB -