Submission #3882556

---

Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 100055;
const int MM = 1000000007;

struct BIT{
	int t[MX];
	int read(int x){
		int r = 0;
		while(x) r = (r + t[x]) % MM, x -= x&-x;
		return r;
	}
	void update(int x, int v){
		while(x < MX) t[x] = (t[x] + v) % MM, x += x&-x;
	}
} tree;

vector<int> X, Y;
int N, M;

int main()
{
	scanf("%d%d", &N, &M);
	for(int i = 1; i <= N; i++){
		int a;
		scanf("%d", &a);
		X.push_back(a);
	}
	for(int i = 1; i <= M; i++){
		int a;
		scanf("%d", &a);
		Y.push_back(a);
	}
	vector<pii> D;
	vector<int> Cy;
	for(int x : X){
		int y = lower_bound(Y.begin(), Y.end(), x) - Y.begin();
		if(y == 0 || y == Y.size()) continue;
		D.emplace_back(x - Y[y-1], Y[y] - x);
		Cy.push_back(Y[y] - x);
	}
	sort(D.begin(), D.end());
	D.resize(unique(D.begin(), D.end()) - D.begin());
	sort(Cy.begin(), Cy.end());
	for(pii &c : D){
		c.second = upper_bound(Cy.begin(), Cy.end(), c.second) - Cy.begin() + 1;
	}
	sort(D.begin(), D.end(), [](pii l, pii r){
		return l.first < r.first || l.first == r.first && l.second > r.second;
	});

	tree.update(1, 1);
	for(int i = 0, j = 0; i < D.size(); i = j){
		for(; j < D.size(); j++){
			if(D[i].first != D[j].first) break;
			tree.update(D[j].second, tree.read(D[j].second-1));
		}
	}
	printf("%d\n", tree.read(MX-1));
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:74:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
./Main.cpp:77:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a);
                  ^
./Main.cpp:82:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a);
                  ^

Judge Result