Submission #1886918

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <ctime>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;

const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL) INF;

const int MAX = 10 * 100 * 1000 + 47;
const double EPS = 1e-8;
const int MOD = 1000 * 1000 * 1000 + 7;




int C[MAX], W[MAX];
int A[MAX];
PII B[MAX];
int P[MAX];
map<int, int> CNT[MAX];
LL F[MAX], IF[MAX];

int find(int v)
{
    if (v == P[v])return v;
    return P[v] = find(P[v]);
}


void unite(int a, int b)
{
    a = find(a);
    b = find(b);
    if (a == b)return ;
    if (rand() & 1)swap(a, b);
    P[a] = b;
}

LL BP(LL a, int n)
{
    LL res= 1;
    while(n)
    {
        if (n & 1)res = (res * a) % MOD;
        a = (a * a) % MOD;
        n >>= 1 ;
    }
    return res;
}



int main()
{


    F[0] = 1;
    IF[0] = 1;
    FOR(i, 1, MAX)
    {
        F[i] = F[i-1] * i % MOD;
        IF[i] = BP(F[i], MOD-2);
    }

    int n, X, Y;
    scanf("%d%d%d", &n, &X, &Y);
    W[0] = INF;
    FOR(i, 1, n+1)
    {
        scanf("%d%d", C + i, W + i);
        if (W[i] < W[A[C[i]]])A[C[i]] = i;
    }
    FOR(i, 1, n+1)
        B[i] = MP(W[A[i]], A[i]);

    FOR(i, 1, n + 1)P[i] = i;

    sort(B + 1, B + n + 1);

    int x = B[1].second;
    int y = B[2].second;

    //cout << x << " " << y << endl;

    FOR(i, 1, n + 1)
    {
        if (C[i] != C[x] && W[i] + W[x] <= Y)unite(x, i);
        if (W[i] + W[A[C[i]]] <= X)unite(A[C[i]], i);
        if (C[i] == C[x] && W[i] + W[y] <= Y)unite(y, i);
    }

    //FOR(i, 1, n + 1)
    //{
     //   cout << i << " : " << find(i) << endl;
    //}

    FOR(i, 1, n+1)
        CNT[find(i)][C[i]]++;

    LL ans = 1;
    FOR(i, 1, n+1)
    {
        LL cnt = 0;
        ITER(it, CNT[i])
        {
            ans = (ans * IF[it->second]) % MOD;
            cnt += it->second;
        }
        ans *= F[cnt];
        ans %= MOD;
    }
    printf("%lld\n", ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:97:32: 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:101:36: 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