Task: | Ryhmät |
Sender: | Metabolix |
Submission time: | 2025-10-04 15:50:14 +0300 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 25 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 10 |
#2 | ACCEPTED | 15 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.12 s | 2 | details |
#7 | ACCEPTED | 0.15 s | 2 | details |
#8 | ACCEPTED | 0.21 s | 2 | details |
#9 | ACCEPTED | 0.12 s | 2, 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 3 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <queue> #include <vector> #include <map> #include <algorithm> #include <array> #include <unordered_set> #include <set> using namespace std; struct Toive { int alku, loppu, indeksi; }; int main() { ios::sync_with_stdio(false); int n, t; cin >> n >> t; multimap<int, Toive> toiveet; for (int i = 0; i < n; i++) { Toive tmp; cin >> tmp.alku >> tmp.loppu; tmp.indeksi = i; toiveet.insert({tmp.alku, tmp}); } vector<bool> tulokset(t, true); vector<array<int, 3>> vaiheet; vector<unordered_set<int>> käytetyt(t); for (int testi = 0; testi < t; testi++) { int ryhmien_määrä; cin >> ryhmien_määrä; map<int, int> ryhmät; for (int i = 0; i < ryhmien_määrä; i++) { int ryhmän_koko; cin >> ryhmän_koko; ryhmät[ryhmän_koko] += ryhmän_koko; } for (auto &[koko, lapsimäärä] : ryhmät) { vaiheet.push_back({koko, lapsimäärä, testi}); } } ranges::sort(vaiheet); auto& toiveet_tulossa = toiveet; multimap<int, Toive> toiveet_alkaneet; for (auto &[koko, lapsimäärä, testi] : vaiheet) { if (tulokset[testi] == false) { continue; } while (!toiveet_tulossa.empty() && toiveet_tulossa.begin()->first <= koko) { auto toive = toiveet_tulossa.begin()->second; toiveet_alkaneet.insert({toive.loppu, toive}); toiveet_tulossa.erase(toiveet_tulossa.begin()); } while (!toiveet_alkaneet.empty() && toiveet_alkaneet.begin()->first < koko) { toiveet_alkaneet.erase(toiveet_alkaneet.begin()); } for (auto [loppu, toive] : toiveet_alkaneet) { if (käytetyt[testi].find(toive.indeksi) == käytetyt[testi].end()) { käytetyt[testi].insert(toive.indeksi); lapsimäärä--; if (lapsimäärä == 0) { break; } } } if (lapsimäärä > 0) { tulokset[testi] = false; } } for (auto tulos : tulokset) { if (tulos) { cout << "YES\n"; } else { cout << "NO\n"; } } }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 10 10 10 10 6 9 6 8 ... |
correct output |
---|
YES YES YES NO YES ... |
user output |
---|
YES YES YES NO YES ... |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 9 9 6 10 8 10 8 8 ... |
correct output |
---|
NO YES NO YES NO ... |
user output |
---|
NO YES NO YES NO ... |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 1 1 1 1 1 1 1 1 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 100 100 100 100 100 100 100 100 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 100 4 9 3 8 7 9 7 9 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
NO NO NO NO NO ... |
Test 6
Group: 2
Verdict: ACCEPTED
input |
---|
1000 1000 9 10 2 5 10 10 5 5 ... |
correct output |
---|
YES YES YES YES NO ... |
user output |
---|
YES YES YES YES NO ... |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
1000 1000 5 7 9 9 3 7 8 10 ... |
correct output |
---|
YES NO NO YES YES ... |
user output |
---|
YES NO NO YES YES ... |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
1000 1000 1 1 1 1 1 1 1 1 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 9
Group: 2, 3
Verdict: ACCEPTED
input |
---|
1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 10
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000 774 778 363 852 309 668 261 459 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000 1233 1914 901 3963 1277 4293 1083 1599 ... |
correct output |
---|
NO NO YES NO NO ... |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000 1970 8631 4606 5797 6317 8162 8204 8789 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000 1000 1000 1000 1000 1000 1000 1000 1000 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 1 100000 1 100000 1 100000 1 100000 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 80971 98445 93046 96043 74840 94035 95931 96609 ... |
correct output |
---|
NO NO NO NO NO ... |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 6481 14350 69129 87600 6217 16462 4387 16625 ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
(empty) |