Submission #776545

# Submission time Handle Problem Language Result Execution time Memory
776545 2023-07-08T03:50:33 Z jamezzz Fish (IOI08_fish) C++17
0 / 100
327 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){
	int c=v[i].se;
	if(bad[c])continue;
	while(ptr>=0&&v[i].fi<2*v[ptr].fi){
	  --cnt[v[ptr].se];
	  --ptr;
	}
	vector<int> undo;
	for(int j=1;j<=k;++j){
	  if(v[i].se==j)continue;
	  int x=num[c][j];
	  if(!bad[j]||x==cnt[c]){
		mn[x+1]*=(cnt[j]+1);
		mn[x+1]%=m;
		undo.pb(x+1);
	  }
	}
	ll add=1;
	for(int j=1;j<=cnt[c]+1;++j){
	  add*=mn[j];
	  add%=m;
	  ans+=add;
	  ans%=m;
	}
	for(int x:undo)mn[x]=1;
	for(int j=1;j<=k;++j){
	  num[j][c]=cnt[j];
	}
	bad[c]=1;
	pf("%lld\n",ans);
  }
  pf("%lld\n",ans);
}

Compilation message

fish.cpp: In function 'int main()':
fish.cpp:24:5: 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:4: 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 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 4792 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 67 ms 24996 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 121 ms 21940 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 167 ms 31968 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 327 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 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 4 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 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 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -