oj.uz

답안 #334377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334377 2020-12-09T05:33:16 Z talant117408 Gift (IZhO18_nicegift) C++17
30 / 100
 332 ms 22636 KB 
/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;
using namespace std;

//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
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); link.resize(n); 
            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){
            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;
}

int main(){
    do_not_disturb
    
    ll n, k;
    cin >> n >> k;
    vector <ll> v(n);
    set <ll> st;
    ll sum = 0;
    
    for(auto &to : v) cin >> to;
    for(auto to : v) st.insert(to);
    for(auto to : v) sum += to;
    
    if(sz(st) == 1){
        if(n*v[0] % k){
            cout << -1 << endl;
            return 0;
        }
        if(n % k == 0){
            cout << n/k << endl;
            for(int i = 0; i < n; i += k){
                cout << v[i] << ' ';
                for(int j = i; j < i+k; j++){
                    cout << j+1 << ' ';
                }
                cout << endl;
            }
        }
        else{
            cout << n << endl;
            int l = 0;
            for(int i = 0; i < n; i++){
                cout << v[i]/k << ' ';
                for(int j = 0; j < k; j++){
                    cout << l+1 << ' ';
                    l = (l+1)%n;
                }
                cout << endl;
            }
        }
    }
    else if(sum <= 100000ll){
        if(sum % k){
            cout << -1 << endl;
        }
        else{
            priority_queue <pll> K;
            for(ll i = 0; i < n; i++){
                K.push(mp(v[i], i));
            }
            
            vector <vector <int>> operations;
            
            int flag = 0;
            
            while(K.top().first){
                vector <pll> vec;
                for(int i = 0; i < k; i++){
                    vec.pb(K.top());
                    K.pop();
                }
                for(int i = 0; i < k; i++){
                    if(vec[i].first == 0){
                        flag++;
                        break;
                    }
                }
                
                vector <int> op;
                op.pb(1);
                for(int i = 0; i < k; i++){
                    op.pb(vec[i].second+1);
                    vec[i].first--;
                }
                for(int i = 0; i < k; i++){
                    K.push(vec[i]);
                }
                operations.pb(op);
                if(flag) break;
            }
            if(flag) cout << -1 << endl;
            else{
                cout << sz(operations) << endl;
                for(auto to : operations){
                    for(auto to2 : to){
                        cout << to2 << ' ';
                    }
                    cout  << endl;
                }
            }
        }
    }
    
    return 0;
}
/* 
3 3
1 5 1
2 3
1 1 5
2 3
*/

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 0 ms 364 KB n=3
3 Correct 0 ms 364 KB n=3
4 Correct 0 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 0 ms 364 KB n=2
7 Correct 0 ms 364 KB n=5
8 Correct 4 ms 1024 KB n=8
9 Correct 10 ms 1192 KB n=14
10 Correct 6 ms 1004 KB n=11
11 Correct 48 ms 4964 KB n=50000
12 Correct 50 ms 4964 KB n=50000
13 Correct 32 ms 3488 KB n=10
14 Correct 32 ms 3104 KB n=685
15 Correct 34 ms 3380 KB n=623
16 Correct 20 ms 2084 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 0 ms 364 KB n=3
3 Correct 0 ms 364 KB n=3
4 Correct 0 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 0 ms 364 KB n=2
7 Correct 0 ms 364 KB n=5
8 Correct 4 ms 1024 KB n=8
9 Correct 10 ms 1192 KB n=14
10 Correct 6 ms 1004 KB n=11
11 Correct 48 ms 4964 KB n=50000
12 Correct 50 ms 4964 KB n=50000
13 Correct 32 ms 3488 KB n=10
14 Correct 32 ms 3104 KB n=685
15 Correct 34 ms 3380 KB n=623
16 Correct 20 ms 2084 KB n=973
17 Correct 31 ms 2596 KB n=989
18 Correct 13 ms 1004 KB n=563
19 Correct 19 ms 1408 KB n=592
20 Correct 22 ms 1516 KB n=938
21 Correct 16 ms 1260 KB n=747
22 Correct 17 ms 1260 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 332 ms 22636 KB n=1000000
2 Correct 203 ms 13420 KB n=666666
3 Correct 112 ms 7404 KB n=400000
4 Correct 276 ms 19820 KB n=285714
5 Correct 6 ms 620 KB n=20000
6 Correct 241 ms 17132 KB n=181818
7 Correct 5 ms 492 KB n=10000
8 Incorrect 173 ms 10220 KB Not all heaps are empty in the end
9 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 0 ms 364 KB n=3
3 Correct 0 ms 364 KB n=3
4 Correct 0 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 0 ms 364 KB n=2
7 Correct 0 ms 364 KB n=5
8 Correct 4 ms 1024 KB n=8
9 Correct 10 ms 1192 KB n=14
10 Correct 6 ms 1004 KB n=11
11 Correct 48 ms 4964 KB n=50000
12 Correct 50 ms 4964 KB n=50000
13 Correct 32 ms 3488 KB n=10
14 Correct 32 ms 3104 KB n=685
15 Correct 34 ms 3380 KB n=623
16 Correct 20 ms 2084 KB n=973
17 Correct 31 ms 2596 KB n=989
18 Correct 13 ms 1004 KB n=563
19 Correct 19 ms 1408 KB n=592
20 Correct 22 ms 1516 KB n=938
21 Correct 16 ms 1260 KB n=747
22 Correct 17 ms 1260 KB n=991
23 Correct 332 ms 22636 KB n=1000000
24 Correct 203 ms 13420 KB n=666666
25 Correct 112 ms 7404 KB n=400000
26 Correct 276 ms 19820 KB n=285714
27 Correct 6 ms 620 KB n=20000
28 Correct 241 ms 17132 KB n=181818
29 Correct 5 ms 492 KB n=10000
30 Incorrect 173 ms 10220 KB Not all heaps are empty in the end
31 Halted 0 ms 0 KB -