Submission #776527

# Submission time Handle Problem Language Result Execution time Memory
776527 2023-07-08T03:21:00 Z jamezzz Fish (IOI08_fish) C++17
63 / 100
269 ms 65536 KB
#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];
ll mn[maxn];
vector<ii> v;

int main(){
	sf("%d%d%d",&n,&k,&m);
	assert(n<=500000&&k<=7000);
	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;
	ll 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(num[v[i].se][j]<=cnt[v[i].se]+1){
				mn[num[v[i].se][j]+1]*=(cnt[j]+1);
				mn[num[v[i].se][j]+1]%=m;
			}
		}
		ll add=1;
		for(int j=1;j<=cnt[v[i].se]+1;++j){
			add*=mn[j];
			add%=m;
			ans+=add;
			ans%=m;
		}
		for(int j=1;j<=k;++j){
			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("%lld\n",ans);
}

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

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:24:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  sf("%d%d%d",&n,&k,&m);
      |    ^
fish.cpp:28:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |   sf("%d%d",&l,&c);
      |     ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 108 ms 8312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 45 ms 4800 KB Output is correct
2 Correct 57 ms 5272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 58 ms 24968 KB Output is correct
2 Correct 12 ms 8356 KB Output is correct
3 Correct 47 ms 18516 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 102 ms 21992 KB Output is correct
2 Correct 204 ms 38248 KB Output is correct
3 Correct 207 ms 45552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 167 ms 32088 KB Output is correct
2 Correct 238 ms 48248 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 269 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 396 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 404 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -