oj.uz

답안 #334649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334649 2020-12-09T15:45:14 Z talant117408 Gift (IZhO18_nicegift) C++17
100 / 100
 1229 ms 143764 KB 
/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}

class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n+1, 1); link.resize(n+1); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b, int val){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
            
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 1e6+7;
ll v[N];
vector <ll> operations[N];
vector <pll> vec[N];

int main(){
    //do_not_disturb
    
    int i;
    ll n, k;
    cin >> n >> k;
    ll sum = 0, mx = 0;
    for(i = 0; i < n; i++){
        cin >> v[i];
        sum += v[i];
        mx = max(mx, v[i]);
    }
    
    if(sum % k || mx > sum/k){
        cout << -1;
        return 0;
    }
    
    ll cnt = 0, ind = 0;
    
    for(i = 0; i < n; i++){
        cnt += v[i];
        if(cnt >= sum/k){
            vec[ind++].pb(mp(v[i]-cnt+sum/k, i));
            cnt -= sum/k;
            if(cnt) vec[ind].pb(mp(cnt, i));
        }
        else{
            vec[ind].pb(mp(v[i], i));
        }
    }
    for(i = 0; i < ind; i++) reverse(all(vec[i]));
    int ind2 = 0;
    
    bool flag = 1;
    while(flag){
        flag = 0;
        ll mn = 9e18;
        for(i = 0; i < ind; i++) mn = min(mn, vec[i].back().first);
        operations[ind2].pb(mn-1);
        
        for(i = 0; i < k; i++){
            operations[ind2].pb(vec[i].back().second);
            vec[i].back().first -= mn;
            if(vec[i].back().first == 0) vec[i].pop_back();
        }
        ind2++;
        flag |= !vec[0].empty();
    }
    
    cout << ind2 << endl;
    for(int i = 0; i < ind2; i++){
        auto it = operations[i];
        for(auto to : it) cout << to+1 << ' ';
        cout << endl;
    }
    
    return 0;
}
/*
6 6
000111
011111
011111
111000
111000
111000

6 6
000000
111000
111100
001111
000111
000111
*/

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47340 KB n=4
2 Correct 35 ms 47340 KB n=3
3 Correct 34 ms 47340 KB n=3
4 Correct 34 ms 47340 KB n=4
5 Correct 35 ms 47340 KB n=4
6 Correct 34 ms 47340 KB n=2
7 Correct 40 ms 47340 KB n=5
8 Correct 34 ms 47340 KB n=8
9 Correct 34 ms 47340 KB n=14
10 Correct 34 ms 47340 KB n=11
11 Correct 67 ms 51184 KB n=50000
12 Correct 66 ms 50916 KB n=50000
13 Correct 36 ms 47488 KB n=10
14 Correct 35 ms 47340 KB n=685
15 Correct 34 ms 47340 KB n=623
16 Correct 35 ms 47340 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47340 KB n=4
2 Correct 35 ms 47340 KB n=3
3 Correct 34 ms 47340 KB n=3
4 Correct 34 ms 47340 KB n=4
5 Correct 35 ms 47340 KB n=4
6 Correct 34 ms 47340 KB n=2
7 Correct 40 ms 47340 KB n=5
8 Correct 34 ms 47340 KB n=8
9 Correct 34 ms 47340 KB n=14
10 Correct 34 ms 47340 KB n=11
11 Correct 67 ms 51184 KB n=50000
12 Correct 66 ms 50916 KB n=50000
13 Correct 36 ms 47488 KB n=10
14 Correct 35 ms 47340 KB n=685
15 Correct 34 ms 47340 KB n=623
16 Correct 35 ms 47340 KB n=973
17 Correct 35 ms 47340 KB n=989
18 Correct 36 ms 47468 KB n=563
19 Correct 36 ms 47468 KB n=592
20 Correct 36 ms 47468 KB n=938
21 Correct 42 ms 47468 KB n=747
22 Correct 36 ms 47468 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 909 ms 108728 KB n=1000000
2 Correct 586 ms 81348 KB n=666666
3 Correct 350 ms 66892 KB n=400000
4 Correct 604 ms 93896 KB n=285714
5 Correct 49 ms 48108 KB n=20000
6 Correct 516 ms 92644 KB n=181818
7 Correct 42 ms 47852 KB n=10000
8 Correct 86 ms 53612 KB n=6666
9 Correct 37 ms 47468 KB n=4000
10 Correct 324 ms 79724 KB n=2857
11 Correct 36 ms 47468 KB n=2000

Subtask #5
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47340 KB n=4
2 Correct 35 ms 47340 KB n=3
3 Correct 34 ms 47340 KB n=3
4 Correct 34 ms 47340 KB n=4
5 Correct 35 ms 47340 KB n=4
6 Correct 34 ms 47340 KB n=2
7 Correct 40 ms 47340 KB n=5
8 Correct 34 ms 47340 KB n=8
9 Correct 34 ms 47340 KB n=14
10 Correct 34 ms 47340 KB n=11
11 Correct 67 ms 51184 KB n=50000
12 Correct 66 ms 50916 KB n=50000
13 Correct 36 ms 47488 KB n=10
14 Correct 35 ms 47340 KB n=685
15 Correct 34 ms 47340 KB n=623
16 Correct 35 ms 47340 KB n=973
17 Correct 35 ms 47340 KB n=989
18 Correct 36 ms 47468 KB n=563
19 Correct 36 ms 47468 KB n=592
20 Correct 36 ms 47468 KB n=938
21 Correct 42 ms 47468 KB n=747
22 Correct 36 ms 47468 KB n=991
23 Correct 909 ms 108728 KB n=1000000
24 Correct 586 ms 81348 KB n=666666
25 Correct 350 ms 66892 KB n=400000
26 Correct 604 ms 93896 KB n=285714
27 Correct 49 ms 48108 KB n=20000
28 Correct 516 ms 92644 KB n=181818
29 Correct 42 ms 47852 KB n=10000
30 Correct 86 ms 53612 KB n=6666
31 Correct 37 ms 47468 KB n=4000
32 Correct 324 ms 79724 KB n=2857
33 Correct 36 ms 47468 KB n=2000
34 Correct 55 ms 49384 KB n=23514
35 Correct 56 ms 49384 KB n=23514
36 Correct 34 ms 47340 KB n=940
37 Correct 34 ms 47340 KB n=2
38 Correct 167 ms 60772 KB n=100000
39 Correct 164 ms 60644 KB n=100000
40 Correct 34 ms 47340 KB n=10
41 Correct 35 ms 47340 KB n=100
42 Correct 41 ms 48108 KB n=1000
43 Correct 995 ms 139572 KB n=1000000
44 Correct 1229 ms 143764 KB n=1000000
45 Correct 931 ms 115908 KB n=666666
46 Correct 701 ms 105944 KB n=400000
47 Correct 316 ms 75372 KB n=2336
48 Correct 598 ms 93856 KB n=285714
49 Correct 509 ms 92612 KB n=181818
50 Correct 364 ms 80876 KB n=40000
51 Correct 336 ms 79212 KB n=20000
52 Correct 322 ms 77676 KB n=10000
53 Correct 326 ms 84076 KB n=6666
54 Correct 309 ms 73040 KB n=4000
55 Correct 320 ms 79724 KB n=2857
56 Correct 308 ms 71788 KB n=2000