Submission #617017

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

struct segtree
{
	static const int N = 1 << 17;
	int val[2 * N];

	void init()
	{
		for (int i = 0; i < 2 * N; ++i) val[i] = 0;
	}

	void update(int L, int R, int v)
	{
		L += N;
		R += N;
		while (L < R) {
			if (L & 1) val[L++] += v;
			if (R & 1) val[--R] += v;
			L >>= 1;
			R >>= 1;
		}
	}

	int at(int p)
	{
		p += N;
		int ret = 0;
		while (p) {
			ret += val[p];
			p >>= 1;
		}
		return ret;
	}

};

int N, L;
int T[101010], P[101010];
segtree seg;

int find_positive()
{
	int left = 0, right = L;
	while (left < right) {
		int mid = (left + right) / 2;

		if (seg.at(mid) > 0) {
			right = mid;
		} else {
			left = mid + 1;
		}
	}

	return left;
}

int main()
{
	scanf("%d%d", &N, &L);
	for (int i = 0; i < N; ++i) scanf("%d%d", T + i, P + i);

	for (int i = 0; i < N; ++i) {
		int i2 = i;
		while (i2 < N && T[i] == T[i2]) ++i2;

		reverse(T + i, T + i2);
		reverse(P + i, P + i2);

		i = i2 - 1;
	}

	seg.init();

	i64 top = 0;
	for (int i = 0; i < N; ++i) {
		top += P[i];

		seg.update(0, P[i], -1);
		seg.update(P[i], L + 1, 1);

		int pos = find_positive();
		seg.update(pos, L + 1, -1);

		//printf("%lld, ", top);
		//for (int j = 0; j < L; ++j) printf("%d ", seg.at(j)); puts("");
	}

	for (int i = 0; i < L; ++i) top += seg.at(i);
	printf("%lld\n", top);

	return 0;
}

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, &L);
                       ^
./Main.cpp:75:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < N; ++i) scanf("%d%d", T + i, P + i);
                                                         ^

Judge Result