Submission #1671113


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define mod 1000000007

int n,x,y,c[N],w[N];
vector<pair<int,int> > q[N];
vector<int> v[N];
map<int,int> h;
long long e[N],ans;

void solve(int x){
	ans=ans*(++h[0])%mod*e[++h[c[x]]]%mod;c[x]=0;
	for (int i=0;i<(int)v[x].size();i++)
		if (c[v[x][i]]) solve(v[x][i]);
}


int read(){
	int x=0,f=1;char ch=getchar();
	for (;!isdigit(ch);ch=getchar()) if (ch=='-')  f=-f;
	for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
	return x*f;
}

int main(){
	n=read();x=read();y=read();
	for (int i=1;i<=n;i++){
		c[i]=read();w[i]=read();
		q[c[i]].push_back(make_pair(w[i],i));
	}
	for (int i=1;i<=n;i++)
		if (q[i].size()){
			sort(q[i].begin(),q[i].end());
			q[0].push_back(q[i][0]);
			for (int j=1;j<(int)q[i].size();j++)
				if (q[i][0].first+q[i][j].first<=x)
				v[q[i][0].second].push_back(q[i][j].second),
				v[q[i][j].second].push_back(q[i][0].second);
		}
	sort(q[0].begin(),q[0].end());
	for (int i=1;i<=n;i++)
		if (c[i]!=c[q[0][0].second]){
			if (w[i]+q[0][0].first<=y)
			v[i].push_back(q[0][0].second),
			v[q[0][0].second].push_back(i);
		}
		else {
			if (q[0].size()>=2&&w[i]+q[0][1].first<=y)
			v[i].push_back(q[0][1].second),
			v[q[0][1].second].push_back(i);
		}
	ans=e[1]=1;
	for (int i=2;i<=n;i++)
		e[i]=(-(mod/i)*e[mod%i]%mod+mod)%mod;
	for (int i=1;i<=n;i++)
		if (c[i]) solve(i),h.clear();
	printf("%lld\n",ans);return 0;
}

Submission Info

Submission Time
Task D - Colorful Balls
User Kuugo
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1465 Byte
Status AC
Exec Time 328 ms
Memory 78360 KB

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 19 ms 55552 KB
00_example_02.txt AC 19 ms 55552 KB
00_example_03.txt AC 18 ms 55552 KB
01.txt AC 19 ms 55552 KB
02.txt AC 18 ms 55552 KB
03.txt AC 23 ms 56064 KB
04.txt AC 19 ms 55552 KB
05.txt AC 20 ms 55808 KB
06.txt AC 19 ms 55552 KB
07.txt AC 71 ms 62072 KB
08.txt AC 19 ms 55552 KB
09.txt AC 40 ms 59004 KB
10.txt AC 36 ms 57728 KB
11.txt AC 19 ms 55552 KB
12.txt AC 19 ms 55552 KB
13.txt AC 23 ms 56192 KB
14.txt AC 19 ms 55552 KB
15.txt AC 44 ms 59388 KB
16.txt AC 62 ms 60152 KB
17.txt AC 27 ms 56576 KB
18.txt AC 37 ms 57728 KB
19.txt AC 56 ms 59644 KB
20.txt AC 143 ms 73716 KB
21.txt AC 133 ms 72952 KB
22.txt AC 116 ms 69492 KB
23.txt AC 150 ms 77476 KB
24.txt AC 110 ms 68852 KB
25.txt AC 143 ms 73844 KB
26.txt AC 154 ms 78068 KB
27.txt AC 115 ms 70132 KB
28.txt AC 162 ms 78068 KB
29.txt AC 158 ms 75892 KB
30.txt AC 107 ms 67584 KB
31.txt AC 160 ms 78196 KB
32.txt AC 123 ms 70644 KB
33.txt AC 159 ms 77812 KB
34.txt AC 148 ms 76532 KB
35.txt AC 93 ms 69236 KB
36.txt AC 116 ms 70780 KB
37.txt AC 95 ms 69496 KB
38.txt AC 93 ms 68984 KB
39.txt AC 104 ms 69772 KB
40.txt AC 144 ms 78324 KB
41.txt AC 132 ms 74096 KB
42.txt AC 127 ms 73460 KB
43.txt AC 109 ms 69748 KB
44.txt AC 328 ms 78360 KB
45.txt AC 106 ms 69248 KB
46.txt AC 130 ms 74224 KB
47.txt AC 89 ms 67952 KB
48.txt AC 86 ms 65392 KB
49.txt AC 88 ms 66672 KB
50.txt AC 85 ms 72820 KB
51.txt AC 76 ms 69364 KB
52.txt AC 83 ms 67572 KB
53.txt AC 83 ms 67572 KB
54.txt AC 84 ms 67572 KB