oj.uz

답안 #170902

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170902 2019-12-26T16:45:24 Z emil_physmath Gift (IZhO18_nicegift) C++17
49 / 100
 2000 ms 139796 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef double ldouble;
typedef long long llong;
const int maxN = 100001;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<llong> arr(n);
    multiset<pair<llong, int>> a;
    llong mx = -1, sum = 0;
    for (int i = 0; i < n; ++i)
    {
        cin >> arr[i];
        sum += arr[i];
        mx = max(mx, arr[i]);
        a.insert({arr[i], i});
    }
    if (sum % k || mx > sum / k)
    {
        cout << -1 << endl;
        exit(0);
    }
    vector<pair<llong, vector<int>>> ans;
    while (a.rbegin()->first)
    {
        vector<int> cur;
        llong mn = a.rbegin()->first;
        auto it = a.rbegin();
        for (; cur.size() < k; ++it)
        {
            cur.push_back(it->second);
            mn = min(mn, it->first);
        }
        if (it != a.rend())
            mn = min(mn, max(1LL, sum / k - it->first));
        if (!mn) throw;
        // it->first <= (sum - k * mn) / k
        // k * it->first <= sum - k * mn
        // mn * k <= sum - k * it->first
        // mn <= sum / k - it->first
        /*
            mn = min(mn, a.rbegin()->first - it->first + 1);
        */
        /*
        if (!mn)
        {
            cout << -1 << endl;
            exit(0);
        }
        */
        for (int x: cur)
        {
            a.erase({arr[x], x});
            sum -= arr[x];
            a.insert({arr[x] -= mn, x});
            sum += arr[x];
        }
        ans.push_back({mn, cur});
        /*cerr << "a` ";
        for (pair<llong, int> i: a)
            cerr << i.first << ' ';
        cerr << endl;*/
    }
    cout << ans.size() << '\n';
    for (auto x: ans)
    {
        cout << x.first << ' ';
        for (int y: x.second)
            cout << y + 1 << ' ';
        cout << '\n';
    }
}
// 6 5 4 3 x
// x x-1 x-2 x-3 x

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:41:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (; cur.size() < k; ++it)
                ~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 56 ms 6312 KB n=50000
12 Correct 50 ms 5920 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 3 ms 504 KB n=623
16 Correct 3 ms 504 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 56 ms 6312 KB n=50000
12 Correct 50 ms 5920 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 3 ms 504 KB n=623
16 Correct 3 ms 504 KB n=973
17 Correct 3 ms 376 KB n=989
18 Correct 2 ms 376 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 3 ms 376 KB n=747
22 Correct 3 ms 504 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1604 ms 116688 KB n=1000000
2 Correct 961 ms 69352 KB n=666666
3 Correct 560 ms 37496 KB n=400000
4 Correct 364 ms 26220 KB n=285714
5 Correct 21 ms 2296 KB n=20000
6 Correct 214 ms 18668 KB n=181818
7 Correct 11 ms 1404 KB n=10000
8 Correct 8 ms 1016 KB n=6666
9 Correct 5 ms 760 KB n=4000
10 Correct 8 ms 888 KB n=2857
11 Correct 4 ms 504 KB n=2000

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n=4
2 Correct 2 ms 380 KB n=3
3 Correct 2 ms 256 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 2 ms 256 KB n=8
9 Correct 2 ms 376 KB n=14
10 Correct 2 ms 376 KB n=11
11 Correct 56 ms 6312 KB n=50000
12 Correct 50 ms 5920 KB n=50000
13 Correct 2 ms 376 KB n=10
14 Correct 2 ms 376 KB n=685
15 Correct 3 ms 504 KB n=623
16 Correct 3 ms 504 KB n=973
17 Correct 3 ms 376 KB n=989
18 Correct 2 ms 376 KB n=563
19 Correct 3 ms 376 KB n=592
20 Correct 3 ms 376 KB n=938
21 Correct 3 ms 376 KB n=747
22 Correct 3 ms 504 KB n=991
23 Correct 1604 ms 116688 KB n=1000000
24 Correct 961 ms 69352 KB n=666666
25 Correct 560 ms 37496 KB n=400000
26 Correct 364 ms 26220 KB n=285714
27 Correct 21 ms 2296 KB n=20000
28 Correct 214 ms 18668 KB n=181818
29 Correct 11 ms 1404 KB n=10000
30 Correct 8 ms 1016 KB n=6666
31 Correct 5 ms 760 KB n=4000
32 Correct 8 ms 888 KB n=2857
33 Correct 4 ms 504 KB n=2000
34 Correct 36 ms 3696 KB n=23514
35 Correct 38 ms 3828 KB n=23514
36 Correct 3 ms 504 KB n=940
37 Correct 2 ms 376 KB n=2
38 Correct 112 ms 9764 KB n=100000
39 Correct 104 ms 9760 KB n=100000
40 Correct 2 ms 376 KB n=10
41 Correct 2 ms 376 KB n=100
42 Correct 6 ms 504 KB n=1000
43 Correct 1868 ms 139796 KB n=1000000
44 Execution timed out 2065 ms 108912 KB Time limit exceeded
45 Halted 0 ms 0 KB -