Submission #1017012

#	Time	Username	Problem	Language	Result	Execution time	Memory
1017012		huutuan	Fish (IOI08_fish)	C++14	43 / 100	3069 ms	30036 KiB

fish

#include<bits/stdc++.h>

using namespace std;

const int N=5e5+10;
int n, m, mod, mx[N], cnt[N], f[N], vis[N], cnt2[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, ++cnt[a[i].second], f[a[i].second]=1;
   for (int i=1; i<=n; ++i) if (a[i].first*2<=a[mx[a[i].second]].first) ++f[a[i].second];
   int ans=0;
   for (int i=n, j=n; i>=1; --i) if (mx[a[i].second]==i){
      while (j && a[j].first*2>a[i].first){
         --cnt[a[j].second];
         --j;
      }
      {
         int cur=1;
         for (int k=1; k<=m; ++k) if (mx[k]<=i) cur=cur*(cnt[k]+1)%mod;
         ans=(ans+cur)%mod;
      }
      for (int k:v[a[i].second]) vis[k]=0;
      {
         for (int k=1; k<=m; ++k) if (mx[k]<i){
            if (f[k]>cnt[k]){
               int j2=j;
               while (j && a[j].first*2>a[mx[k]].first){
                  --cnt[a[j].second];
                  --j;
               }
               {
                  int cur=1;
                  for (int t=1; t<=m; ++t) if (mx[t]<=i){
                     if (t==a[i].second) cur=cur*cnt[t]%mod;
                     else if (t!=k) cur=cur*(cnt[t]+1)%mod;
                  }
                  ans=(ans+cur)%mod;
               }
               while (j!=j2){
                  ++j;
                  ++cnt[a[j].second];
               }
            }
         }
      }
   }
   cout << ans << '\n';
   return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 6 / 6
• Subtask 8: 6 / 6
• Subtask 9: 6 / 6
• Subtask 10: 0 / 6
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5