oj.uz

답안 #1112677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112677 2024-11-14T14:33:12 Z vjudge1 Gift (IZhO18_nicegift) C++17
49 / 100
 2000 ms 122920 KB 
//Dost SEFEROĞLU
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " << 
#define vi vector<int>
#define all(xx) xx.begin(),xx.end()
#define ps(xxx) cout << (xxx) << endl;
const int N = 5e2+1,inf = 1e16,MOD = 1e9+7; 
 

void solve() { 
    int n,k;
    cin >> n >> k;
    int s = 0;
    set<pii,greater<pii>> ms;
    vi a(n+1);
    for (int i=1;i<=n;i++) {
        cin >> a[i];
        s+=a[i];
        ms.insert({a[i],i});
    }
    if (s%k != 0 || ms.rbegin()->ff > s/k) {
        cout << -1 << endl;
        return;
    } 
    vector<pair<int,vi>> ops;
    int sm = s/k;
    while (!ms.empty()) {
        vi vv;
        auto itt = ms.begin();
        int ctr = 0;
        for (;ctr != k;++itt) {
            vv.push_back(itt->ss);
            ctr++;
        }
        if (ms.size() == k) {
            if(ms.begin()->ff != ms.rbegin()->ff) {
                cout << -1 << endl;
                return;
            }
        }
        int knxt = next(ms.begin(),k-1)->ff;
        int subt = min(knxt,sm-((ms.size() > k) ? (next(ms.begin(),k)->ff) : 0ll));
        sm-=subt;
        for (auto it : vv) {
            ms.erase({a[it],it});
            if (a[it]-subt > 0) ms.insert({a[it]-subt,it});
            //else assert(a[it] == subt);
            a[it]-=subt;
        }
        ops.push_back({subt,vv});
    }
    cout << ops.size() << '\n';
    for (auto it : ops) {
        cout << it.ff << " ";
        for (auto itt : it.ss) cout << itt <<  " ";
        cout << '\n';
    }
}  
 
                
                            
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Compilation message

nicegift.cpp: In function 'void solve()':
nicegift.cpp:42:23: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int>, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   42 |         if (ms.size() == k) {
      |             ~~~~~~~~~~^~~~
nicegift.cpp:49:44: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int>, std::greater<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   49 |         int subt = min(knxt,sm-((ms.size() > k) ? (next(ms.begin(),k)->ff) : 0ll));
      |                                  ~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n=4
2 Correct 1 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2
7 Correct 1 ms 336 KB n=5
8 Correct 1 ms 336 KB n=8
9 Correct 1 ms 336 KB n=14
10 Correct 1 ms 336 KB n=11
11 Correct 25 ms 5316 KB n=50000
12 Correct 20 ms 5216 KB n=50000
13 Correct 1 ms 336 KB n=10
14 Correct 1 ms 504 KB n=685
15 Correct 1 ms 336 KB n=623
16 Correct 1 ms 336 KB n=973

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 626 ms 101148 KB n=1000000
2 Correct 353 ms 55116 KB n=666666
3 Correct 201 ms 32328 KB n=400000
4 Correct 182 ms 24512 KB n=285714
5 Correct 9 ms 1872 KB n=20000
6 Correct 87 ms 14632 KB n=181818
7 Correct 4 ms 1116 KB n=10000
8 Correct 4 ms 848 KB n=6666
9 Correct 3 ms 592 KB n=4000
10 Correct 4 ms 592 KB n=2857
11 Correct 2 ms 592 KB n=2000

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB n=4
2 Correct 1 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2
7 Correct 1 ms 336 KB n=5
8 Correct 1 ms 336 KB n=8
9 Correct 1 ms 336 KB n=14
10 Correct 1 ms 336 KB n=11
11 Correct 25 ms 5316 KB n=50000
12 Correct 20 ms 5216 KB n=50000
13 Correct 1 ms 336 KB n=10
14 Correct 1 ms 504 KB n=685
15 Correct 1 ms 336 KB n=623
16 Correct 1 ms 336 KB n=973
17 Correct 2 ms 336 KB n=989
18 Correct 1 ms 336 KB n=563
19 Correct 2 ms 336 KB n=592
20 Correct 2 ms 336 KB n=938
21 Correct 1 ms 336 KB n=747
22 Correct 1 ms 336 KB n=991
23 Correct 626 ms 101148 KB n=1000000
24 Correct 353 ms 55116 KB n=666666
25 Correct 201 ms 32328 KB n=400000
26 Correct 182 ms 24512 KB n=285714
27 Correct 9 ms 1872 KB n=20000
28 Correct 87 ms 14632 KB n=181818
29 Correct 4 ms 1116 KB n=10000
30 Correct 4 ms 848 KB n=6666
31 Correct 3 ms 592 KB n=4000
32 Correct 4 ms 592 KB n=2857
33 Correct 2 ms 592 KB n=2000
34 Correct 19 ms 3276 KB n=23514
35 Correct 28 ms 3276 KB n=23514
36 Correct 2 ms 592 KB n=940
37 Correct 1 ms 336 KB n=2
38 Correct 55 ms 9148 KB n=100000
39 Correct 51 ms 9256 KB n=100000
40 Correct 1 ms 336 KB n=10
41 Correct 1 ms 336 KB n=100
42 Correct 5 ms 592 KB n=1000
43 Correct 749 ms 116316 KB n=1000000
44 Execution timed out 2033 ms 122920 KB Time limit exceeded
45 Halted 0 ms 0 KB -