Submission #1674809


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
	x=0;int f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	x*=f;
}
inline void judge(){
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=200005;
int X,Y,n;
struct info{
	int w,c;
	inline void init(){read(c);read(w);}
}a[maxn];
inline bool operator < (const info &a,const info &b){
	return a.c<b.c||(a.c==b.c&&a.w<b.w);
}
priority_queue<pin,vector<pin>,greater<pin> > heap;
int fac[maxn],v[maxn],id2,lv1,lv2;
int facinv[maxn];
const int mod=1e9+7;
inline int powmod(int a,int b){
	int res=1;for(;b;b>>=1){
		if(b&1)res=1ll*res*a%mod;
		a=1ll*a*a%mod;
	}return res;
}
inline void prprpr(){
	fac[0]=1;
	rep(i,1,200000)fac[i]=1ll*fac[i-1]*i%mod;
	facinv[200000]=powmod(fac[200000],mod-2);
	per(i,200000-1,0)facinv[i]=1ll*facinv[i+1]*(i+1)%mod;
}
int mini[maxn],m1,m2,t,sz[maxn],sum[maxn];
int main(){
    prprpr();
    read(n);read(X);read(Y);
    rep(i,1,n)a[i].init();
    sort(a+1,a+1+n);
    memset(mini,60,sizeof(mini));
 	rep(i,1,n)mini[a[i].c]=min(mini[a[i].c],a[i].w);m1=m2=1e9;
 	rep(i,1,n)if(a[i].w<m1)m1=a[i].w,t=a[i].c;
 	rep(i,1,n)if(a[i].c!=t)m2=min(m2,a[i].w);
 	rep(i,1,n)if(a[i].w+mini[a[i].c]<=X)sz[a[i].c]++;
 	rep(i,1,n)if(a[i].w+m1<=Y&&a[i].c!=t||a[i].w+m2<=Y)sum[a[i].c]++;int res=1,tot=0;
 	rep(i,1,n)if(sum[i]||i==t){
 		tot+=max(sum[i],sz[i]);
 		res=1ll*res*facinv[max(sum[i],sz[i])]%mod;
 	}
 	res=1ll*res*fac[tot]%mod;
    printf("%d\n",res);
    return 0;
}

Submission Info

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