제출 #989536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989536		huutuan	Fish (IOI08_fish)	C++14	0 / 100	3038 ms	65536 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];
vector<int> vcnt[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 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];
      }
      int cur=1;
      vcnt[a[i].second].resize(m+1);
      for (int k=1; k<=m; ++k){
         int mult=cnt[k]-vcnt[a[i].second][k]+1;
         if (k==a[i].second && cnt[k]!=vcnt[a[i].second][k]) --mult;
         cur=1ll*cur*mult%mod;
         vcnt[a[i].second][k]=cnt[k];
      }
      ans=(ans+cur)%mod;
   }
   cout << ans << '\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