제출 #989571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989571		huutuan	Fish (IOI08_fish)	C++14	16 / 100	3083 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], vis[N];

int calc_prod(){
   int prod=1;
   for (int k=1; k<=m; ++k) if (!vis[k]){
      prod=1ll*prod*(cnt[k]+1)%mod;
   }
   return prod;
}

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);
   set<vector<int>> st;
   for (int i=1, j=0; i<=n; ++i){
      while (a[j+1].first*2<=a[i].first){
         ++j;
      }
      for (int k=0; k<(1<<j); ++k){
         vector<int> cur{a[i].second};
         for (int l=0; l<j; ++l) if (k>>l&1) cur.push_back(a[l+1].second);
         sort(cur.begin(), cur.end());
         st.insert(cur);
      }
   }
   cout << ((int)st.size())%mod << '\n';
   return 0;
}

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