Submission #1678972


Source Code Expand

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>

#define For(i,x,y) for (int i=x;i<y;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lf else if

#define dprintf(...) fprintf(stderr,__VA_ARGS__)
using namespace std;

typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> Vi;

int IN(){
	int c,f,x;
	while (!isdigit(c=getchar())&&c!='-');c=='-'?(f=1,x=0):(f=0,x=c-'0');
	while (isdigit(c=getchar())) x=(x<<1)+(x<<3)+c-'0';return !f?x:-x;
}

const int N=200000+19;
const int p=1e9+7;
const int oo=(1<<30)-1;

int Pow(int a,int b){
	int res=1;
	for (;b;b>>=1,a=1ll*a*a%p) if (b&1) res=1ll*res*a%p;
	return res;
}

int c[N],w[N],mn[N],wei[N],fac[N],inv[N],val[N];
int X,Y,amn,n,ans,m,id,ase;

int main(){
	//freopen("1.in","r",stdin);
	fac[0]=1;
	For(i,1,N) fac[i]=1ll*fac[i-1]*i%p;
	inv[N-1]=Pow(fac[N-1],p-2);
	for (int i=N-1;i;i--) inv[i-1]=1ll*inv[i]*i%p;
	amn=oo;ase=oo;
	For(i,0,N) mn[i]=oo;
	n=IN(),X=IN(),Y=IN();
	For(i,1,n+1){
		c[i]=IN(),w[i]=IN();
		if (w[i]<amn){
			ase=amn;
			amn=w[i];
			id=c[i];
		} lf (w[i]<ase){
			ase=w[i];
		}
		mn[c[i]]=min(mn[c[i]],w[i]);
	}
	For(i,1,n+1)
		if (c[i]==id){
			if (w[i]+amn<=X&&amn+ase<=Y||w[i]+ase<=Y){
				m++;
				val[c[i]]++;
			}
		} else{
			if (w[i]+amn<=Y||w[i]+mn[c[i]]<=X&&mn[c[i]]+amn<=Y){
				m++;
				val[c[i]]++;
			}
		}
	ans=fac[m];
	For(i,0,N) ans=1ll*ans*inv[val[i]]%p;
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task D - Colorful Balls
User rxdoi
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1712 Byte
Status AC
Exec Time 33 ms
Memory 5760 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 5 ms 3584 KB
00_example_02.txt AC 5 ms 3584 KB
00_example_03.txt AC 5 ms 3584 KB
01.txt AC 5 ms 3584 KB
02.txt AC 5 ms 3584 KB
03.txt AC 6 ms 3584 KB
04.txt AC 5 ms 3584 KB
05.txt AC 5 ms 3584 KB
06.txt AC 5 ms 3584 KB
07.txt AC 16 ms 4224 KB
08.txt AC 5 ms 3584 KB
09.txt AC 10 ms 3840 KB
10.txt AC 8 ms 3712 KB
11.txt AC 5 ms 3584 KB
12.txt AC 5 ms 3584 KB
13.txt AC 6 ms 3584 KB
14.txt AC 5 ms 3584 KB
15.txt AC 9 ms 3840 KB
16.txt AC 16 ms 4352 KB
17.txt AC 7 ms 3584 KB
18.txt AC 9 ms 3712 KB
19.txt AC 14 ms 4096 KB
20.txt AC 30 ms 5760 KB
21.txt AC 29 ms 5760 KB
22.txt AC 29 ms 5760 KB
23.txt AC 28 ms 5760 KB
24.txt AC 33 ms 5760 KB
25.txt AC 32 ms 5760 KB
26.txt AC 30 ms 5760 KB
27.txt AC 33 ms 4992 KB
28.txt AC 30 ms 5760 KB
29.txt AC 31 ms 5760 KB
30.txt AC 32 ms 5760 KB
31.txt AC 33 ms 5760 KB
32.txt AC 31 ms 5760 KB
33.txt AC 30 ms 5760 KB
34.txt AC 29 ms 5760 KB
35.txt AC 31 ms 5120 KB
36.txt AC 30 ms 5760 KB
37.txt AC 31 ms 5504 KB
38.txt AC 33 ms 5120 KB
39.txt AC 31 ms 5760 KB
40.txt AC 30 ms 5760 KB
41.txt AC 29 ms 5760 KB
42.txt AC 30 ms 5760 KB
43.txt AC 31 ms 5760 KB
44.txt AC 30 ms 5760 KB
45.txt AC 28 ms 5760 KB
46.txt AC 29 ms 5760 KB
47.txt AC 26 ms 4992 KB
48.txt AC 28 ms 4992 KB
49.txt AC 28 ms 4992 KB
50.txt AC 23 ms 5376 KB
51.txt AC 25 ms 4992 KB
52.txt AC 22 ms 4992 KB
53.txt AC 22 ms 4992 KB
54.txt AC 22 ms 4992 KB