Submission #532419

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
532419	2022-03-02T21:29:37 Z	definitelynotmee	Teams (CEOI11_tea)	C++	30 / 100	318 ms	74064 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 && 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]];
    };
    reverse(all(resp));
    for(int i = 0; i < resp.size()-1; i++){
        assert(resp[i].size() <= resp[i+1].size());
    }
    while(start < n){
        int ptr = 0;
        while(start < n && ptr < n && (ptr == 0 || resp[ptr-1].size() > resp[ptr].size())){
            resp[ptr].push_back(o[start]);
            ptr++;
            start++;
        }
    }
    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

tea.cpp: In function 'int main()':
tea.cpp:50:22: 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]
   50 |     for(int i = 0; i < resp.size()-1; i++){
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	316 KB	Output is correct
2	Incorrect	1 ms	312 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

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	456 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
0 / 10.0

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

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	2568 KB	Output is correct
2	Correct	15 ms	2244 KB	Output is correct
3	Correct	19 ms	2440 KB	Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	215 ms	20008 KB	Output is correct
2	Correct	318 ms	74064 KB	Output is correct
3	Incorrect	196 ms	23096 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	255 ms	19908 KB	Output is correct
2	Correct	204 ms	20408 KB	Output is correct
3	Incorrect	216 ms	21048 KB	Output isn't correct
4	Halted	0 ms	0 KB	-