oj.uz

Submission #772392

# Submission time Handle Problem Language Result Execution time Memory
772392 2023-07-04T05:09:39 Z phoebe Teams (IOI15_teams) C++17
34 / 100
 4000 ms 136308 KB 
#include <bits/stdc++.h>
#include "teams.h"
using namespace std;

#define ll long long
#define pii pair<int, int>
#define F first
#define S second
#define FOR(i, n) for (int i = 0; i < n; i++)
#define PB push_back

const int maxn = 5e5 + 10;
int n; 
map<int, vector<pii>> add, addnt;

bool cmp(pii a, pii b){
    return a.S < b.S;
}

void init(int N, int A[], int B[]){
    n = N;
    FOR(i, n){
        add[A[i]].PB({B[i], i});
        addnt[B[i]].PB({B[i], i});
    }
    
}

int can(int m, int k[]){
    map<int, int> need;
    FOR(i, m) need[k[i]] += k[i];
    set<pii> s;
    for (int i = 1; i <= n; i++){
        for (auto x : add[i]) s.insert(x);
        if (s.size() < need[i]) return 0;
        FOR(_, need[i]) s.erase(s.begin());
        for (auto x : addnt[i]){
            if (s.count(x)) s.erase(x);
        }
    }
    return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:35:22: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'std::map<int, int>::mapped_type' {aka 'int'} [-Wsign-compare]
   35 |         if (s.size() < need[i]) return 0;

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 300 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 260 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 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 70 ms 14964 KB Output is correct
2 Correct 71 ms 15032 KB Output is correct
3 Correct 200 ms 25048 KB Output is correct
4 Correct 86 ms 15668 KB Output is correct
5 Correct 82 ms 24456 KB Output is correct
6 Correct 21 ms 4268 KB Output is correct
7 Correct 14 ms 4256 KB Output is correct
8 Correct 13 ms 4308 KB Output is correct
9 Correct 77 ms 23948 KB Output is correct
10 Correct 79 ms 23496 KB Output is correct
11 Correct 80 ms 23564 KB Output is correct
12 Correct 80 ms 23680 KB Output is correct
13 Correct 61 ms 8640 KB Output is correct
14 Correct 135 ms 28156 KB Output is correct
15 Correct 202 ms 26644 KB Output is correct
16 Correct 63 ms 13740 KB Output is correct
17 Correct 87 ms 24356 KB Output is correct
18 Correct 91 ms 24380 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 15876 KB Output is correct
2 Correct 110 ms 15800 KB Output is correct
3 Execution timed out 4062 ms 27400 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 922 ms 76716 KB Output is correct
2 Correct 916 ms 76752 KB Output is correct
3 Execution timed out 4040 ms 136308 KB Time limit exceeded
4 Halted 0 ms 0 KB -