제출 #776517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776517		jamezzz	Fish (IOI08_fish)	C++17	56 / 100	266 ms	65536 KiB

fish

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define LINF 1023456789123456789
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,int> li;

#define maxn 500005
#define maxk 7005

int n,k,m,cnt[maxk],bad[maxk],num[maxk][maxk],mn[maxn];
vector<ii> v;

int main(){
	sf("%d%d%d",&n,&k,&m);
	for(int i=0;i<n;++i){
		int l,c;
		sf("%d%d",&l,&c);
		v.pb({l,c});
		++cnt[c];
	}
	sort(all(v));
	int ptr=n-1;
	int ans=0;
	fill(mn,mn+n+1,1);
	for(int i=n-1;i>=0;--i){
		if(bad[v[i].se])continue;
		while(ptr>=0&&v[i].fi<2*v[ptr].fi){
			--cnt[v[ptr].se];
			--ptr;
		}
		for(int j=1;j<=k;++j){
			if(v[i].se==j)continue;
			if(!bad[j]){
				mn[1]*=(cnt[j]+1);
				#ifndef DEBUG
				mn[1]%=m;
				#endif
			}
			else if(cnt[j]!=0&&num[v[i].se][j]<=cnt[v[i].se]+1){
				mn[num[v[i].se][j]+1]*=(cnt[j]+1);
				#ifndef DEBUG
				mn[num[v[i].se][j]+1]%=m;
				#endif
			}
		}
		int add=1;
		for(int j=1;j<=cnt[v[i].se]+1;++j){
			add*=mn[j];
			#ifndef DEBUG
			add%=m;
			#endif
			ans+=add;
			#ifndef DEBUG
			ans%=m;
			#endif
		}
		for(int j=1;j<=k;++j){
			mn[1]=1;
			mn[num[v[i].se][j]+1]=1;
		}
		for(int j=1;j<=k;++j){
			num[j][v[i].se]=cnt[j];
		}
		bad[v[i].se]=1;
	}
	pf("%d\n",ans);
}

/*
5
3
7
2 2
4 1
8 3
4 1
2 3
*/

컴파일 시 표준 에러 (stderr) 메시지

fish.cpp: In function 'int main()':
fish.cpp:23:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |  sf("%d%d%d",&n,&k,&m);
      |    ^
fish.cpp:26:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   sf("%d%d",&l,&c);
      |     ^

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