oj.uz

Submission #387075

# Submission time Handle Problem Language Result Execution time Memory
387075 2021-04-07T22:19:56 Z achibasadzishvili Fish (IOI08_fish) C++14
95 / 100
 797 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];
    }
    ll l,r,mid,ind;
    for(int i=0; i<k; i++){
        v[i] = t[i];
        t[i].clear();
        m[i] = v[i][(int)v[i].size() - 1];
    }
    for(int i=0; i<k; i++){
        for(int j=0; j<v[i].size(); j++){
            l = 0,r = k - 1,ind = -1;
            while(r >= l){
                mid = (l + r) / 2;
                if(m[mid] >= 2 * v[i][j]){
                    r = mid - 1;
                    ind = mid;
                }
                else {
                    l = mid + 1;
                }
            }
            if(ind != -1){
                t[ind].pb(i);
            }
        }
    }
    pair<ll,ll>p;
    for(int i=0; i<k; i++){
        for(int j=0; j<t[i].size(); j++){
            in[t[i][j]]++;
            change(t[i][j]);
        }
        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:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for(int j=0; j<v[i].size(); j++){
      |                      ~^~~~~~~~~~~~
fish.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(int j=0; j<t[i].size(); j++){
      |                      ~^~~~~~~~~~~~
fish.cpp:84:39: warning: right operand of comma operator has no effect [-Wunused-value]
   84 |         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 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 17 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 164 ms 29860 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 18 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 96 ms 27024 KB Output is correct
2 Correct 102 ms 27592 KB Output is correct

Subtask #10
6.0 / 6.0

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

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 28468 KB Output is correct
2 Correct 247 ms 31240 KB Output is correct
3 Correct 201 ms 31444 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 31096 KB Output is correct
2 Correct 191 ms 30268 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 27372 KB Output is correct
2 Correct 206 ms 31232 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 31080 KB Output is correct
2 Correct 367 ms 34016 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 38292 KB Output is correct
2 Correct 481 ms 38236 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 440 ms 42076 KB Output is correct
2 Correct 543 ms 35244 KB Output is correct
3 Correct 610 ms 46680 KB Output is correct
4 Correct 556 ms 35680 KB Output is correct

Subtask #19
0 / 5.0

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