Submission #532462

#	Time	Username	Problem	Language	Result	Execution time	Memory
532462		definitelynotmee	Teams (CEOI11_tea)	C++98	80 / 100	281 ms	72812 KiB

tea

#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;



int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> v(n);
    for(int i = 0; i < n; i++)
        cin >> v[i];
    vector<int> o(n);
    iota(all(o),0);
    stable_sort(all(o),[&](int a, int b){return v[a] > v[b];});

    matrix<int> resp;

    int cur = 0;
    while(cur < n){
        //cout << cur << ' ';
        if(v[o[cur]] <= n-cur){
            //cout << 'a' <<endl;
            resp.push_back({});
            for(int i = cur; i < cur+v[o[cur]]; i++){
                resp.back().push_back(o[i]);
            }
            cur+=v[o[cur]];
            continue;
        }
        //cout << 'b' << '\n';
        int sz = resp.back().size();
        int ini = 0, fim = resp.size()-1;
        while(ini!=fim){
            int m = (ini+fim)>>1;
            if(resp[m].size() == sz)
                fim = m;
            else ini = m+1;
        }
        resp[ini].push_back(o[cur]);
        cur++;
    }

    cout << resp.size() << '\n';
    for(vector<int>& i : resp){
        cout << i.size() << ' ';
        for(int j : i)
            cout << j+1 << ' ';
        cout << '\n';
    }

    return 0;

}

Compilation message (stderr)

tea.cpp: In function 'int main()':
tea.cpp:57:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |             if(resp[m].size() == sz)
      |                ~~~~~~~~~~~~~~~^~~~~

• 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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10