oj.uz

Submission #602044

# Submission time Handle Problem Language Result Execution time Memory
602044 2022-07-22T14:08:39 Z AmirElarbi Teams (IOI15_teams) C++14
34 / 100
 4000 ms 12252 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define gi greater<int>
#define gr greater
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 2e5+5;
typedef complex<int> Point;
#define X real()
#define Y imag()
 
#include "teams.h"
vii s;
int n;
void init(int N, int A[], int B[]) {
    n = N;
    for (int i = 0; i < N; ++i)
    {
        s.pb({A[i], B[i]});
    }
    sort(s.begin(), s.end());
}
 
int can(int M, int K[]) {
    priority_queue<int,vi ,gi> pq;
    vii k;
    for (int i = 0; i < M; ++i)
    {
        k.pb({K[i], K[i]});
    }
    sort(k.begin(), k.end());
    int j = 0;
    for (int i = 0; i < M; ++i)
    {
        while(j < n && s[j].fi <= k[i].fi){
            pq.push(s[j].se);
            j++;
        } 
        while(!pq.empty() && pq.top() < k[i].fi){
            pq.pop();
        }
        while(!pq.empty() && pq.top() >= k[i].fi && k[i].se != 0){
            pq.pop(); 
            k[i].se--;
        }
        if(k[i].se) return 0;
    }
    return 1;
}

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 1 ms 212 KB Output is correct
6 Correct 1 ms 468 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 0 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 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 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 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 15 ms 2124 KB Output is correct
2 Correct 18 ms 2252 KB Output is correct
3 Correct 28 ms 2744 KB Output is correct
4 Correct 20 ms 3756 KB Output is correct
5 Correct 12 ms 2252 KB Output is correct
6 Correct 15 ms 2252 KB Output is correct
7 Correct 11 ms 2968 KB Output is correct
8 Correct 12 ms 2984 KB Output is correct
9 Correct 12 ms 3984 KB Output is correct
10 Correct 11 ms 3528 KB Output is correct
11 Correct 10 ms 3400 KB Output is correct
12 Correct 10 ms 3392 KB Output is correct
13 Correct 16 ms 3320 KB Output is correct
14 Correct 18 ms 3644 KB Output is correct
15 Correct 15 ms 3284 KB Output is correct
16 Correct 16 ms 3376 KB Output is correct
17 Correct 16 ms 3312 KB Output is correct
18 Correct 18 ms 3300 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2264 KB Output is correct
2 Correct 21 ms 2252 KB Output is correct
3 Execution timed out 4082 ms 2956 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 8912 KB Output is correct
2 Correct 93 ms 8892 KB Output is correct
3 Execution timed out 4085 ms 12252 KB Time limit exceeded
4 Halted 0 ms 0 KB -