oj.uz

Submission #1007450

# Submission time Handle Problem Language Result Execution time Memory
1007450 2024-06-25T01:43:23 Z bachhoangxuan Teams (IOI15_teams) C++17
0 / 100
 130 ms 23244 KB 
#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5+5;
int n,lt[maxn],rt[maxn];

void init(int N, int A[], int B[]) {
    for(int i=0;i<N;i++){
        lt[B[i]]++;
        rt[A[i]]++;
    }
    for(int i=1;i<=N;i++) lt[i]+=lt[i-1];
    for(int i=N;i>=1;i--) rt[i]+=rt[i+1];
    n=N;
}

int can(int M, int K[]) {
    vector<int> com;
    for(int i=0;i<M;i++) com.push_back(K[i]);
    sort(com.begin(),com.end());
    com.erase(unique(com.begin(),com.end()),com.end());
    int sz=(int)com.size();
    vector<int> cnt(sz);
    for(int i=0;i<M;i++) cnt[lower_bound(com.begin(),com.end(),K[i])-com.begin()]++;
    for(int i=0;i<sz;i++){
        if(cnt[i]>n/com[i]) return 0;
        cnt[i]*=com[i];
        if(i) cnt[i]+=cnt[i-1];
        if(cnt[i]>n) return 0;
    }
    for(int i=0;i<sz;i++) for(int j=i;j<sz;j++){
        int num=n-(lt[com[i]-1]+rt[com[j]+1]);
        int val=(i?cnt[j]-cnt[i-1]:cnt[j]);
        if(num<val) return 0;
    }
    return 1;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2496 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Incorrect 1 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4700 KB Output is correct
2 Correct 5 ms 4644 KB Output is correct
3 Correct 5 ms 4560 KB Output is correct
4 Correct 8 ms 5956 KB Output is correct
5 Correct 4 ms 4188 KB Output is correct
6 Correct 4 ms 4188 KB Output is correct
7 Incorrect 4 ms 4272 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5264 KB Output is correct
2 Correct 15 ms 5468 KB Output is correct
3 Correct 19 ms 8792 KB Output is correct
4 Correct 8 ms 5848 KB Output is correct
5 Correct 36 ms 5124 KB Output is correct
6 Correct 30 ms 5028 KB Output is correct
7 Incorrect 36 ms 4952 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 16464 KB Output is correct
2 Correct 51 ms 16484 KB Output is correct
3 Correct 59 ms 23244 KB Output is correct
4 Correct 39 ms 17100 KB Output is correct
5 Correct 130 ms 13656 KB Output is correct
6 Correct 107 ms 13740 KB Output is correct
7 Incorrect 130 ms 13668 KB Output isn't correct
8 Halted 0 ms 0 KB -