Submission #1138770

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138770		steveonalex	팀들 (IOI15_teams)	C++20	34 / 100	4085 ms	6724 KiB

teams

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
#include "teams.h"

const int N = 1e5 + 69;
int n;
vector<int> query_enter[N];
int just_asking[N];

void init(int _n, int A[], int B[]) {
    n = _n;
    for(int i = 0; i < n; ++i){
        query_enter[A[i]].push_back(B[i]);
    } 
}

int can(int m, int K[]) {
    for(int i = 1; i <= n; ++i) just_asking[i] = 0;
    for(int i = 0; i < m; ++i) just_asking[K[i]]++;

    priority_queue<int, vector<int>, greater<int>> pq;
    for(int i = 1; i <= n; ++i) {
        for(int j: query_enter[i]) pq.push(j);
        while(pq.size() && pq.top() < i) pq.pop();
        if (pq.size() < i * just_asking[i]) return 0;
        for(int j = 0; j < i * just_asking[i]; ++j)
            pq.pop();
    }
    return 1;
}

// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//     clock_t start = clock();

    

//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

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