oj.uz

Submission #254284

# Submission time Handle Problem Language Result Execution time Memory
254284 2020-07-29T17:45:59 Z eohomegrownapps Teams (IOI15_teams) C++14
34 / 100
 4000 ms 12552 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>> ranges;
int n;

void init(int N, int A[], int B[]) {
    n=N;
    ranges.resize(n);
    for (int i=0; i<n; i++){
        ranges[i].first=A[i];
        ranges[i].second=B[i];
    }
    sort(ranges.begin(),ranges.end());
}

int can(int m, int k[]) {
    sort(k,k+m);
    int ptr = 0;
    priority_queue<int,vector<int>,greater<int>> pq;
    for (int i = 0; i<m; i++){
        while (ptr<n&&ranges[ptr].first<=k[i]){
            pq.push(ranges[ptr].second);
            ptr++;
        }
        while (pq.size()>0&&pq.top()<k[i]){
            pq.pop();
        }
        for (int j = 0; j<k[i]; j++){
            if (pq.size()==0){
                return 0;
            }
            pq.pop();
        }
    }
    return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1920 KB Output is correct
2 Correct 16 ms 1948 KB Output is correct
3 Correct 29 ms 2556 KB Output is correct
4 Correct 18 ms 2304 KB Output is correct
5 Correct 13 ms 1920 KB Output is correct
6 Correct 15 ms 1920 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 11 ms 1920 KB Output is correct
9 Correct 11 ms 2684 KB Output is correct
10 Correct 11 ms 2556 KB Output is correct
11 Correct 10 ms 2556 KB Output is correct
12 Correct 13 ms 2556 KB Output is correct
13 Correct 17 ms 2304 KB Output is correct
14 Correct 20 ms 2556 KB Output is correct
15 Correct 16 ms 2048 KB Output is correct
16 Correct 16 ms 3072 KB Output is correct
17 Correct 17 ms 3200 KB Output is correct
18 Correct 17 ms 3200 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2424 KB Output is correct
2 Correct 23 ms 2296 KB Output is correct
3 Execution timed out 4056 ms 3240 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 8952 KB Output is correct
2 Correct 105 ms 8916 KB Output is correct
3 Execution timed out 4080 ms 12552 KB Time limit exceeded
4 Halted 0 ms 0 KB -