제출 #165384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165384		faremy	Fish (IOI08_fish)	C++14	0 / 100	69 ms	65540 KiB

fish

#include <iostream>
#include <algorithm>
#include <stack>


struct Fish
{
	int length, jewel;
	bool operator <(const Fish &other) const
	{
		return (other.length < length);
	}
};

const int MAXN = 5e5;
const int LEAVES = 1 << 19;
const int TSIZE = LEAVES << 1;

Fish lake[MAXN];
int ofMaxLength[MAXN];
std::stack<int> ate[MAXN];
int previousPopped[MAXN];

int order[MAXN], revOrder[MAXN];
int combinations[TSIZE];


void update(int pos, int val, int modulo)
{
	pos += LEAVES;
	combinations[pos] = val % modulo;

	for (pos /= 2; pos > 0; pos /= 2)
		combinations[pos] = (combinations[pos * 2] * combinations[pos * 2 + 1]) % modulo;
}

int prod(int left, int right, int modulo)
{
	int res = 1;
	left += LEAVES;
	right += LEAVES;
	
	while (left < right)
	{
		if (left % 2 == 1)
			res = (res * combinations[left++]) % modulo;
		if (right % 2 == 1)
			res = (res * combinations[--right]) % modulo;
		left /= 2;
		right /= 2;
	}

	return res;
}

int search(int left, int right, int value)
{
	if (left == right)
		return right;
	int middle = (left + right) / 2;

	if (lake[ofMaxLength[order[middle]]].length < value)
		return search(middle + 1, right, value);
	return search(left, middle, value);
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cout.tie(nullptr);
	std::cin.tie(nullptr);

	int fishes, jewelTypes, modulo;
	std::cin >> fishes >> jewelTypes >> modulo;

	for (int iFish = 0; iFish < fishes; iFish++)
	{
		std::cin >> lake[iFish].length >> lake[iFish].jewel;
		lake[iFish].jewel--;
	}

	std::sort(lake, lake + fishes);
	std::fill_n(ofMaxLength, jewelTypes, fishes);

	for (int iFish = 0; iFish < fishes; iFish++)
	{
		int type = lake[iFish].jewel;
		if (ofMaxLength[type] == fishes)
			ofMaxLength[type] = iFish;
	}

	for (int iType = 0; iType < jewelTypes; iType++)
		order[iType] = iType;
	std::sort(order, order + jewelTypes, [](int a, int b) { return (lake[ofMaxLength[a]].length > lake[ofMaxLength[b]].length); });

	for (int iType = 0; iType < jewelTypes; iType++)
	{
		revOrder[order[iType]] = iType;
		ate[iType].emplace(0);
	}
	
	std::fill_n(combinations, TSIZE, 1);
	for (int iFish = fishes - 1; iFish > -1; iFish--)
	{
		int type = lake[iFish].jewel;
		ate[type].emplace(lake[iFish - 1].length * 2);
		update(revOrder[type], ate[type].size(), modulo);
	}

	int answer = 0, lastFish = 0;
	for (int iType = 0; iType < jewelTypes; iType++)
	{
		int type = order[iType];
		while (lastFish < fishes && lake[lastFish].length * 2 > lake[ofMaxLength[type]].length)
		{
			int removetype = lake[lastFish++].jewel;
			previousPopped[removetype] = ate[removetype].top();
			ate[removetype].pop();
			update(revOrder[removetype], ate[removetype].size(), modulo);
		}

		int remove = search(0, iType, previousPopped[type]);
		answer = (answer + prod(remove, iType, modulo) * prod(iType + 1, jewelTypes, modulo)) % modulo;
		answer = (answer + ((ate[type].size() - 1) % modulo) * prod(iType + 1, jewelTypes, modulo)) % modulo;
	}

	std::cout << answer << '\n';

	return 0;
}

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