Submission #1679648

---

Source Code Expand

#include <cstdio>
#include <cctype>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
#define repe(i,x) for (edge *i=fst[x]; i; i=i->nxt)
using namespace std;

typedef long long LL;
const int p=1e9+7;
int n,x,y,c[200100],w[200100],fa[200100],s[200100],minw[200100],min1,min2,cnt[200100],inv[200100];
struct edge
{
    int v;
    edge *nxt;
} pool[200100],*tp=pool,*fst[200100];

int getint()
{
    char ch;
    while (!isdigit(ch=getchar()));
    int x=ch-'0';
    for (; isdigit(ch=getchar()); x=x*10+ch-'0');
    return x;
}

int find(int x)
{
    if (fa[x]==x)
        return x;
    return fa[x]=find(fa[x]);
}

void merge(int u,int v)
{
    if ((u=find(u))==(v=find(v)))
        return;
    if (s[u]>s[v])
        swap(u,v);
    fa[u]=v,s[v]+=s[u];
}

int main()
{
    scanf("%d%d%d",&n,&x,&y),w[0]=1<<30;
    repu(i,1,n)
    {
        c[i]=getint(),w[i]=getint(),s[fa[i]=i]=1;
        if (w[i]<w[minw[c[i]]])
            minw[c[i]]=i;
        if (w[i]<w[min1])
        {
            if (c[i]!=c[min1])
                min2=min1;
            min1=i;
        }
        else
            if (w[i]<w[min2] && c[i]!=c[min1])
                min2=i;
    }
    repu(i,1,n)
    {
        if (w[i]+w[minw[c[i]]]<=x)
            merge(i,minw[c[i]]);
        int t=c[i]==c[min1]?min2:min1;
        if (w[i]+w[t]<=y)
            merge(i,t);
    }
    int ans=1;
    repu(i,1,n)
    {
        if (find(i)==i)
            repu(j,2,s[i])
                ans=LL(ans)*j%p;
        *tp=(edge){i,fst[fa[i]]},fst[fa[i]]=tp++;
    }
    inv[0]=inv[1]=1;
    repu(i,2,n)
        inv[i]=LL(p-p/i)*inv[p%i]%p;
    repu(i,1,n)
        if (fa[i]==i)
        {
            repe(j,i)
                ans=LL(ans)*inv[++cnt[c[j->v]]]%p;
            repe(j,i)
                cnt[c[j->v]]=0;
        }
    printf("%d\n",ans);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&x,&y),w[0]=1<<30;
                                        ^

Judge Result