제출 #803019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
803019		Liudas	팀들 (IOI15_teams)	C++17	0 / 100	4067 ms	11332 KiB

teams

#include <bits/stdc++.h>
#include "teams.h"
using namespace std;
vector<pair<int, int>> arr;
vector<bool> taken;
int N;
void init(int K, int A[], int B[]){
    N = K;
    for(int i = 0; i < N; i ++){
        arr.push_back({A[i], B[i]});
    }
    taken.resize(N);
    sort(arr.begin(), arr.end());
    sort(arr.begin(), arr.end(), [](pair<int,int> a, pair<int,int>b){return a.second -a.first < b.second -b.first;});
}
int can(int M, int K[]){
    fill(taken.begin(), taken.end(), false);
    for(int i = 0; i < M; i ++){
        int need = K[i];
        int id = 0;
        int got = 0;
        while(id < N && got < need){
            if(!taken[id] && arr[id].first <= need && arr[id].second >= need){
                got++;
                taken[id] = true;
            }
            id++;
        }
        if(got < need){
            return 0;
        }
    }
    return 1;
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23