Submission #989585

#	Time	Username	Problem	Language	Result	Execution time	Memory
989585		huutuan	Fish (IOI08_fish)	C++14	32 / 100	3059 ms	22820 KiB

fish

#include<bits/stdc++.h>

using namespace std;

const int N=5e5+10, S=750;
int n, m, mod;
pair<int, int> a[N];
int cnt[N], cnt2[N], lst[N];
vector<pair<int, int>> v, v2;
int prod[S];

int solve(){
   if (v.empty()) return 0;
   int z=v.back().second;
   for (int i=1; i<=m; ++i) cnt[i]=cnt2[i]=lst[i]=0;
   for (auto &i:v) if (i.first*2<=v.back().first) ++cnt[i.second];
   int ans=accumulate(cnt+1, cnt+m+1, 1ll, [&](int x, int y){ return x*(y+1)%mod; });
   for (int i=0; i<(int)v.size(); ++i) lst[v[i].second]=i;
   for (int i=0; i<S; ++i) prod[i]=1;
   for (int i=0, j=-1; i<(int)v.size(); ++i){
      while (v[j+1].first*2<=v[i].first){
         ++j;
         ++cnt2[v[j].second];
         int id=v[j].second/S;
         for (int k=0; k<S; ++k) prod[id]=prod[id]*(cnt2[id*S+k]+1)%mod;
      }
      if (v[i].second!=z && cnt2[v[i].second]>=cnt[v[i].second] && lst[v[i].second]==i){
         int cur=(cnt2[v[i].second]-cnt[v[i].second]+1);
         int id1=v[i].second/S, id2=z/S;
         for (int k=0; k<S; ++k) if (k!=id1 && k!=id2) cur=cur*prod[k]%mod;
         for (int k=id1*S; k<(id1+1)*S; ++k) if (k!=v[i].second) cur=cur*(cnt2[k]+1-(k==z))%mod;
         if (id1!=id2) for (int k=id2*S; k<(id2+1)*S; ++k) if (k!=v[i].second) cur=cur*(cnt2[k]+1-(k==z))%mod;
         ans=(ans+cur)%mod;
      }
   }
   v2.clear();
   for (auto &i:v) if (i.second!=z) v2.push_back(i);
   v.swap(v2);
   return (ans+solve())%mod;
}

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);
   v=vector<pair<int, int>>(a+1, a+n+1);
   cout << solve() << '\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: 0 / 5
• Subtask 7: 6 / 6
• Subtask 8: 6 / 6
• Subtask 9: 0 / 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