Submission #1195003


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<vector>
#define N_ 201000
using namespace std;
int n, X, Y, F[N_], w[N_], C[N_], res;
int FF[N_], InvF[N_], Mod = 1000000007;
int UF[N_];
vector<int>G[N_];
int Find(int a){
    if(a==UF[a])return a;
    return UF[a] = Find(UF[a]);
}
void Make(int a, int b){
    if(a==b||b==-1)return;
    if(C[a]==C[b] && w[a]+w[b] > X)return;
    if(C[a]!=C[b] && w[a]+w[b] > Y)return;
    a = Find(a),b=Find(b);
    UF[a]=b;
}
int Pow(int a, int b){
    int r = 1;
    while(b){
        if(b&1)r=1ll*r*a%Mod;
        a=1ll*a*a%Mod;b>>=1;
    }
    return r;
}
int Get(vector<int>&P){
    sort(P.begin(),P.end());
    int i, m = P.size(), c = 0;
    int r = FF[m];
    for(i=0;i<m;i++){
        c++;
        if(i==m-1 || P[i]!=P[i+1]){
            r = 1ll*r*InvF[c]%Mod;
            c = 0;
        }
    }
    return r;
}
int main(){
    int i;
    scanf("%d%d%d",&n,&X,&Y);
    for(i=1;i<=n;i++){
        UF[i] = i;
        scanf("%d%d",&C[i],&w[i]);
        if(!F[C[i]] || w[F[C[i]]] > w[i]) F[C[i]] = i;
    }
    int M1 = 1e9, M2 = 1e9, t1 = -1, t2 = -1;
    for(i=1;i<=n;i++){
        if(!F[i])continue;
        if(M1 > F[i]){
            M2 = M1, t2 = t1;
            M1 = F[i], t1 = i;
        }
        else if(M2 > F[i])M2 = F[i],t2 = i;
    }
    for(i=1;i<=n;i++){
        Make(i, F[C[i]]);
        Make(i, t1);
        Make(i, t2);
    }
    FF[0] = 1;
    for(i=1;i<=n;i++)FF[i] = 1ll*FF[i-1]*i%Mod;
    InvF[n] = Pow(FF[n],Mod-2);
    for(i=n;i>=1;i--)InvF[i-1] = 1ll*InvF[i]*i%Mod;
    for(i=1;i<=n;i++){
        G[Find(i)].push_back(C[i]);
    }
    res = 1;
    for(i=1;i<=n;i++){
        if(!G[i].empty()) res = 1ll*res*Get(G[i])%Mod;
    }
    printf("%d\n",res);
}

Submission Info

Submission Time
Task D - Colorful Balls
User ainta
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1790 Byte
Status WA
Exec Time 79 ms
Memory 15872 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:29: 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:47:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&C[i],&w[i]);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 3
AC × 17
WA × 40
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 8448 KB
00_example_02.txt AC 4 ms 8448 KB
00_example_03.txt AC 4 ms 8448 KB
01.txt AC 4 ms 8448 KB
02.txt WA 4 ms 8448 KB
03.txt WA 6 ms 8448 KB
04.txt AC 4 ms 8448 KB
05.txt WA 4 ms 8448 KB
06.txt AC 4 ms 8448 KB
07.txt WA 36 ms 9852 KB
08.txt AC 4 ms 8448 KB
09.txt WA 20 ms 8832 KB
10.txt WA 14 ms 8704 KB
11.txt WA 4 ms 8448 KB
12.txt WA 4 ms 8448 KB
13.txt AC 6 ms 8576 KB
14.txt AC 4 ms 8448 KB
15.txt WA 16 ms 8960 KB
16.txt WA 36 ms 11008 KB
17.txt WA 8 ms 8576 KB
18.txt WA 17 ms 8976 KB
19.txt WA 31 ms 9852 KB
20.txt WA 76 ms 12792 KB
21.txt WA 74 ms 13560 KB
22.txt WA 74 ms 15232 KB
23.txt WA 72 ms 11512 KB
24.txt WA 70 ms 15616 KB
25.txt WA 77 ms 12664 KB
26.txt AC 73 ms 11260 KB
27.txt AC 79 ms 13696 KB
28.txt WA 74 ms 11256 KB
29.txt WA 76 ms 12280 KB
30.txt WA 72 ms 15872 KB
31.txt WA 73 ms 11256 KB
32.txt WA 75 ms 14848 KB
33.txt AC 76 ms 11384 KB
34.txt AC 68 ms 10996 KB
35.txt WA 65 ms 12664 KB
36.txt WA 66 ms 11904 KB
37.txt WA 67 ms 13048 KB
38.txt WA 64 ms 13952 KB
39.txt AC 64 ms 11768 KB
40.txt WA 66 ms 10996 KB
41.txt WA 73 ms 13048 KB
42.txt WA 68 ms 15872 KB
43.txt WA 69 ms 15360 KB
44.txt WA 68 ms 11640 KB
45.txt WA 67 ms 15872 KB
46.txt WA 76 ms 14464 KB
47.txt AC 57 ms 12024 KB
48.txt AC 61 ms 13176 KB
49.txt AC 59 ms 12024 KB
50.txt WA 60 ms 14332 KB
51.txt WA 61 ms 15488 KB
52.txt WA 54 ms 12024 KB
53.txt WA 54 ms 11896 KB
54.txt WA 54 ms 12024 KB