제출 #880334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
880334		josanneo22	Fish (IOI08_fish)	C++17	0 / 100	223 ms	65536 KiB

fish

#include<bits/stdc++.h>
using namespace std;
int main(){
	int F,K,M;
	cin>>F>>K>>M;
	vector<vector<int>> cnt(F+1,vector<int>(K+1));
	vector<pair<int,int>> a;
	for(int i=0;i<F;i++){
		int len,gem; cin>>len>>gem;
		a.push_back(make_pair(len,gem));
	}
	sort(a.begin(),a.end());
	for(int i=0;i<F;i++){
		cnt[i][a[i].second]++;
		for(int j=0;j<i;j++){
			if(a[j].first*2<=a[i].first){
				for(int k=0;k<=K;k++){
					cnt[i][k]+=cnt[j][k];
					cnt[j][k]=0;
				}
			}
		}
	}
	int ans=0;
	for(int i=0;i<F;i++){
		int t=1;
		for(int j=0;j<=K;j++){
			t*=(cnt[i][j]+1); 
			t%=M;
		}
		if(t<0) t+=M;
		ans+=(t-1);
	}
	ans-=1;
	if(ans<0) ans+=M;
	while(ans>=M) ans-=M;
	cout<<ans<<'\n';
}

• 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