| Task: | Ryhmät |
| Sender: | sharph2 |
| Submission time: | 2025-09-27 23:35:45 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.03 s | 2 | details |
| #7 | WRONG ANSWER | 0.05 s | 2 | details |
| #8 | ACCEPTED | 0.23 s | 2 | details |
| #9 | ACCEPTED | 0.00 s | 2, 3 | details |
| #10 | WRONG ANSWER | 0.06 s | 3 | details |
| #11 | WRONG ANSWER | 0.05 s | 3 | details |
| #12 | WRONG ANSWER | 0.05 s | 3 | details |
| #13 | ACCEPTED | 0.05 s | 3 | details |
| #14 | ACCEPTED | 0.07 s | 3 | details |
| #15 | WRONG ANSWER | 0.08 s | 3 | details |
| #16 | ACCEPTED | 0.08 s | 3 | details |
Code
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
constexpr int N = 1 << 17;
int spuu[2 * N];
int hae(int i) {
return spuu[N + i];
}
void kasvata(int i) {
i += N;
while(i > 0) {
++spuu[i];
i >>= 1;
}
}
int summa(int a, int b, int v = 1, int s = N) {
if(b <= 0 || a >= s) {
return 0;
}
if(a <= 0 && b >= s) {
return spuu[v];
}
int h = s >> 1;
return summa(a, b, 2 * v, h) + summa(a - h, b - h, 2 * v + 1, h);
}
struct Tila {
int p = 0;
vector<int> koot;
int velka = 0;
bool tulos = true;
};
int main() {
cin.sync_with_stdio(false);
cin.tie(nullptr);
int n, t;
cin >> n >> t;
vector<pair<int, int>> toiveet(n);
for(int i = 0; i < n; ++i) {
cin >> toiveet[i].first >> toiveet[i].second;
}
sort(toiveet.begin(), toiveet.end());
vector<Tila> tilat(t);
vector<pair<int, int>> kaikki;
for(int ti = 0; ti < t; ++ti) {
int m;
cin >> m;
vector<int>& koot = tilat[ti].koot;
koot.resize(m);
for(int& val : koot) {
cin >> val;
}
sort(koot.begin(), koot.end());
for(int p = 0; p < m; ++p) {
kaikki.push_back({koot[p], ti});
}
}
std::sort(kaikki.begin(), kaikki.end());
int toiveIdx = 0;
for(auto [koko, ti] : kaikki) {
Tila& tila = tilat[ti];
if(!tila.tulos) {
continue;
}
if(tila.p >= (int)tila.koot.size()) throw 5;
if(tila.koot[tila.p] != koko) throw 5;
while(toiveIdx < n && toiveet[toiveIdx].first <= koko) {
kasvata(toiveet[toiveIdx].second);
++toiveIdx;
}
int montako = koko + tila.velka;
tila.velka = 0;
if(summa(koko, N) < montako) {
tila.tulos = false;
break;
}
if(tila.p + 1 < (int)tila.koot.size()) {
int seuraavaKoko = tila.koot[tila.p + 1];
int loppuvat = 0;
if(koko < seuraavaKoko) {
loppuvat = summa(koko, seuraavaKoko);
}
if(montako > loppuvat) {
tila.velka += montako - loppuvat;
}
}
++tila.p;
}
for(int ti = 0; ti < t; ++ti) {
if(tilat[ti].tulos) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
return 0;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 10 10 10 10 6 9 6 8 ... |
| correct output |
|---|
| YES YES YES NO YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 9 9 6 10 8 10 8 8 ... |
| correct output |
|---|
| NO YES NO YES NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
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 ... Truncated |
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 ... Truncated |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 100 4 9 3 8 7 9 7 9 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 6
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1000 9 10 2 5 10 10 5 5 ... |
| correct output |
|---|
| YES YES YES YES NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 7
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1000 5 7 9 9 3 7 8 10 ... |
| correct output |
|---|
| YES NO NO YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
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 ... Truncated |
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 ... Truncated |
Test 10
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1000 774 778 363 852 309 668 261 459 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 11
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1000 1233 1914 901 3963 1277 4293 1083 1599 ... |
| correct output |
|---|
| NO NO YES NO NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 12
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 1000 1970 8631 4606 5797 6317 8162 8204 8789 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000 1000 1000 1000 1000 1000 1000 1000 1000 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 14
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 1 100000 1 100000 1 100000 1 100000 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 15
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 100000 80971 98445 93046 96043 74840 94035 95931 96609 ... |
| correct output |
|---|
| NO NO NO NO NO ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 6481 14350 69129 87600 6217 16462 4387 16625 ... |
| correct output |
|---|
| YES YES YES YES YES ... |
| user output |
|---|
| YES YES YES YES YES ... Truncated |
