Submission #1218324

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <unordered_set>
#include <complex>
using namespace std;

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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
// typedef complex<double> C;

int MOD;
const int _MOD = 1000000009;
const int INF = INT_MAX / 2;
double EPS = 1e-10;

template <class Monoid>
struct segtree4 {
	using T = typename Monoid::T;
	int N;
	vector<T> a;
	segtree4(const vector<T> &a0) {
		for (N = 1; N < a0.size(); N<<=1);
		a.resize(N<<1);
		copy(a0.begin(), a0.end(), a.begin() + N);
		for (int i = N - 1; i; i--)
			a[i] = Monoid::op(a[i<<1], a[i<<1 | 1]);
	}
	segtree4(int N, const T &x = Monoid::id()) :
		segtree4(vector<T>(N, x)) {}
	T get(int l, int r) {
		T xl = Monoid::id(), xr = Monoid::id();
		for (l |= N, r |= N; l < r; l>>=1, r>>=1) {
			if (l & 1) xl = Monoid::op(xl, a[l++]);
			if (r & 1) xr = Monoid::op(a[--r], xr);
		}
		return Monoid::op(xl, xr);
	}
	void set(int i, const T &x) {
		a[i |= N] = x;
		while (i>>=1) a[i] = Monoid::op(a[i<<1], a[i<<1 | 1]);
	}
};

struct unko { ll x, y; };

struct yahoo {
	using T = unko;
	static T id() { return unko{0, 0}; }
	static T op(const T &l, const T &r) {
		return unko{l.x + max(0LL, r.x - l.y), r.y + max(0LL, l.y - r.x)};
	}
};

int main() {
	int Q, y; cin >> Q >> y;
	vector<int> q(Q), t(Q), x(Q);
	rep(k, Q) {
		scanf("%d%d", &q[k], &t[k]);
		if (q[k] == 1) scanf("%d", &x[k]);
	}
	vector<i_i> p(Q);
	rep(k, Q) p[k] = i_i(t[k], q[k] == 1 ? ~k : k);
	sort(p.begin(), p.end());
	vector<int> index(Q);
	rep(i, Q) {
		int k = p[i].second;
		if (k < 0) k = ~k;
		index[k] = i;
	}
	int prev = 0;
	vector<unko> a(Q * 2);
	rep(i, Q) {
		a[i * 2] = unko{0, (ll)(p[i].first - prev) * y};
		prev = p[i].first;
	}
	segtree4<yahoo> st(a);
	rep(k, Q) {
		if (q[k] == 1) st.set(index[k] * 2 + 1, unko{x[k], 0});
		if (q[k] == 2) {
			ll z = st.get(0, index[k] * 2 + 1).y;
			printf("%lld\n", (ll)t[k] * y - z);
		}
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:84:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &q[k], &t[k]);
                              ^
./Main.cpp:85:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   if (q[k] == 1) scanf("%d", &x[k]);
                                    ^

Judge Result