oj.uz

Submission #227717

# Submission time Handle Problem Language Result Execution time Memory
227717 2020-04-28T14:56:47 Z dolphingarlic Teams (CEOI11_tea) C++14
80 / 100
 549 ms 81848 KB 
#include <bits/stdc++.h>
using namespace std;

pair<int, int> a[1000001];
vector<vector<int>> teams;
priority_queue<pair<int, int>> pq;

int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i].first);
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);

    while (n) {
        if (a[n].first > n) {
            int sz, idx;
            tie(sz, idx) = pq.top();
            pq.pop();
            teams[idx].push_back(a[n--].second);
            pq.push({sz - 1, idx});
        } else {
            int ptr = n;
            teams.push_back({});
            while (n - ptr != a[n].first) teams.back().push_back(a[ptr--].second);
            pq.push({-teams.back().size(), teams.size() - 1});
            n = ptr;
        }
    }

    printf("%d\n", teams.size());
    for (vector<int> i : teams) {
        printf("%d", i.size());
        for (int j : i) printf(" %d", j);
        printf("\n");
    }
    return 0;
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:33:32: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", teams.size());
                    ~~~~~~~~~~~~^
tea.cpp:35:30: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
         printf("%d", i.size());
                      ~~~~~~~~^
tea.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
tea.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 512 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 7 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2296 KB Output is correct
2 Correct 30 ms 2168 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2560 KB Output is correct
2 Correct 30 ms 2304 KB Output is correct
3 Correct 35 ms 2552 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 15864 KB Output is correct
2 Correct 264 ms 18908 KB Output is correct
3 Correct 276 ms 20044 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 20360 KB Output is correct
2 Correct 549 ms 81848 KB Output is correct
3 Correct 352 ms 24884 KB Output is correct
4 Correct 359 ms 22156 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 22588 KB Output is correct
2 Correct 297 ms 30812 KB Output is correct
3 Correct 343 ms 23800 KB Output is correct
4 Correct 389 ms 25184 KB Output is correct