Submission #532454

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
532454	2022-03-02T22:11:51 Z	definitelynotmee	Teams (CEOI11_tea)	C++	80 / 100	279 ms	72764 KB

#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);
    sort(all(o),[&](int a, int b){
        return v[a] > v[b];
    });

    matrix<int> resp;
    int start = 0;
    while(start < n){
        while(start < n && n-start>=v[o[start]]){
            resp.push_back({});
            for(int i = 0; i < v[o[start]]; i++){
                resp.back().push_back(o[i+start]);
            }
            start+=v[o[start]];
        };

        while(start < n && n-start<v[o[start]]){
            int ptr = resp.size()-1;
            while(start < n && n-start<v[o[start]] &&ptr >=0 && (ptr == resp.size()-1 || resp[ptr+1].size() > resp[ptr].size())){
                resp[ptr].push_back(o[start]);
                ptr--;
                start++;
            }
        }
    }
    
    if(start < n){
        resp.push_back({});
        while(start < n)
            resp.back().push_back(o[start]), start++;
    }
    cout << resp.size() << '\n';

    int tot =0;
    for(vector<int>& i : resp){
        tot+=i.size();
    }

    for(vector<int>& i : resp){
        cout << i.size() << ' ';

        for(int j : i){

            cout << j+1 << ' ';
        }
        cout << '\n';
    }


    return 0;

}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:53:70: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             while(start < n && n-start<v[o[start]] &&ptr >=0 && (ptr == resp.size()-1 || resp[ptr+1].size() > resp[ptr].size())){
      |                                                                  ~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	332 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	1916 KB	Output is correct
2	Correct	14 ms	1868 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	1996 KB	Output is correct
2	Correct	13 ms	2036 KB	Output is correct
3	Correct	18 ms	1920 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	141 ms	14780 KB	Output is correct
2	Correct	130 ms	16476 KB	Output is correct
3	Correct	149 ms	15536 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	207 ms	19116 KB	Output is correct
2	Correct	279 ms	72764 KB	Output is correct
3	Correct	175 ms	21892 KB	Output is correct
4	Correct	212 ms	16940 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	227 ms	19228 KB	Output is correct
2	Correct	170 ms	19028 KB	Output is correct
3	Correct	178 ms	19704 KB	Output is correct
4	Correct	252 ms	19132 KB	Output is correct