oj.uz

답안 #54149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54149 2018-07-02T13:19:54 Z egorlifar Gift (IZhO18_nicegift) C++17
30 / 100
 57 ms 50616 KB 
/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 2000228;


//11:50
//16:50
int n, k;
int a[MAXN];
int st[MAXN];
vector<pair<long long, int> > s[MAXN];
long long res[MAXN * 4];


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
    cin >> n >> k;
    long long sum = 0;
    int maxa = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
        chkmax(maxa, a[i]);
    }
    if (sum % k != 0 || maxa > sum / k) {
        cout << -1 << '\n';
        return 0;
    }
    long long cur = 0;
    int uk = 0;
    for (int i = 0; i < n; i++) {
        cur += a[i];
        if (cur >= sum / k) {
            long long rem = cur - sum / k;
            s[uk].pb({a[i] - rem, i});
            uk++;
            if (rem) {
                s[uk].pb({rem, i});
            }
            cur = rem;
        } else {
            s[uk].pb({a[i], i});
        }
    }
    int it = 0;
    while (true) {
        long long sub = 1e18;
        for (int i = 0; i < k; i++) {
            chkmin(sub, s[i][st[i]].first);
        }
        res[it] = sub;
        it++;
        for (int i = 0; i < k; i++) {
            res[it] = s[i][st[i]].second;
            it++;
        }
        bool bad = false;
        for (int i = 0; i < k; i++) {
            s[i][st[i]].first -= sub;
            if (s[i][st[i]].first == 0) {
                st[i]++;
                if (st[i] == sz(s[i])) {
                    bad = true;
                }
            }
        } 
        if (bad) {
            break;
        } 
    }
    cout << it / (k + 1) << endl;
    for (int i = 0; i < (it / (k + 1)); i++) {
        cout << res[i * (k + 1)];
        for (int j = i * (k + 1) + 1; j <= i * (k + 1) + k; j++) {
            cout << ' ' << res[j] + 1;
        }
        cout << '\n';
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 41 ms 47352 KB n=3
3 Correct 40 ms 47440 KB n=3
4 Correct 41 ms 47468 KB n=4
5 Correct 38 ms 47468 KB n=4
6 Correct 40 ms 47520 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 41 ms 47352 KB n=3
3 Correct 40 ms 47440 KB n=3
4 Correct 41 ms 47468 KB n=4
5 Correct 38 ms 47468 KB n=4
6 Correct 40 ms 47520 KB n=2
7 Correct 44 ms 47520 KB n=5
8 Correct 40 ms 47636 KB n=8
9 Correct 42 ms 47636 KB n=14
10 Correct 46 ms 47636 KB n=11
11 Correct 57 ms 50616 KB n=50000
12 Correct 56 ms 50616 KB n=50000
13 Correct 40 ms 50616 KB n=10
14 Correct 39 ms 50616 KB n=685
15 Correct 41 ms 50616 KB n=623
16 Correct 41 ms 50616 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 41 ms 47352 KB n=3
3 Correct 40 ms 47440 KB n=3
4 Correct 41 ms 47468 KB n=4
5 Correct 38 ms 47468 KB n=4
6 Correct 40 ms 47520 KB n=2
7 Correct 44 ms 47520 KB n=5
8 Correct 40 ms 47636 KB n=8
9 Correct 42 ms 47636 KB n=14
10 Correct 46 ms 47636 KB n=11
11 Correct 57 ms 50616 KB n=50000
12 Correct 56 ms 50616 KB n=50000
13 Correct 40 ms 50616 KB n=10
14 Correct 39 ms 50616 KB n=685
15 Correct 41 ms 50616 KB n=623
16 Correct 41 ms 50616 KB n=973
17 Correct 40 ms 50616 KB n=989
18 Correct 42 ms 50616 KB n=563
19 Correct 43 ms 50616 KB n=592
20 Correct 44 ms 50616 KB n=938
21 Correct 42 ms 50616 KB n=747
22 Correct 42 ms 50616 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 48 ms 50616 KB Jury has the answer but participant has not
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 41 ms 47352 KB n=3
3 Correct 40 ms 47440 KB n=3
4 Correct 41 ms 47468 KB n=4
5 Correct 38 ms 47468 KB n=4
6 Correct 40 ms 47520 KB n=2
7 Correct 44 ms 47520 KB n=5
8 Correct 40 ms 47636 KB n=8
9 Correct 42 ms 47636 KB n=14
10 Correct 46 ms 47636 KB n=11
11 Correct 57 ms 50616 KB n=50000
12 Correct 56 ms 50616 KB n=50000
13 Correct 40 ms 50616 KB n=10
14 Correct 39 ms 50616 KB n=685
15 Correct 41 ms 50616 KB n=623
16 Correct 41 ms 50616 KB n=973
17 Correct 40 ms 50616 KB n=989
18 Correct 42 ms 50616 KB n=563
19 Correct 43 ms 50616 KB n=592
20 Correct 44 ms 50616 KB n=938
21 Correct 42 ms 50616 KB n=747
22 Correct 42 ms 50616 KB n=991
23 Incorrect 48 ms 50616 KB Jury has the answer but participant has not
24 Halted 0 ms 0 KB -