oj.uz

Submission #830280

# Submission time Handle Problem Language Result Execution time Memory
830280 2023-08-19T02:21:10 Z skittles1412 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 12216 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

template <typename Cb>
struct Cmp {
    Cb cb;

    Cmp(Cb cb) : cb(cb) {}

    template <typename T>
    bool operator()(const T& a, const T& b) const {
        return cb(a) < cb(b);
    }
};

struct Solver {
    vector<pair<int, int>> arr;

    Solver() {}
    Solver(const vector<pair<int, int>>& _arr) : arr(_arr) {
        sort(begin(arr), end(arr),
             Cmp([&](const pair<int, int>& p) -> int { return p.second; }));
    }

    bool query(vector<int> q_arr) {
        sort(begin(q_arr), end(q_arr));

        int n = sz(arr);

        if (accumulate(begin(q_arr), end(q_arr), long(0)) > n) {
            return false;
        }

        bool used[n] {};

        for (auto& a : q_arr) {
            int cnt = 0;

            for (int i = 0; i < n && cnt < a; i++) {
                if (used[i]) {
                    continue;
                }

                if (arr[i].first <= a && a <= arr[i].second) {
                    used[i] = true;
                    cnt++;
                }
            }

            if (cnt != a) {
                return false;
            }
        }

        return true;
    }
} solver;

void init(int n, int arrl[], int arrr[]) {
    vector<pair<int, int>> arr;
    for (int i = 0; i < n; i++) {
        arr.emplace_back(arrl[i], arrr[i]);
    }

    solver = Solver(arr);
}

int can(int m, int arr[]) {
    return solver.query(vector<int>(arr, arr + m));
}

Compilation message

teams.cpp: In constructor 'Cmp<Cb>::Cmp(Cb)':
teams.cpp:31:12: warning: declaration of 'cb' shadows a member of 'Cmp<Cb>' [-Wshadow]
   31 |     Cmp(Cb cb) : cb(cb) {}
      |         ~~~^~
teams.cpp:29:8: note: shadowed declaration is here
   29 |     Cb cb;
      |        ^~
teams.cpp: In instantiation of 'Cmp<Cb>::Cmp(Cb) [with Cb = Solver::Solver(const std::vector<std::pair<int, int> >&)::<lambda(const std::pair<int, int>&)>]':
teams.cpp:45:74:   required from here
teams.cpp:31:12: warning: declaration of 'cb' shadows a member of 'Cmp<Solver::Solver(const std::vector<std::pair<int, int> >&)::<lambda(const std::pair<int, int>&)> >' [-Wshadow]
   31 |     Cmp(Cb cb) : cb(cb) {}
      |         ~~~^~
teams.cpp:29:8: note: shadowed declaration is here
   29 |     Cb cb;
      |        ^~
teams.cpp:31:12: warning: declaration of 'cb' shadows a member of 'Cmp<Solver::Solver(const std::vector<std::pair<int, int> >&)::<lambda(const std::pair<int, int>&)> >' [-Wshadow]
   31 |     Cmp(Cb cb) : cb(cb) {}
      |         ~~~^~
teams.cpp:29:8: note: shadowed declaration is here
   29 |     Cb cb;
      |        ^~
teams.cpp:31:12: warning: declaration of 'cb' shadows a member of 'Cmp<Solver::Solver(const std::vector<std::pair<int, int> >&)::<lambda(const std::pair<int, int>&)> >' [-Wshadow]
   31 |     Cmp(Cb cb) : cb(cb) {}
      |         ~~~^~
teams.cpp:29:8: note: shadowed declaration is here
   29 |     Cb cb;
      |        ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 300 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2888 KB Output is correct
2 Correct 12 ms 2856 KB Output is correct
3 Correct 12 ms 2888 KB Output is correct
4 Correct 14 ms 2888 KB Output is correct
5 Correct 17 ms 2864 KB Output is correct
6 Correct 15 ms 2888 KB Output is correct
7 Correct 9 ms 2856 KB Output is correct
8 Correct 9 ms 2888 KB Output is correct
9 Correct 1080 ms 2880 KB Output is correct
10 Correct 408 ms 2888 KB Output is correct
11 Correct 47 ms 2888 KB Output is correct
12 Correct 10 ms 2888 KB Output is correct
13 Correct 9 ms 2888 KB Output is correct
14 Correct 9 ms 2844 KB Output is correct
15 Correct 11 ms 2884 KB Output is correct
16 Correct 11 ms 2896 KB Output is correct
17 Correct 9 ms 2824 KB Output is correct
18 Correct 10 ms 3752 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2888 KB Output is correct
2 Correct 64 ms 2856 KB Output is correct
3 Execution timed out 4057 ms 2832 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 12180 KB Output is correct
2 Correct 255 ms 12216 KB Output is correct
3 Execution timed out 4077 ms 12184 KB Time limit exceeded
4 Halted 0 ms 0 KB -