Submission #1351297

#TimeUsernameProblemLanguageResultExecution timeMemory
1351297adam17Boardgames (CEOI25_boardgames)C++20
5 / 100
16 ms2584 KiB
#include <vector>
#include <algorithm>
using namespace std;

vector<int> partition_players(int N, int M, vector<int> U, vector<int> V) {
    if (M == 0) {
        vector<int> vysl(N, 1);
        return vysl;
    }
    sort(U.begin(), U.end());
    vector<int> vysl(0);
    int posl = -1;
    int j = 0;
    for (int i = 0; i < N; i++) {
        if (U[j] == i) {
            j++;
        } else {
            vysl.push_back(i - posl);
            posl = i;
        }
    }
    return vysl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...