Submission #94785

#TimeUsernameProblemLanguageResultExecution timeMemory
94785someone_aaTeams (IOI15_teams)C++17
0 / 100
4038 ms9056 KiB
#include <bits/stdc++.h>
#include "teams.h"
#define P pair<int,int>
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
int n;
vector<P>intervals;
void init(int N, int A[], int B[]) {
    n = N;
    for(int i=0;i<N;i++) {
        intervals.pb(mp(B[i], A[i]));
    }
    sort(intervals.begin(), intervals.end());
}

int OK[500100];

int can(int M, int K[]) {
    sort(K, K+M);
    ll sum = 0LL;
    for(int i=0;i<M;i++) {
        OK[i] = K[i];
        sum += 1LL * K[i];
    }
    if(sum > n) return 0;

    int pi = 0, pk = 0;
    int taken = 0;
    while(pi < n && pk < M) {
        if(OK[pk] <= intervals[pi].first && OK[pk] >= intervals[pi].second) {
            K[pk]--;
            taken++;
        }
        pi++;
        if(K[pk] == 0) pk++;
    }
    return (sum == taken);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...