oj.uz

Submission #334611

# Submission time Handle Problem Language Result Execution time Memory
334611 2020-12-09T15:01:40 Z talant117408 Gift (IZhO18_nicegift) C++17
7 / 100
 2000 ms 31948 KB 
/*
    Code written by Talant I.D.
*/
  
#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;
}

int main(){
    //do_not_disturb
    /*
    int n, m;
    int i, j;
    cin >> n >> m;
    int grid[n+1][m+1];
    int pref[2][n+2][m+2], suff[2][n+2][m+2];
    for(i = 1; i <= n; i++){
        for(j = 1; j <= m; j++){
            char ch;
            cin >> ch;
            if(ch == '0') grid[i][j] = 0;
            else grid[i][j] = 1;
        }
    }
    
    */
    
    ll n, k;
    cin >> n >> k;
    vector <ll> v(n);
    ll sum = 0;
    for(auto &to : v) cin >> to;
    for(auto to : v) sum += to;
    
    if(sum % k){
        cout << -1;
        return 0;
    }
    
    vector <vector <ll>> operations;
    vector <vector <pll>> vec(k);
    ll cnt = 0, ind = 0;
    
    for(ll i = 0; i < n; i++){
        ll del = min(v[i], abs(sum/k-cnt));
        cnt += del;
        v[i] -= del;
        vec[ind].pb(mp(del, i+1));
        if(cnt == sum/k){
            cnt = 0;
            ind++;
            if(v[i]) i--;
        }
    }
    
    while(1){
        int flag = 0;
        for(auto it : vec) if(sz(it)) flag++;
        if(!flag) break;
        if(flag != k){
            cout << -1 << endl;
            return 0;
        }
        vector <ll> op;
        ll mn = 9e18;
        for(auto it : vec) mn = min(mn, it.back().first);
        op.pb(mn);
        
        for(ll i = 0; i < k; i++){
            auto &it = vec[i];
            op.pb(it.back().second);
            it.back().first -= mn;
            if(it.back().first == 0) it.pop_back();
        }
        operations.pb(op);
    }
    
    cout << sz(operations) << endl;
    for(auto it : operations){
        for(auto to : it) cout << to << ' ';
        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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 372 KB n=3
3 Correct 1 ms 372 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 372 KB n=3
3 Correct 1 ms 372 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Incorrect 1 ms 364 KB Same heap occurs twice
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 372 KB n=3
3 Correct 1 ms 372 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Incorrect 1 ms 364 KB Same heap occurs twice
9 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2055 ms 31948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 372 KB n=3
3 Correct 1 ms 372 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Incorrect 1 ms 364 KB Same heap occurs twice
9 Halted 0 ms 0 KB -