Submission #2203757


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define MN 200005
using namespace std;
const int mod=1e9+7;
int n,x,y,cc,tt,tot,ttmp[MN],head[MN],sum[MN],inv[MN],c[MN],w[MN],num[MN];
bool vis[MN];
struct edge{int to,next;}g[MN<<4];
void ins(int u,int v){g[++cc].next=head[u];head[u]=cc;g[cc].to=v;}
void insw(int u,int v){ins(u,v);ins(v,u);}
vector<pair<int,int> >now[MN],minx;
void dfs(int u){
	++tt,ttmp[++tot]=c[u],++num[c[u]];vis[u]=1;
	for(int i=head[u];i;i=g[i].next)if(!vis[g[i].to])dfs(g[i].to);
}
int main(){
	scanf("%d%d%d",&n,&x,&y);
	sum[0]=sum[1]=inv[0]=inv[1]=1;
	for(int i=2;i<=n;i++)sum[i]=1ll*sum[i-1]*i%mod,inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
	for(int i=2;i<=n;i++)inv[i]=1ll*inv[i-1]*inv[i]%mod;
	for(int i=1;i<=n;i++)scanf("%d%d",&c[i],&w[i]),now[c[i]].push_back(make_pair(w[i],i));
	for(int i=1;i<=n;i++)if(now[i].size()){
		sort(now[i].begin(),now[i].end());minx.push_back(now[i][0]);
		for(int j=1;j<now[i].size();j++)if(now[i][j].first+now[i][0].first<=x)insw(now[i][j].second,now[i][0].second);
	}sort(minx.begin(),minx.end());
	if(minx.size()){
		int tmp=minx[0].second;
		for(int i=1;i<=n;i++)if(c[i]!=c[tmp]&&w[i]+w[tmp]<=y)insw(tmp,i);
	}
	if(minx.size()>1){
		int tmp=minx[1].second,nowmin=c[minx[0].second];
		for(int i=0;i<now[nowmin].size();i++)if(w[tmp]+now[nowmin][i].first<=y)insw(now[nowmin][i].second,tmp);
	}
	dfs(minx[0].second);long long ans=sum[tt];
	for(int i=1;i<=tot;i++)ans=ans*inv[num[ttmp[i]]]%mod,num[ttmp[i]]=0;printf("%lld\n",ans);
}

Submission Info

Submission Time
Task D - Colorful Balls
User vjudge4
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1511 Byte
Status AC
Exec Time 88 ms
Memory 22388 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&x,&y);
                          ^
./Main.cpp:23:87: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++)scanf("%d%d",&c[i],&w[i]),now[c[i]].push_back(make_pair(w[i],i));
                                                                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 57
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 4 ms 12544 KB
00_example_02.txt AC 4 ms 12544 KB
00_example_03.txt AC 4 ms 12544 KB
01.txt AC 4 ms 12544 KB
02.txt AC 4 ms 12544 KB
03.txt AC 7 ms 12672 KB
04.txt AC 4 ms 12544 KB
05.txt AC 5 ms 12672 KB
06.txt AC 4 ms 12544 KB
07.txt AC 36 ms 16632 KB
08.txt AC 5 ms 12544 KB
09.txt AC 20 ms 15360 KB
10.txt AC 15 ms 13184 KB
11.txt AC 4 ms 12544 KB
12.txt AC 4 ms 12544 KB
13.txt AC 7 ms 12800 KB
14.txt AC 4 ms 12544 KB
15.txt AC 19 ms 13824 KB
16.txt AC 35 ms 14844 KB
17.txt AC 9 ms 12800 KB
18.txt AC 16 ms 13184 KB
19.txt AC 30 ms 13952 KB
20.txt AC 88 ms 20084 KB
21.txt AC 81 ms 18040 KB
22.txt AC 81 ms 17912 KB
23.txt AC 80 ms 20344 KB
24.txt AC 77 ms 17912 KB
25.txt AC 80 ms 20088 KB
26.txt AC 83 ms 20340 KB
27.txt AC 80 ms 17916 KB
28.txt AC 84 ms 22388 KB
29.txt AC 82 ms 20212 KB
30.txt AC 80 ms 17916 KB
31.txt AC 86 ms 20344 KB
32.txt AC 82 ms 17916 KB
33.txt AC 83 ms 20344 KB
34.txt AC 78 ms 20212 KB
35.txt AC 65 ms 17280 KB
36.txt AC 69 ms 17920 KB
37.txt AC 64 ms 17664 KB
38.txt AC 66 ms 17152 KB
39.txt AC 66 ms 17280 KB
40.txt AC 81 ms 20724 KB
41.txt AC 79 ms 20468 KB
42.txt AC 77 ms 19192 KB
43.txt AC 75 ms 19192 KB
44.txt AC 78 ms 20724 KB
45.txt AC 77 ms 19192 KB
46.txt AC 80 ms 20468 KB
47.txt AC 63 ms 16496 KB
48.txt AC 62 ms 14708 KB
49.txt AC 64 ms 16496 KB
50.txt AC 61 ms 19700 KB
51.txt AC 62 ms 19572 KB
52.txt AC 57 ms 16756 KB
53.txt AC 56 ms 16628 KB
54.txt AC 57 ms 16756 KB