Submission #2600590

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef pair<ll, int> ll_i;

ll INF = LLONG_MAX / 10;

ll D, ans = 0;
set<ll_i> st;

ll f(ll l, ll r) {
	if (l == r) return 0;
	if (r - l - 1 <= D) return r - l;
	return 1;
}

void my_insert(ll x, int i) {
	auto it = st.upper_bound({x, i});
	ll xr = it->first;
	it--;
	ll xl = it->first;
	ans -= f(xl, xr);
	ans += f(xl, x) + f(x, xr);
	st.insert({x, i});
}

void my_erase(ll x, int i) {
	auto it = st.lower_bound({x, i});
	it--;
	ll xl = it->first;
	it++, it++;
	ll xr = it->first;
	it--;
	ans -= f(xl, x) + f(x, xr);
	ans += f(xl, xr);
	st.erase(it);
}

int main() {
	ll Y, W; cin >> Y >> W;
	int N, M; cin >> N >> M;
	cin >> D;
	vector<ll> a(N);
	rep(i, N) cin >> a[i], a[i]--;
	vector<ll> b(M), c(M);
	rep(j, M) scanf("%lld%lld", &b[j], &c[j]), b[j]--, c[j]--;
	vector<vector<int>> events(W);
	rep(j, M) events[c[j]].pb(j);
	st.insert({-INF, 0});
	st.insert({INF, 0});
	rep(i, N) my_insert(a[i], i);
	rep(j, M) my_insert(b[j] * W + c[j], ~j);
	rep(t, W) {
		printf("%lld\n", ans);
		rep(i, N) my_erase(a[i] + t, i);
		rep(i, N) my_insert(a[i] + t + 1, i);
		for (int j: events[t]) {
			my_erase(b[j] * W + c[j], ~j);
			my_insert(b[j] * W + c[j] + W, ~j);
		}
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:50:59: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(j, M) scanf("%lld%lld", &b[j], &c[j]), b[j]--, c[j]--;
                                                           ^

Judge Result