Submission #91809

#	Time	Username	Problem	Language	Result	Execution time	Memory
91809		diamond_duke	Fish (IOI08_fish)	C++11	100 / 100	1129 ms	38136 KiB

fish

#include <algorithm>
#include <utility>
#include <cstdio>
#include <vector>
using ll = long long;
std::pair<int, int> arr[500005];
int idx[500005], seg[1000005], cnt, MOD;
bool app[500005];
std::vector<int> vec[500005];
void modify(int pos, int x)
{
	for (seg[pos += cnt] += x; pos; pos >>= 1)
		seg[pos >> 1] = (ll)seg[pos] * seg[pos ^ 1] % MOD;
}
int query(int l, int r)
{
	int res = 1;
	for (l += cnt, r += cnt + 1; l < r; l >>= 1, r >>= 1)
	{
		if (l & 1)
			res = (ll)res * seg[l++] % MOD;
		if (r & 1)
			res = (ll)res * seg[--r] % MOD;
	}
	return res;
}
int main()
{
	int n, ans = 0;
	scanf("%d%*d%d", &n, &MOD);
	for (int i = 0; i < n; i++)
		scanf("%d%d", &arr[i].first, &arr[i].second);
	std::sort(arr, arr + n);
	for (int i = n - 1; i >= 0; i--)
	{
		if (app[arr[i].second])
			continue;
		app[arr[i].second] = true;
		idx[arr[i].second] = cnt++;
	}
	for (int i = 0; i < n; i++)
	{
		arr[i].second = idx[arr[i].second];
		vec[arr[i].second].push_back(i);
	}
	for (int i = 0; i < cnt << 1; i++)
		seg[i] = 1;
	for (int i = 0, cur = 0; i < n; i++)
	{
		while (arr[cur].first << 1 <= arr[i].first)
			modify(arr[cur++].second, 1);
		if (vec[arr[i].second].back() != i)
			continue;
		modify(arr[i].second, -1);
		(ans += query(arr[i].second, cnt - 1)) >= MOD ? (ans -= MOD) : 0;
		int pos = -1;
		for (int x : vec[arr[i].second])
		{
			if (arr[x].first << 1 > arr[i].first)
			{
				pos = x;
				break;
			}
		}
		int l = 0, r = arr[i].second, res = -1;
		while (l <= r)
		{
			int m = l + r >> 1;
			if (arr[vec[m].back()].first < arr[pos].first << 1)
			{
				r = m - 1;
				res = m;
			}
			else
				l = m + 1;
		}
		ans = (ans + (ll)query(res, arr[i].second - 1) * query(arr[i].second + 1, cnt - 1)) % MOD;
		modify(arr[i].second, 1);
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message (stderr)

fish.cpp: In function 'int main()':
fish.cpp:68:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int m = l + r >> 1;
            ~~^~~
fish.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%*d%d", &n, &MOD);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &arr[i].first, &arr[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 6 / 6
• Subtask 8: 6 / 6
• Subtask 9: 6 / 6
• Subtask 10: 6 / 6
• Subtask 11: 7 / 7
• Subtask 12: 7 / 7
• Subtask 13: 7 / 7
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5