Submission #396028

#	Time	Username	Problem	Language	Result	Execution time	Memory
396028		MarcoMeijer	Fish (IOI08_fish)	C++14	4 / 100	3079 ms	16540 KiB

fish

#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 = 5e5;
const int N = (1<<20);
 
int n, k, mod;
int l[MX], g[MX];
int sl[MX];
int gemCnt[MX];
int mxGemCnt[MX];
int used[MX];
 
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
    RE(i,k) gemCnt[i] = used[i] = 0;
    RE(i,n) gemCnt[g[i]]++;
 
    int lb=n-1;
    int ans=0;
    int needsUpdate=1;
    REV(i,0,n) {
        int cg = g[sl[i]];
        while(lb != -1 && l[sl[lb]]*2 > l[sl[i]]) {
            gemCnt[g[sl[lb]]]--;
            lb--;
        }
        RE(i,k) mxGemCnt[i] = max(mxGemCnt[i], gemCnt[i]);

        if(used[cg] == 0) {
            // this is the longest fish with gem cg
            // it must have zero of the gems that larger fish have, or...
            ll curWays = 1;
            RE(x,k) {
                curWays = (curWays*ll(used[x] ? 1 : gemCnt[x]+1))%mod;
            }
            ans = (ans + curWays)%mod;

            // or it should have more gems of type cg, than the other fish could eat
            if(gemCnt[cg] == mxGemCnt[cg]) {
                // remove the previous case where it has the most gems of type cg
                curWays = 1;
                RE(x,k)
                    if(x != cg)
                        curWays = (curWays*ll(used[x] ? 1 : gemCnt[x]+1))%mod;
                ans = (ans + mod - curWays)%mod;

                // add the correct case where it has the most gems of type cg
                curWays = 1;
                RE(x,k)
                    if(x != cg)
                        curWays = (curWays*ll(gemCnt[x]+1))%mod;
                ans = (ans + curWays)%mod;
            }

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

Compilation message (stderr)

fish.cpp: In function 'void program()':
fish.cpp:85:9: warning: unused variable 'needsUpdate' [-Wunused-variable]
   85 |     int needsUpdate=1;
      |         ^~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6
• Subtask 10: 0 / 6
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5