— 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:jhuun
Submission time:2025-09-28 18:08:48 +0300
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1--1, 2, 3details
#2--1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6--2details
#7--2details
#8--2details
#9--2, 3details
#10--3details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details

Code

#include <bits/stdc++.h>

using pi = std::pair<int, int>;

struct ST {
    std::vector<int> T;
    std::vector<int> L;
    int n;

    ST(int n) : T(400000), L(400000), n{n} { }

    void push(int v) {
        T[v * 2] += L[v];
        T[v * 2 + 1] += L[v];
        L[v * 2] += L[v];
        L[v * 2 + 1] += L[v];
        L[v] = 0;
    }

    void update(int v, int tl, int tr, int l, int r, int a) {
        if (l > r) {
            return;
        }
        if (l == tl && tr == r) {
            T[v] += a;
            L[v] += a;
        } else {
            push(v);
            const auto tm = (tl + tr) / 2;
            update(v * 2, tl, tm, l, std::min(r, tm), a);
            update(v * 2 + 1, tm + 1, tr, std::max(l, tm + 1), r, a);
            T[v] = std::min(T[v * 2], T[v * 2 + 1]);
        }
    }

    int query(int v, int tl, int tr, int l, int r) {
        if (l > r) {
            return std::numeric_limits<int>::max();
        }
        if (l == tl && tr == r) {
            return T[v];
        }
        push(v);
        const auto tm = (tl + tr) / 2;
        return std::min(query(v * 2, tl, tm, l, std::min(r, tm)),
                        query(v * 2 + 1, tm + 1, tr, std::max(l, tm + 1), r));
    }

    void update(int l, int r, int a) {
        update(1, 0, n - 1, l, r, a);
    }

    int query(int l, int r) {
        return query(1, 0, n - 1, l, r);
    }
};

void solve(const std::vector<pi>& N, const std::vector<pi>& Kp, ST& st, std::vector<bool>& used, std::size_t idx, int ki, bool& ok) {
    if (idx == Kp.size()) {
        std::cout << "YES\n";
        ok = true;
        return;
    }
    if (Kp[idx].second == 0) {
        solve(N, Kp, st, used, idx + 1, 0, ok);
    } else {
        for (std::size_t i = 0; !ok && i < N.size(); ++i) {
            if (!used[i]) {
                const auto [a, b] = N[i];
                if (!(a <= Kp[idx].first && b >= Kp[idx].first)) {
                    continue;
                }
                if (st.query(a, b) == 0) {
                    continue;
                }
                used[i] = true;
                st.update(a, b, -1);
                if (ki + 1 == Kp[idx].second) {
                    solve(N, Kp, st, used, idx + 1, 0, ok);
                } else {
                    solve(N, Kp, st, used, idx, ki + 1, ok);
                }
                st.update(a, b, 1);
                used[i] = false;
            }
        }
    }
}

void pre_fill(const std::vector<pi>& N, std::vector<pi>& Kp, ST& st, std::vector<bool>& used) {
    for (std::size_t i = 0; i < Kp.size(); ++i) {
        auto& [k, c] = Kp[i];
        const auto la = i == 0 ? 0 : Kp[i - 1].first;
        const auto lb = i == Kp.size() - 1 ? std::numeric_limits<int>::max() : Kp[i + 1].first;
        for (std::size_t j = 0; j < N.size(); ++j) {
            if (used[j]) {
                continue;
            }
            const auto [a, b] = N[j];
            if (a > la && b < lb) {
                used[j] = true;
                --c;
                break;
            }
        }
    }
}

bool init_check(ST& st, std::vector<pi>& Ks) {
    for (const auto& [k, c] : Ks) {
        if (st.query(k, k) < c) {
            return false;
        }
    }
    return true;
}

int main() {
    int n, t;
    std::cin >> n >> t;
    std::vector<pi> N;
    ST st(n);
    for (int i = 0; i < n; ++i) {
        int a, b;
        std::cin >> a >> b;
        N.emplace_back(a - 1, b - 1);
        st.update(a - 1, b - 1, 1);
    }
    std::sort(N.begin(), N.end());
    for (int i = 0; i < t; ++i) {
        int m;
        std::cin >> m;
        std::vector<int> K(m);
        int ks = 0;
        for (auto& k : K) {
            std::cin >> k;
            ks += k;
        }
        if (ks > n) {
            std::cout << "NO\n";
            continue;
        }
        std::sort(K.begin(), K.end());
        std::vector<pi> Kp{{K.front() - 1, K.front()}};
        for (auto j = 1; j < m; ++j) {
            if (K[j] == K[j - 1] - 1) {
                Kp.back().second += K[j];
            } else {
                Kp.emplace_back(K[j] - 1, K[j]);
            }
        }
        if (!init_check(st, Kp)) {
            std::cout << "NO\n";
        } else {
            std::vector<bool> used(N.size());
            pre_fill(N, Kp, st, used);
            bool ok = false;
            solve(N, Kp, st, used, 0, 0, ok);
            if (!ok) {
                std::cout << "NO\n";
            }
        }
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

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

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

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict:

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

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

user output
(empty)

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:

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

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

user output
(empty)

Test 7

Group: 2

Verdict:

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

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

user output
(empty)

Test 8

Group: 2

Verdict:

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

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

user output
(empty)

Test 9

Group: 2, 3

Verdict:

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

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

user output
(empty)

Test 10

Group: 3

Verdict:

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

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

user output
(empty)

Test 11

Group: 3

Verdict:

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

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

user output
(empty)

Test 12

Group: 3

Verdict:

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

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

user output
(empty)

Test 13

Group: 3

Verdict:

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

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

user output
(empty)

Test 14

Group: 3

Verdict:

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

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

user output
(empty)

Test 15

Group: 3

Verdict:

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

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

user output
(empty)

Test 16

Group: 3

Verdict:

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

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

user output
(empty)

Tasks

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

Submissions (jhuun)

2025-09-28 22:59:00 102025-09-28 22:58:04 02025-09-28 22:57:12 02025-09-28 22:41:43 102025-09-28 22:29:52 102025-09-28 22:20:39 102025-09-28 21:59:27 02025-09-28 21:33:04 102025-09-28 21:10:02 02025-09-28 20:52:23 02025-09-28 20:43:19 02025-09-28 20:35:49 02025-09-28 18:15:40 02025-09-28 18:08:48 02025-09-28 16:51:12 02025-09-28 16:34:53 02025-09-28 16:23:42 0