— Dark mode

Putka Open 2025 – 2/5

Ryhmät

  • Start: 2025-09-26 18:00:00
  • End: 2025-09-28 23:00:00
Submission details
Task:Ryhmät
Sender:ollpu
Submission time:2025-09-27 00:47:19 +0300
Language:C++ (C++20)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED15
#3ACCEPTED75
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.02 s2details
#7ACCEPTED0.04 s2details
#8ACCEPTED0.09 s2details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.08 s3details
#11ACCEPTED0.08 s3details
#12ACCEPTED0.08 s3details
#13ACCEPTED0.04 s3details
#14ACCEPTED0.06 s3details
#15ACCEPTED0.07 s3details
#16ACCEPTED0.06 s3details

Code

#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 17;
int sp[2*N];
int sp_get(int a, int b) {
    a += N; b += N;
    int res = 0;
    while (a <= b) {
        if (a&1) res += sp[a++];
        if (~b&1) res += sp[b--];
        a /= 2; b /= 2;
    }
    return res;
}
void sp_add(int x, int v) {
    x += N;
    do {
        sp[x] += v;
    } while (x /= 2);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, t;
    cin >> n >> t;
    pair<int, int> c[n];
    int started[n+1] {}, ended[n+1] {};
    for (int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        started[a]++;
        if (b < n) ended[b+1]++;
        c[i] = {a, b};
    }
    sort(c, c+n);
    for (int i = 1; i <= n; ++i) started[i] += started[i-1];
    for (int i = 1; i <= n; ++i) ended[i] += ended[i-1];
    vector<int> ks[t];
    map<pair<int, int>, int> queries;
    for (auto &k : ks) {
        int m;
        cin >> m;
        k.resize(m);
        for (int i = 0; i < m; ++i) cin >> k[i];
        ranges::sort(k);
        for (int i = 1; i < m; ++i) {
            queries[{k[i-1], k[i]}];
        }
    }
    for (auto [a, b] : c) {
        sp_add(b, 1);
    }
    int ci = 0;
    for (auto &[iv, res] : queries) {
        while (ci < n && c[ci].first <= iv.first) {
            sp_add(c[ci++].second, -1);
        }
        res = sp_get(iv.first+1, iv.second-1);
    }
    for (auto &k : ks) {
        int m = k.size();
        bool f = 1;
        int used = 0, skip = 0;
        for (int i = 0; i < m; ++i) {
            if (i) skip += queries[{k[i-1], k[i]}];
            used = max(used, ended[k[i]]-skip);
            used += k[i];
            if (used > started[k[i]]-skip) {
                f = 0; break;
            }
        }
        cout << (f ? "YES\n" : "NO\n");
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 100
10 10
10 10
6 9
6 8
...
view save

correct output
YES
YES
YES
NO
YES
...
view save

user output
YES
YES
YES
NO
YES
...
view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 100
9 9
6 10
8 10
8 8
...
view save

correct output
NO
YES
NO
YES
NO
...
view save

user output
NO
YES
NO
YES
NO
...
view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 100
1 1
1 1
1 1
1 1
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 100
100 100
100 100
100 100
100 100
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 100
4 9
3 8
7 9
7 9
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 6

Group: 2

Verdict: ACCEPTED

input
1000 1000
9 10
2 5
10 10
5 5
...
view save

correct output
YES
YES
YES
YES
NO
...
view save

user output
YES
YES
YES
YES
NO
...
view save

Test 7

Group: 2

Verdict: ACCEPTED

input
1000 1000
5 7
9 9
3 7
8 10
...
view save

correct output
YES
NO
NO
YES
YES
...
view save

user output
YES
NO
NO
YES
YES
...
view save

Test 8

Group: 2

Verdict: ACCEPTED

input
1000 1000
1 1
1 1
1 1
1 1
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
1000 1000
1000 1000
1000 1000
1000 1000
1000 1000
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 10

Group: 3

Verdict: ACCEPTED

input
100000 1000
774 778
363 852
309 668
261 459
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 1000
1233 1914
901 3963
1277 4293
1083 1599
...
view save

correct output
NO
NO
YES
NO
NO
...
view save

user output
NO
NO
YES
NO
NO
...
view save

Test 12

Group: 3

Verdict: ACCEPTED

input
100000 1000
1970 8631
4606 5797
6317 8162
8204 8789
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 13

Group: 3

Verdict: ACCEPTED

input
100000 1000
1000 1000
1000 1000
1000 1000
1000 1000
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 100000
1 100000
1 100000
1 100000
1 100000
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Test 15

Group: 3

Verdict: ACCEPTED

input
100000 100000
80971 98445
93046 96043
74840 94035
95931 96609
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 16

Group: 3

Verdict: ACCEPTED

input
100000 10000
6481 14350
69129 87600
6217 16462
4387 16625
...
view save

correct output
YES
YES
YES
YES
YES
...
view save

user output
YES
YES
YES
YES
YES
...
view save

Tasks

A Ruudukko-B Leimasin-C Alkuluvut-D Ryhmät-

Submissions (ollpu)

2025-09-27 00:47:19 1002025-09-26 23:55:34 252025-09-26 23:40:13 0