oj.uz

Submission #992631

# Submission time Handle Problem Language Result Execution time Memory
992631 2024-06-04T23:04:56 Z PedroBigMan Fish (IOI08_fish) C++14
56 / 100
 3000 ms 32960 KB 
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro "<<i<<endl
#define INF 1000000000000000000LL
#define EPS ((ld)0.00000000001)
#define pi ((ld)3.141592653589793)
#define VV(vvvv,NNNN,xxxx); REP(iiiii,0,NNNN) {vvvv.pb(xxxx);}
ll mod=1000000007;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

class ST
{	
    public:
    ll N;
    
    class SV //seg value
    {
        public:
        ll a; 
        SV() {a=1;}
        SV(ll x) {a=x;}
        
        SV operator & (SV X) {SV ANS((a*X.a)%mod); return ANS;}
    };
    
    SV upval(ll c) //how lazy values modify a seg value inside a node, c=current node
    {
        return p[c];
    }
    
    SV neuts; 
    
    vector<SV> p;
    vector<pl> range;
    
    ST() {N=0;}
    ST(vector<ll> arr)
    {
        N = (ll) 1<<(ll) ceil(log2(arr.size()));
        REP(i,0,2*N) {range.pb(mp(0,0));}
        REP(i,0,N) {p.pb(neuts);}
        REP(i,0,arr.size()) {SV X(arr[i]); p.pb(X); range[i+N]=mp(i,i);}
        REP(i,arr.size(),N) {p.pb(neuts); range[i+N]=mp(i,i);}
        ll cur = N-1;
        while(cur>0)
        {
            p[cur]=p[2*cur]&p[2*cur+1];
            range[cur]=mp(range[2*cur].ff,range[2*cur+1].ss);
            cur--;
        }
    }
    
    SV query(ll a,ll b, ll c=1LL) //range [a,b], current node. initially: query(a,b)
    {
		if(a>b) {return neuts;}
        ll x=range[c].ff; ll y=range[c].ss;
        if(y<a || x>b) {return neuts;}
        if(x>=a && y<=b) {return p[c];}
        SV ans = query(a,b,2*c)&query(a,b,2*c+1);
        return ans;
    }
    
    void update(ll s, ll a, ll b, ll c=1LL) //update LV, range [a,b], current node, current range. initially: update(s,a,b)
    {
		if(a>b) {return;}
        ll x=range[c].ff; ll y=range[c].ss;
        if(y<a || x>b) {return ;}
        if(x>=a && y<=b) 
        {
            p[c].a+=s;
            return;
        }
        update(s,a,b,2*c); update(s,a,b,2*c+1);
        p[c]=p[2*c]&p[2*c+1];
    }
};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cout.precision(20);
	ll N, K, M; cin>>N>>K>>M; mod=M;
    vector<pl> p(N,{-1,-1});
    REP(i,0,N) {cin>>p[i].ff>>p[i].ss; p[i].ss--;}
    sort(whole(p));
    vector<pl> to_order(K,{-1,-1}); REP(i,0,K) {to_order[i].ss=i;}
    REP(i,0,N) {to_order[p[i].ss].ff=p[i].ff;}
    sort(whole(to_order));
    vector<ll> limit(K,-1), m(K,-1);
    REP(i,0,K) {m[to_order[i].ss]=i; limit[i]=to_order[i].ff/2;}
    vector<ll> L(N,-1); REP(i,0,N) {L[i]=p[i].ff;} REP(i,0,K) {limit[i]=(ll) (upper_bound(whole(L),limit[i])-L.begin())-1;}
    REP(i,0,N) {p[i].ss=m[p[i].ss];}
    vector<ll> gem(N,-1); REP(i,0,N) {gem[i]=p[i].ss;}
    vector<vector<ll> > pos(K,vector<ll>()); REP(i,0,N) {pos[gem[i]].pb(i);}
    vector<ll> nxt(K,-1); 
    REP(i,0,K) {nxt[i]=*upper_bound(whole(pos[i]),limit[i]);}
    vector<ll> xx(K,1); ST S(xx);
    ll gem_ind = 0; ll ans = 0; ll ind=0; ll thisgem;
    while(gem_ind<K && limit[gem_ind]==-1) {gem_ind++; ans++; ans%=mod;}
    ll G; ll B; vector<ll> oc(K,0);
    while(ind<N && gem_ind<K)
    {
        thisgem = gem[ind]; S.update(1,thisgem,thisgem); oc[thisgem]++;
        while(gem_ind<K && limit[gem_ind]==ind) 
        {
            G=gem_ind;
            ans+=S.query(0,G).a; ans%=mod; 
            S.update(-oc[G],G,G);
            B = G+1;
            while(B<K && limit[B]<nxt[G]) 
            {
                S.update(-1,B,B);
                ans+=S.query(0,B).a; ans%=mod;
                S.update(1,B,B);
                B++;
            }
            S.update(oc[G],G,G);
            gem_ind++;
        }
        ind++;
    }
    if(ans<0LL) {ans+=mod;} cout<<ans<<endl;
    return 0;
}

Compilation message

fish.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization ("O3")
      | 
fish.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 4688 KB Output is correct
2 Correct 64 ms 5704 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 65 ms 504 KB Output is correct
3 Correct 173 ms 708 KB Output is correct

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 7248 KB Output is correct
2 Incorrect 624 ms 10800 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 11088 KB Output is correct
2 Correct 729 ms 11860 KB Output is correct

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1324 ms 7436 KB Output is correct
2 Execution timed out 3083 ms 11584 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3017 ms 13508 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 3060 ms 28608 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 3035 ms 29636 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 3029 ms 32960 KB Time limit exceeded
2 Halted 0 ms 0 KB -