oj.uz

Submission #126064

# Submission time Handle Problem Language Result Execution time Memory
126064 2019-07-07T00:30:45 Z dragonslayerit Teams (IOI15_teams) C++14
34 / 100
 4000 ms 38948 KB 
#include "teams.h"
#include <vector>
#include <set>

std::vector<int> right[500005];
int NN;

void init(int N, int A[], int B[]) {
  NN=N;
  for(int i=0;i<N;i++){
    right[A[i]].push_back(B[i]);
  }
}

int can(int M, int K[]) {
  std::vector<int> freq(NN+1);
  int sum=0;
  for(int i=0;i<M;i++){
    freq[K[i]]+=K[i];
    sum+=K[i];
    if(sum>NN) return 0;
  }
  std::multiset<int> active;
  for(int i=1;i<=NN;i++){
    for(int v:right[i]){
      active.insert(v);
    }
    while(active.size()&&*active.begin()<i) active.erase(active.begin());
    while(freq[i]--){
      if(active.empty()) return 0;
      active.erase(active.begin());
    }
  }
  return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 14968 KB Output is correct
2 Correct 30 ms 14968 KB Output is correct
3 Correct 75 ms 17384 KB Output is correct
4 Correct 33 ms 16760 KB Output is correct
5 Correct 28 ms 14584 KB Output is correct
6 Correct 28 ms 14584 KB Output is correct
7 Correct 19 ms 14712 KB Output is correct
8 Correct 19 ms 14584 KB Output is correct
9 Correct 47 ms 19312 KB Output is correct
10 Correct 48 ms 18928 KB Output is correct
11 Correct 46 ms 18928 KB Output is correct
12 Correct 42 ms 18676 KB Output is correct
13 Correct 43 ms 17564 KB Output is correct
14 Correct 59 ms 19696 KB Output is correct
15 Correct 74 ms 17912 KB Output is correct
16 Correct 30 ms 15992 KB Output is correct
17 Correct 35 ms 15992 KB Output is correct
18 Correct 37 ms 16120 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 15604 KB Output is correct
2 Correct 48 ms 15472 KB Output is correct
3 Execution timed out 4103 ms 17660 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 27728 KB Output is correct
2 Correct 238 ms 27752 KB Output is correct
3 Execution timed out 4046 ms 38948 KB Time limit exceeded
4 Halted 0 ms 0 KB -