oj.uz

Submission #830880

# Submission time Handle Problem Language Result Execution time Memory
830880 2023-08-19T12:20:03 Z drdilyor Teams (IOI15_teams) C++17
34 / 100
 4000 ms 10940 KB 
#include<bits/stdc++.h>
#include "teams.h"
using namespace std;
using ll = long long;

int n;
vector<pair<int,int>> arr;
void init(int n, int* a, int* b) {
    ::n = n;
    arr.resize(n);
    for( int i = 0; i < n; i++)
        arr[i] = {a[i], b[i]};
}

int can(int m, int* ts) {
    sort(ts, ts + m, greater());
    sort(arr.begin(), arr.end(), greater());
    vector<int> used(n);
    int team = 0;
    while (team < m) {
        int cnt = 0;
        for (int student = 0; student < n; student++) {
            if (used[student]) continue;
            auto [l,r] = arr[student];
            if (l <= ts[team] && ts[team] <= r) {
                used[student] = 1;
                cnt++;
            }
            if (cnt == ts[team]) break;
        }
        if (cnt == ts[team]) team++;
        else break;
    }
    return team == m;
}

Compilation message

teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:8:15: warning: declaration of 'n' shadows a global declaration [-Wshadow]
    8 | void init(int n, int* a, int* b) {
      |           ~~~~^
teams.cpp:6:5: note: shadowed declaration is here
    6 | int n;
      |     ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 340 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 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 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2260 KB Output is correct
2 Correct 13 ms 2264 KB Output is correct
3 Correct 13 ms 2268 KB Output is correct
4 Correct 14 ms 2656 KB Output is correct
5 Correct 31 ms 2260 KB Output is correct
6 Correct 9 ms 2260 KB Output is correct
7 Correct 31 ms 2256 KB Output is correct
8 Correct 32 ms 2268 KB Output is correct
9 Correct 1048 ms 2388 KB Output is correct
10 Correct 777 ms 2848 KB Output is correct
11 Correct 116 ms 2872 KB Output is correct
12 Correct 14 ms 2876 KB Output is correct
13 Correct 12 ms 3148 KB Output is correct
14 Correct 11 ms 3148 KB Output is correct
15 Correct 14 ms 3396 KB Output is correct
16 Correct 13 ms 3316 KB Output is correct
17 Correct 12 ms 3284 KB Output is correct
18 Correct 13 ms 3284 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 2680 KB Output is correct
2 Correct 572 ms 2632 KB Output is correct
3 Execution timed out 4038 ms 2404 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2226 ms 10820 KB Output is correct
2 Correct 2561 ms 10940 KB Output is correct
3 Execution timed out 4056 ms 10216 KB Time limit exceeded
4 Halted 0 ms 0 KB -