oj.uz

Submission #387064

# Submission time Handle Problem Language Result Execution time Memory
387064 2021-04-07T21:54:30 Z achibasadzishvili Fish (IOI08_fish) C++14
83 / 100
 1102 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[5000005],pown=1,m[500005];
vector<ll>v[500005],t[500005];
void change(ll x){
    x = pown + x;
    s[x]++;
    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 <= 2 * k)
        pown *= 2;
    for(int i=1; i<=n; i++){
        ll x,y;
        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++){
        ll ind = g[i].s;
        t[i] = v[ind];
    }
    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];
    }
    
    for(int i=0; i<k; i++){
        while(st.size() && (*st.begin()).f * 2 <= m[i]){
            pair<ll,ll>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));
            }
        }
        
        ll 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] * get(1 , 1 , pown , 1 , i)) % mod;
    }
    
    
    cout << ans << '\n';
    
    
    
    return 0;
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:50: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]
   50 |     for(int i=0; i<g.size(); i++){
      |                  ~^~~~~~~~~
fish.cpp:67:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             if(in[p.s] != v[p.s].size()){
      |                ~~~~~~~~^~~~~~~~~~~~~~~~

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 18 ms 23788 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 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 18 ms 23788 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 19 ms 23916 KB Output is correct
2 Correct 200 ms 28268 KB Output is correct

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 26092 KB Output is correct
2 Correct 121 ms 26972 KB Output is correct

Subtask #10
6.0 / 6.0

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

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 27372 KB Output is correct
2 Incorrect 259 ms 29276 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 206 ms 28980 KB Output is correct
2 Correct 255 ms 29200 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 27372 KB Output is correct
2 Correct 270 ms 29548 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 32484 KB Output is correct
2 Correct 387 ms 38752 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 858 ms 44508 KB Output is correct
2 Correct 621 ms 44508 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 46708 KB Output is correct
2 Correct 756 ms 39264 KB Output is correct
3 Incorrect 647 ms 60124 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

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