oj.uz

Submission #396049

# Submission time Handle Problem Language Result Execution time Memory
396049 2021-04-29T12:02:08 Z MarcoMeijer Fish (IOI08_fish) C++14
75 / 100
 3000 ms 13236 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;
 
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]]++;
 
    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;

        if(firstUsed[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;
            gemCnt[cg]--;
            RE(x,k)
                curWays = (curWays*ll(firstUsed[x] ? 1 : gemCnt[x]+1))%mod;
            gemCnt[cg]++;
            ans = (ans + curWays)%mod;

            // or it should have more gems of type cg, than the other fish could eat
            // find the last position where the gemCnt is still equal to the current gemCnt
            int lb=lastChanged[cg];

            curWays = 1;
            RE(x,k)
                if(x != cg)
                    curWays = (curWays*ll(firstUsed[x] > lb ? 1 : gemCnt[x]+1))%mod;
            ans = (ans + curWays)%mod;

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

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 178 ms 6204 KB Output is correct

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 2692 KB Output is correct
2 Correct 88 ms 6416 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 384 KB Output is correct
2 Correct 14 ms 332 KB Output is correct
3 Correct 33 ms 448 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 3768 KB Output is correct
2 Correct 252 ms 6124 KB Output is correct
3 Correct 253 ms 12992 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 6204 KB Output is correct
2 Correct 276 ms 13236 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 3900 KB Output is correct
2 Correct 753 ms 6368 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3080 ms 6340 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 5612 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 3079 ms 7364 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 3028 ms 7364 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 3074 ms 8508 KB Time limit exceeded
2 Halted 0 ms 0 KB -