oj.uz

Submission #1030772

# Submission time Handle Problem Language Result Execution time Memory
1030772 2024-07-22T09:49:20 Z huutuan Fish (IOI08_fish) C++14
100 / 100
 382 ms 51164 KB 
#include<bits/stdc++.h>

using namespace std;

int mod;

struct SegmentTree{
   int n;
   vector<int> t;
   void init(int _n){
      n=_n;
      t.assign(4*n+1, 1);
   }
   void update(int k, int l, int r, int pos, int val){
      if (l==r){
         t[k]=(t[k]+val)%mod;
         return;
      }
      int mid=(l+r)>>1;
      if (pos<=mid) update(k<<1, l, mid, pos, val);
      else update(k<<1|1, mid+1, r, pos, val);
      t[k]=t[k<<1]*t[k<<1|1]%mod;
   }
   int get(int k, int l, int r, int L, int R){
      if (r<L || R<l) return 1;
      if (L<=l && r<=R) return t[k];
      int mid=(l+r)>>1;
      return get(k<<1, l, mid, L, R)*get(k<<1|1, mid+1, r, L, R)%mod;
   }
} st;

const int N=5e5+10;
int n, m, mx[N], pos[N], b[N], cnt[N];
vector<int> v[N];
pair<int, int> a[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> m >> mod;
   for (int i=1; i<=n; ++i) cin >> a[i].first >> a[i].second;
   sort(a+1, a+n+1);
   for (int i=1; i<=n; ++i) mx[a[i].second]=i, v[a[i].second].push_back(a[i].first);
   m=0;
   for (int i=1; i<=n; ++i) if (mx[a[i].second]==i){
      ++m;
      pos[a[i].second]=m;
      b[m]=a[i].second;
   }
   st.init(m);
   int ans=0;
   for (int i=1, j=0; i<=n; ++i){
      while (j<n && a[j+1].first*2<=a[i].first){
         ++j;
         st.update(1, 1, m, pos[a[j].second], 1);
         ++cnt[a[j].second];
      }
      if (mx[a[i].second]==i){
         int p1=1, p2=1;
         p1=st.get(1, 1, m, 1, pos[a[i].second]-1);
         p2=p1;
         int l=pos[a[i].second]+1, r=m;
         while (l<=r){
            int mid=(l+r)>>1;
            int cc=upper_bound(v[a[i].second].begin(), v[a[i].second].end(), a[mx[b[mid]]].first/2)-v[a[i].second].begin();
            if (cc<=cnt[a[i].second]) l=mid+1;
            else r=mid-1;
         }
         p2=p2*st.get(1, 1, m, pos[a[i].second]+1, r)%mod;
         p1=p1*(cnt[a[i].second]%mod)%mod;
         ans=(ans+p1+p2)%mod;
      }
   }
   cout << ans << '\n';
   return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12124 KB Output is correct
2 Correct 106 ms 21776 KB Output is correct

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

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

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 16460 KB Output is correct
2 Correct 62 ms 17252 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12396 KB Output is correct
2 Correct 9 ms 12380 KB Output is correct
3 Correct 7 ms 12324 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 18892 KB Output is correct
2 Correct 127 ms 22184 KB Output is correct
3 Correct 119 ms 22468 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 22212 KB Output is correct
2 Correct 126 ms 22988 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 18840 KB Output is correct
2 Correct 131 ms 22712 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 22576 KB Output is correct
2 Correct 150 ms 27632 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 29520 KB Output is correct
2 Correct 182 ms 26756 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 29268 KB Output is correct
2 Correct 206 ms 28056 KB Output is correct
3 Correct 218 ms 33244 KB Output is correct
4 Correct 220 ms 31568 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 33124 KB Output is correct
2 Correct 340 ms 51164 KB Output is correct
3 Correct 284 ms 49732 KB Output is correct
4 Correct 382 ms 45484 KB Output is correct