제출 #989549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989549		huutuan	Fish (IOI08_fish)	C++14	0 / 100	101 ms	10316 KiB

fish

#include<bits/stdc++.h>

using namespace std;

const int N=5e5+10;
int n, m, mod;
pair<int, int> a[N];
int cnt[N], cnt2[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);
   {
      int i=0;
      while (a[i+1].first*2<=a[n].first){
         ++i;
         ++cnt2[a[i].second];
      }
   }
   int ans=0;
   for (int i=1, j=0; i<=n; ++i){
      while (a[j+1].first*2<=a[i].first){
         ++j;
         ++cnt[a[j].second];
      }
      if (cnt[a[i].second]>cnt2[a[i].second]){
         int prod=1;
         for (int k=1; k<=m; ++k){
            if (k!=a[i].second) prod=1ll*prod*(cnt[k]+1)%mod;
         }
         ans=(ans+prod*(cnt[a[i].second]-cnt2[a[i].second]))%mod;
      }
   }
   ++cnt[a[n].second];
   int prod=1;
   for (int k=1; k<=m; ++k){
      prod=1ll*prod*(cnt[k]+1)%mod;
   }
   cout << (ans+prod+mod-1)%mod << '\n';
   return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 6
• Subtask 8: 0 / 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