제출 #875431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
875431		gutzzy	Teams (CEOI11_tea)	C++17	60 / 100	2549 ms	33080 KiB

tea

#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<pair<int,int>> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i].first;
        a[i].second = i+1;
    }

    sort(a.begin(),a.end());
    reverse(a.begin(),a.end());
    int pos = 0;
    vector<vector<pair<int,int>>> teams;
    vector<pair<int,int>> rest;
    while(pos<n){
        if(pos+a[pos].first<n){
            vector<pair<int,int>> temp(a.begin()+pos,a.begin()+pos+a[pos].first);
            teams.push_back(temp);
            pos+=a[pos].first;
        }
        else if(pos+a[pos].first==n){
            vector<pair<int,int>> temp(a.begin()+pos,a.end());
            teams.push_back(temp);
            pos+=a[pos].first;
        }
        else{
            rest.push_back(a[pos]);
            pos++;
        }
    }
    
    /*
    cout << "teams: "<<endl;
    for(auto t:teams){
        for(auto m:t){
            cout << m.first << " " << m.second << endl;
        }
        cout << endl;
    }
    cout << "rest: "<<endl;
    for(auto m:rest){
        cout << m.first << " " << m.second << endl;
    }
    cout << "ans: "<<endl;
    */
    
    for(auto r:rest){
        int best = 0;
        int cur_best = 1e9;
        int i=0;
        for(auto team:teams){
            if((int) team.size()>=r.first-1 and (int) team.size()<cur_best){
                cur_best = team.size();
                best = i;
            }
            i++;
        }
        teams[best].push_back(r);
    }
    
    // print answer
    
    cout << teams.size() << endl;
        for(auto team:teams){
            cout << team.size() << " ";
            for(auto m:team) cout << m.second << " ";
            cout << endl;
        }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 10 / 10