oj.uz

Submission #396333

# Submission time Handle Problem Language Result Execution time Memory
396333 2021-04-29T18:52:41 Z definitelynotmee Teams (IOI15_teams) C++
34 / 100
 4000 ms 19856 KB 
#include <bits/stdc++.h>
#include "teams.h"
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MAXN = 500001;

int n;
pii v [MAXN];


void init (int N, int A[], int B[]){
    n = N;
    for(int i = 0; i < n; i++){
        v[i] = {A[i], B[i]};
    }
    sort(v, v+n);
}

int can (int m, int k[]){
    sort(k, k+m);
    multiset<int> active;
    int p1 = 0, p2 = 0;
    for(int i = 1; i <= n && p2 < m; i++){
        while(p1 < n && v[p1].ff == i){
            active.insert(v[p1].ss);
            p1++;
        }
        while(p2 < m && k[p2] == i){
            if(active.size() < k[p2])
                return 0;
            for(int j = 0; j < k[p2]; j++)
                active.erase(active.begin());
            p2++;
        }
        while(!active.empty() && *active.begin() == i)
            active.erase(active.begin());
    }
    return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:37:30: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |             if(active.size() < k[p2])
      |                ~~~~~~~~~~~~~~^~~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1880 KB Output is correct
2 Correct 16 ms 1868 KB Output is correct
3 Correct 47 ms 4188 KB Output is correct
4 Correct 20 ms 3520 KB Output is correct
5 Correct 19 ms 2676 KB Output is correct
6 Correct 22 ms 2636 KB Output is correct
7 Correct 12 ms 2660 KB Output is correct
8 Correct 12 ms 2628 KB Output is correct
9 Correct 28 ms 7500 KB Output is correct
10 Correct 31 ms 7060 KB Output is correct
11 Correct 26 ms 7084 KB Output is correct
12 Correct 28 ms 6848 KB Output is correct
13 Correct 29 ms 5444 KB Output is correct
14 Correct 35 ms 7268 KB Output is correct
15 Correct 18 ms 3512 KB Output is correct
16 Correct 16 ms 2956 KB Output is correct
17 Correct 25 ms 3984 KB Output is correct
18 Correct 30 ms 4136 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2260 KB Output is correct
2 Correct 22 ms 2252 KB Output is correct
3 Execution timed out 4078 ms 4228 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8804 KB Output is correct
2 Correct 98 ms 8796 KB Output is correct
3 Execution timed out 4054 ms 19856 KB Time limit exceeded
4 Halted 0 ms 0 KB -