oj.uz

Submission #396000

# Submission time Handle Problem Language Result Execution time Memory
396000 2021-04-29T10:49:34 Z MarcoMeijer Fish (IOI08_fish) C++14
12 / 100
 3000 ms 65540 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 = 5e5+10;
const int N = (1<<20);

int n, k, mod;
int l[MX], g[MX];
int sl[MX]; // sorted by L

vi gemCnt, highestCnt;
vector<vi> lastHigh;
int ans = 0;

int getWays(vi cnt) {
    int res = 1;
    FOR(i,cnt) res = res*(i+1)%mod;
    return res;
}
void increaseCount(int x) {
    gemCnt[x]++;
    if(highestCnt[x] != gemCnt[x]) {
        vi cnt = gemCnt;
        cnt[x] = 0;
        ans = (ans+getWays(cnt))%mod;
        highestCnt[x] = gemCnt[x];
    } else {
        vi cnt = lastHigh[x];
        cnt[x] = 0;
        ans = (ans-getWays(cnt)+mod)%mod;

        cnt = gemCnt;
        cnt[x] = 0;
        ans = (ans+getWays(cnt))%mod;
    }
    RE(i,k) if(gemCnt[i] == highestCnt[i]) lastHigh[i] = gemCnt;
}
void decreaseCount(int x) {
    gemCnt[x]--;
}

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];
    });

    gemCnt.assign(k,0); highestCnt.assign(k,0);
    lastHigh.assign(k,vi(k,0));

    int lb=0;
    RE(i,n) {
        while(lb != n && l[sl[lb]]*2 <= l[sl[i]])
            increaseCount(g[sl[lb++]]);
        increaseCount(g[sl[i]]);
        decreaseCount(g[sl[i]]);
    }

    OUTL(ans);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 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
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 2 ms 332 KB Output is correct
2 Incorrect 2 ms 460 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 601 ms 12204 KB Output isn't correct

Subtask #7
0 / 6.0

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

Subtask #8
0 / 6.0

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

Subtask #9
0 / 6.0

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

Subtask #10
0 / 6.0

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

Subtask #11
0 / 7.0

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

Subtask #12
0 / 7.0

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

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 139 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 204 ms 65540 KB Execution killed with signal 9

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 208 ms 65540 KB Execution killed with signal 9

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 138 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 193 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 148 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 201 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -