Submission #2097575

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef vector<pii> vpii;
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
    tree_order_statistics_node_update> ost;

const int N=210000;
const ll P=1e9+7;
const ll INFTY=1e18;

vll b[N];
ll f[N], invf[N];

ll pw(ll x, ll n) {
    ll ans=1;
    while(n) {
        if(n&1) ans=ans*x%P, n--;
        x=x*x%P, n/=2;
    }
    return ans;
}

int main() {
    ll i, j, k, m, n, x, y, c, w, ans;
    scanf("%lld%lld%lld", &n, &x, &y);
    f[0]=invf[0]=1;
    for(i=1; i<=n; i++) {
        f[i]=f[i-1]*i%P;
        invf[i]=pw(f[i], P-2);
    }
    for(i=0; i<n; i++) {
        scanf("%lld%lld", &c, &w);
        b[c-1].pb(w);
        b[i].pb(INFTY);
    }
    for(i=0; i<n; i++) sort(all(b[i]));
    sort(b, b+n, [](vll &v1, vll &v2) {
        return v1[0]<v2[0];
    });
    for(k=n-1; k>0 && b[k][0]+b[0][0]>y; k--);
    if(k>0) k++;
    ans=1;
    for(m=i=0; i<k; i++) {
        for(j=1; ; j++) {
            c=(i==0);
            if(b[i][j]+b[i][0]>x && b[i][j]+b[c][0]>y)
                break;
        }
        m+=j;
        ans=ans*invf[j]%P;
    }
    ans=ans*f[m]%P;
    printf("%lld\n", ans);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld", &n, &x, &y);
                                      ^
./Main.cpp:46:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld", &c, &w);
                                  ^

Judge Result