Submission #1316275
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
//=======================
vi g[N];
int a[N], col[N], w[N]; ll fac[N], inv[N];
bool f(int x, int y){
return w[x] < w[y];
}
map<int, int> cnt[N];
int par[N], sz[N];
int rep(int x){
if(x == par[x]) return x;
return par[x] = rep(par[x]);
}
void unite(int x, int y){
x = rep(x);
y = rep(y);
if(x == y) return;
if(sz[x]>sz[y]) swap(x, y);
par[x] = y;
sz[y] += sz[x] == sz[y];
}
int minof[N];
int tot[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i,n,k,j,x,y;
fac[0] = inv[0] = 1;
Fo(i, 1, N){
fac[i] = (i*fac[i-1])%mod;
inv[i] = (mpow(i, mod-2)*inv[i-1])%mod;
par[i] = i;
sz[i] = 1;
}
cin >> n >> x >> y;
Fo(i, 1, n+1){
cin >> col[i] >> w[i];
g[col[i]].pb(i);
}
Fo(i, 1, n+1){
//uniting of color[i]
minof[i] = mod;
if(g[i].empty()) continue;
sort(all(g[i]), f);
int base = g[i][0];
minof[i] = w[base];
for(int v: g[i]){
if(w[v]+w[base] <= x) unite(v, base);
}
}
int mn1, mn2;
mn1 = col[1], mn2 = col[2];
Fo(i, 1, n+1){
if(minof[col[i]] <= minof[mn1]){
mn2 = mn1;
mn1 = col[i];
}
else if(minof[col[i]] < minof[mn2]) mn2 = col[i];
}
int pos1, pos2 = -1;
Fo(i, 1, n+1){
if(col[i] == mn1 and w[i] == minof[mn1]) pos1 = i;
if(col[i] == mn2 and w[i] == minof[mn2]) pos2 = i;
}
//mn1, mn2 colors ki hai minimum
Fo(i, 1, n+1){
if(col[i] != mn1){
if(w[i]+minof[mn1] <= y) unite(i, pos1);
}
else if (pos2!=-1){
if(w[i]+minof[mn2] <= y) unite(i, pos2);
}
}
Fo(i, 1, n+1){
tot[rep(i)]++;
cnt[rep(i)][col[i]]++;
}
ll ans = 1, cur = 0;
Fo(i, 1, n+1){
if(i == rep(i)){
ans *= fac[tot[i]];
ans %= mod;
for(auto it: cnt[i]){
ans *= inv[it.S];
ans %= mod;
}
}
}
cout << ans << endl;
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int m){
int i, u, v;
fo(i, m){
cin>>u>>v;
u++, v++;
g[u-1].pb(v-1);
g[v-1].pb(u-1);
}
}
void dfs(int u, int par){
for(int v:g[u]){
if (v == par) continue;
dfs(v, u);
}
}
Submission Info
Submission Time |
|
Task |
D - Colorful Balls |
User |
rachitjain |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3258 Byte |
Status |
WA |
Exec Time |
192 ms |
Memory |
47488 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1000 |
Status |
|
|
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 |
59 ms |
32256 KB |
00_example_02.txt |
AC |
59 ms |
32256 KB |
00_example_03.txt |
AC |
59 ms |
32256 KB |
01.txt |
AC |
59 ms |
32256 KB |
02.txt |
AC |
59 ms |
32256 KB |
03.txt |
AC |
62 ms |
32512 KB |
04.txt |
AC |
59 ms |
32256 KB |
05.txt |
AC |
60 ms |
32384 KB |
06.txt |
AC |
59 ms |
32256 KB |
07.txt |
AC |
108 ms |
36736 KB |
08.txt |
AC |
59 ms |
32256 KB |
09.txt |
AC |
77 ms |
33152 KB |
10.txt |
AC |
73 ms |
33152 KB |
11.txt |
AC |
59 ms |
32256 KB |
12.txt |
AC |
59 ms |
32256 KB |
13.txt |
AC |
63 ms |
32640 KB |
14.txt |
AC |
59 ms |
32256 KB |
15.txt |
AC |
81 ms |
34688 KB |
16.txt |
AC |
102 ms |
38400 KB |
17.txt |
AC |
66 ms |
32768 KB |
18.txt |
AC |
76 ms |
33664 KB |
19.txt |
AC |
97 ms |
35584 KB |
20.txt |
AC |
175 ms |
45056 KB |
21.txt |
AC |
172 ms |
46336 KB |
22.txt |
AC |
158 ms |
46080 KB |
23.txt |
AC |
189 ms |
44672 KB |
24.txt |
AC |
152 ms |
46976 KB |
25.txt |
AC |
174 ms |
44544 KB |
26.txt |
AC |
187 ms |
44416 KB |
27.txt |
AC |
150 ms |
43904 KB |
28.txt |
AC |
192 ms |
44416 KB |
29.txt |
AC |
185 ms |
44800 KB |
30.txt |
AC |
146 ms |
47104 KB |
31.txt |
AC |
191 ms |
44288 KB |
32.txt |
AC |
160 ms |
45568 KB |
33.txt |
AC |
191 ms |
44544 KB |
34.txt |
AC |
176 ms |
42368 KB |
35.txt |
WA |
123 ms |
36992 KB |
36.txt |
AC |
150 ms |
37376 KB |
37.txt |
WA |
125 ms |
36992 KB |
38.txt |
WA |
123 ms |
36736 KB |
39.txt |
AC |
128 ms |
36864 KB |
40.txt |
AC |
152 ms |
44288 KB |
41.txt |
AC |
161 ms |
45824 KB |
42.txt |
AC |
155 ms |
46848 KB |
43.txt |
AC |
148 ms |
46720 KB |
44.txt |
AC |
172 ms |
45568 KB |
45.txt |
AC |
161 ms |
47488 KB |
46.txt |
AC |
159 ms |
45440 KB |
47.txt |
AC |
127 ms |
37620 KB |
48.txt |
AC |
131 ms |
38900 KB |
49.txt |
AC |
130 ms |
38644 KB |
50.txt |
AC |
116 ms |
41592 KB |
51.txt |
AC |
113 ms |
41592 KB |
52.txt |
AC |
119 ms |
38264 KB |
53.txt |
AC |
119 ms |
38264 KB |
54.txt |
AC |
119 ms |
38264 KB |