Submission #1517806

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;
const bool debug = 1;
//----------------------//

int N;
int a[112345], b[112345];

ll mod_pow(ll x, ll n, ll mod) {
	if (n == 0) return 1;
	ll res = mod_pow(x * x % mod, n / 2, mod);
	if (n & 1) res = res * x % mod;
	return res;
}

int main() {
	cin >> N;
	REP(i, N) scanf("%d", a + i);
	REP(i, N) scanf("%d", b + i);
	
	vector<pii> v;
	REP(i, N) v.push_back(pii(a[i], 1));
	REP(i, N) v.push_back(pii(b[i], 0));
	
	sort(ALL(v));
	
	ll ans = 1;
	int cnt = 0;
	
	REP(i, 2 * N) {
		if (v[i].se == 1) {
			if (cnt > 0) ans = ans * mod_pow(2, cnt - 1, MOD) % MOD;
			cnt--;
		}
		else {
			if (cnt < 0) ans = ans * mod_pow(2, -cnt - 1, MOD) % MOD;
			cnt++;
		}
	}
	
	cout << ans << endl;
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, N) scanf("%d", a + i);
                              ^
./Main.cpp:33:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, N) scanf("%d", b + i);
                              ^

Judge Result