제출 #685701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685701		grossly_overconfident	Fish (IOI08_fish)	C++17	0 / 100	363 ms	4616 KiB

fish

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"

int main() {
	int f, k, m;
	vector<pair<int, int>> fish;
	cin >> f >> k >> m;
	for (int i = 0; i < f; ++i) {
		int a, b;
		cin >> a >> b;
		fish.push_back(make_pair(a, b));
	}
	sort(fish.begin(), fish.end());
	set<multiset<int>> s;
	set<multiset<int>> take;
	int current = fish[0].first;
	long long count = 0;
	for (auto i : fish) {
		if (i.first != current) {
			for (auto p = take.begin(); p != take.end(); ++p) {
				s.insert(*p);
				++count;
				count %= m;
			}
			take = {};
			current = i.first;
		}
		for (auto k = s.begin(); k != s.end(); ++k) {
			auto j = *k;
			j.insert(i.second);
			if (take.count(j) == 0 && s.count(j) == 0) {
				take.insert(j);
			}
		}
	}
	for (auto p : take) {
		s.insert(p);
		++count;
		count %= m;
	}
	cout << (count % m);



	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