제출 #294379

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

teams

#include <bits/stdc++.h>

using namespace std;
long long n, pos, sum;
vector<pair<int, int> > sz;
vector<int> kerd;
bool can(int m, int a[]) {
    pos=0, sum=0;
    for (int i=0; i<m; i++) sum+=a[i];
    if (sum>n) return 0;
    kerd.clear();
    for (int i=0; i<m; i++) for (int j=0; j<a[i]; j++) kerd.push_back(a[i]);
    sort(kerd.begin(), kerd.end());
    for (int i=0; i<n; i++) {
        if (pos<sum && sz[i].second<=kerd[pos] && kerd[pos]<=sz[i].first) pos++;
    }
    return (pos==sum);
}
void init(int p, int a[], int b[]) {
    n=p;
    for (int i=0; i<n; i++) sz.push_back({b[i], a[i]});
    sort(sz.begin(), sz.end());
}

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