oj.uz

Submission #58706

# Submission time Handle Problem Language Result Execution time Memory
58706 2018-07-19T00:35:05 Z Benq Gift (IZhO18_nicegift) C++14
100 / 100
 1787 ms 158192 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000005;

int N,K;
ll sum, mx;
vpl v;
vpl tmp;

void ins(ll l, ll r, int x) {
    tmp.pb({l,x});
    tmp.pb({r+1,-x});
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> K;
    F0R(i,N) {
        ll A; cin >> A;
        sum += A;
        mx = max(mx,A);
        v.pb({A,i+1});
    }
    if (sum % K != 0 || mx > sum/K) {
        cout << -1;
        exit(0);
    }
    ll lst = 0;
    for (auto x: v) {
        if (lst+x.f-1 >= sum/K) {
            ins(lst,sum/K-1,x.s);
            ins(0,lst+x.f-1-sum/K,x.s);
        } else ins(lst,lst+x.f-1,x.s);
        lst = (lst+x.f)%(sum/K);
    }
    sort(all(tmp));
    set<int> cur;
    vector<pair<ll,vi>> ans;
    for (int i = 0; i < sz(tmp); ) {
        int I = i; 
        while (i < sz(tmp) && tmp[i].f == tmp[I].f) {
            if (tmp[i].s < 0) cur.erase(abs(tmp[i].s));
            else cur.insert(tmp[i].s);
            i ++;
        }
        if (i < sz(tmp)) {
            vi v; for (int i: cur) v.pb(i);
            ans.pb({tmp[i].f-tmp[I].f,v});
        }
    }
    cout << sz(ans) << "\n";
    for (auto a: ans) {
        cout << a.f << " ";
        for (int x: a.s) cout << x << " ";
        cout << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB n=4
2 Correct 3 ms 488 KB n=3
3 Correct 2 ms 488 KB n=3
4 Correct 3 ms 488 KB n=4
5 Correct 3 ms 488 KB n=4
6 Correct 3 ms 532 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB n=4
2 Correct 3 ms 488 KB n=3
3 Correct 2 ms 488 KB n=3
4 Correct 3 ms 488 KB n=4
5 Correct 3 ms 488 KB n=4
6 Correct 3 ms 532 KB n=2
7 Correct 3 ms 532 KB n=5
8 Correct 3 ms 532 KB n=8
9 Correct 3 ms 532 KB n=14
10 Correct 2 ms 532 KB n=11
11 Correct 55 ms 6900 KB n=50000
12 Correct 62 ms 6900 KB n=50000
13 Correct 3 ms 6900 KB n=10
14 Correct 4 ms 6900 KB n=685
15 Correct 4 ms 6900 KB n=623
16 Correct 6 ms 6900 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB n=4
2 Correct 3 ms 488 KB n=3
3 Correct 2 ms 488 KB n=3
4 Correct 3 ms 488 KB n=4
5 Correct 3 ms 488 KB n=4
6 Correct 3 ms 532 KB n=2
7 Correct 3 ms 532 KB n=5
8 Correct 3 ms 532 KB n=8
9 Correct 3 ms 532 KB n=14
10 Correct 2 ms 532 KB n=11
11 Correct 55 ms 6900 KB n=50000
12 Correct 62 ms 6900 KB n=50000
13 Correct 3 ms 6900 KB n=10
14 Correct 4 ms 6900 KB n=685
15 Correct 4 ms 6900 KB n=623
16 Correct 6 ms 6900 KB n=973
17 Correct 4 ms 6900 KB n=989
18 Correct 4 ms 6900 KB n=563
19 Correct 4 ms 6900 KB n=592
20 Correct 6 ms 6900 KB n=938
21 Correct 5 ms 6900 KB n=747
22 Correct 5 ms 6900 KB n=991

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1411 ms 93768 KB n=1000000
2 Correct 657 ms 93768 KB n=666666
3 Correct 379 ms 93768 KB n=400000
4 Correct 784 ms 93768 KB n=285714
5 Correct 23 ms 93768 KB n=20000
6 Correct 550 ms 93768 KB n=181818
7 Correct 16 ms 93768 KB n=10000
8 Correct 63 ms 93768 KB n=6666
9 Correct 7 ms 93768 KB n=4000
10 Correct 302 ms 93768 KB n=2857
11 Correct 0 ms 93768 KB n=2000

Subtask #5
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB n=4
2 Correct 3 ms 488 KB n=3
3 Correct 2 ms 488 KB n=3
4 Correct 3 ms 488 KB n=4
5 Correct 3 ms 488 KB n=4
6 Correct 3 ms 532 KB n=2
7 Correct 3 ms 532 KB n=5
8 Correct 3 ms 532 KB n=8
9 Correct 3 ms 532 KB n=14
10 Correct 2 ms 532 KB n=11
11 Correct 55 ms 6900 KB n=50000
12 Correct 62 ms 6900 KB n=50000
13 Correct 3 ms 6900 KB n=10
14 Correct 4 ms 6900 KB n=685
15 Correct 4 ms 6900 KB n=623
16 Correct 6 ms 6900 KB n=973
17 Correct 4 ms 6900 KB n=989
18 Correct 4 ms 6900 KB n=563
19 Correct 4 ms 6900 KB n=592
20 Correct 6 ms 6900 KB n=938
21 Correct 5 ms 6900 KB n=747
22 Correct 5 ms 6900 KB n=991
23 Correct 1411 ms 93768 KB n=1000000
24 Correct 657 ms 93768 KB n=666666
25 Correct 379 ms 93768 KB n=400000
26 Correct 784 ms 93768 KB n=285714
27 Correct 23 ms 93768 KB n=20000
28 Correct 550 ms 93768 KB n=181818
29 Correct 16 ms 93768 KB n=10000
30 Correct 63 ms 93768 KB n=6666
31 Correct 7 ms 93768 KB n=4000
32 Correct 302 ms 93768 KB n=2857
33 Correct 0 ms 93768 KB n=2000
34 Correct 33 ms 93768 KB n=23514
35 Correct 44 ms 93768 KB n=23514
36 Correct 4 ms 93768 KB n=940
37 Correct 3 ms 93768 KB n=2
38 Correct 184 ms 93768 KB n=100000
39 Correct 227 ms 93768 KB n=100000
40 Correct 4 ms 93768 KB n=10
41 Correct 2 ms 93768 KB n=100
42 Correct 12 ms 93768 KB n=1000
43 Correct 1496 ms 141012 KB n=1000000
44 Correct 1787 ms 158192 KB n=1000000
45 Correct 1245 ms 158192 KB n=666666
46 Correct 827 ms 158192 KB n=400000
47 Correct 250 ms 158192 KB n=2336
48 Correct 737 ms 158192 KB n=285714
49 Correct 685 ms 158192 KB n=181818
50 Correct 360 ms 158192 KB n=40000
51 Correct 314 ms 158192 KB n=20000
52 Correct 307 ms 158192 KB n=10000
53 Correct 310 ms 158192 KB n=6666
54 Correct 273 ms 158192 KB n=4000
55 Correct 217 ms 158192 KB n=2857
56 Correct 230 ms 158192 KB n=2000