제출 #227713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
227713		dolphingarlic	Teams (CEOI11_tea)	C++14	0 / 100	377 ms	27940 KiB

tea

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

컴파일 시 표준 에러 (stderr) 메시지

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: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10