oj.uz

Submission #387072

# Submission time Handle Problem Language Result Execution time Memory
387072 2021-04-07T22:13:10 Z achibasadzishvili Fish (IOI08_fish) C++17
95 / 100
 1143 ms 65540 KB 
#include<bits/stdc++.h>
#define ll int
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
ll ans;
ll n,k,mod,in[500005],s[1500005],pown=1,m[500005];
vector<ll>v[500005],t[500005];
void change(ll x){
    x = pown + x;
    s[x]++;
    s[x] %= mod;
    x /= 2;
    while(x){
        s[x] = s[2 * x] * s[2 * x + 1] % mod;
        x /= 2;
    }
}
ll get(ll x,ll L,ll R,ll l,ll r){
    if(L > r || R < l)return 1;
    if(L >= l && R <= r)return s[x];
    ll k1 = get(2 * x , L , (L + R) / 2 , l , r);
    ll k2 = get(2 * x + 1 , (L + R) / 2 + 1 , R , l , r);
    return k1 * k2 % mod;
}
int main(){
    ios::sync_with_stdio(false);
    cin >> n >> k >> mod;
    while(pown <= k + 2)
        pown *= 2;
    ll x,y;
    for(int i=1; i<=n; i++){
        cin >> x >> y;
        v[y].pb(x);
    }
    
    vector<pair<ll,ll> >g;
    for(int i=1; i<=k; i++){
        sort(v[i].begin() , v[i].end());
        if(v[i].size()){
            g.pb(mp(v[i][v[i].size() - 1] , i));
        }
    }
    for(int i=0; i<k; i++){
        change(i);
    }
    sort(g.begin() , g.end());
    
    for(int i=0; i<g.size(); i++){
        t[i] = v[g[i].s];
    }
    set<pair<ll,ll> >st;
    for(int i=0; i<k; i++){
        v[i] = t[i];
        st.insert(mp(v[i][0] , i));
        m[i] = v[i][(int)v[i].size() - 1];
    }
    ll l,r,mid,ind;
    pair<ll,ll>p;
    for(int i=0; i<k; i++){
        if(v[i].size() == 0)continue;
        while(st.size() && (*st.begin()).f * 2 <= m[i]){
            p = (*st.begin());
            change(p.s);
            in[p.s]++;
            st.erase(st.begin());
            if(in[p.s] != v[p.s].size()){
                st.insert(mp(v[p.s][in[p.s]] , p.s));
            }
        }
        
        l = i + 1,r = k - 1,mid,ind = k;
        while(r >= l){
            mid = (l + r) / 2;
            if(m[mid] >= 2 * v[i][in[i]]){
                r = mid - 1;
                ind = mid;
            }
            else {
                l = mid + 1;
            }
        }
        ind--;
        ans = (ans + get(1 , 1 , pown , 1 , i) * get(1 , 1 , pown , i + 2 , ind + 1)) % mod;
        ans = (ans + in[i] % mod * get(1 , 1 , pown , 1 , i)) % mod;
    }
    
    
    cout << ans << '\n';
    
    
    
    return 0;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:51:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i=0; i<g.size(); i++){
      |                  ~^~~~~~~~~
fish.cpp:69:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             if(in[p.s] != v[p.s].size()){
      |                ~~~~~~~~^~~~~~~~~~~~~~~~
fish.cpp:74:39: warning: right operand of comma operator has no effect [-Wunused-value]
   74 |         l = i + 1,r = k - 1,mid,ind = k;
      |                                       ^

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23916 KB Output is correct
2 Correct 187 ms 28652 KB Output is correct

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 26464 KB Output is correct
2 Correct 122 ms 26972 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24172 KB Output is correct
2 Correct 21 ms 24172 KB Output is correct
3 Correct 21 ms 24172 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 27528 KB Output is correct
2 Correct 258 ms 29276 KB Output is correct
3 Correct 241 ms 29940 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 29292 KB Output is correct
2 Correct 251 ms 29292 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 27628 KB Output is correct
2 Correct 285 ms 29916 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 32740 KB Output is correct
2 Correct 402 ms 39008 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 910 ms 44764 KB Output is correct
2 Correct 686 ms 44636 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 47196 KB Output is correct
2 Correct 775 ms 39264 KB Output is correct
3 Correct 642 ms 54104 KB Output is correct
4 Correct 769 ms 39136 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1143 ms 50784 KB Output is correct
2 Runtime error 438 ms 65540 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -