oj.uz

Submission #90934

# Submission time Handle Problem Language Result Execution time Memory
90934 2018-12-25T09:01:52 Z toloraia Gift (IZhO18_nicegift) C++14
30 / 100
 104 ms 20240 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second

using namespace std;

const ll N = 5e5 + 5, INF = 1e9 + 5;

ll n, k;
pair < ll, ll > P[N];
ll nn;
vector < ll > V[N], v;
ll S;

main()
{
    ios::sync_with_stdio(false);
    cin>>n>>k;
    for (ll i = 1; i <= n; i++){
        cin>>P[i].F;
        P[i].S = i;
        S += P[i].F;
    }
    sort (P + 1, P + n + 1);
    reverse (P + 1, P + n + 1);
    if (S <= 1e5){
        while (P[k].F > 0){
            ll I1 = k, I2 = k;
            for (ll i = 20; i >= 0; i--){
                if (I1 - (1<<i) <= 0)
                    continue;
                if (P[I1 - (1<<i)].F == P[k].F)
                    I1 -= (1<<i);
            }
            for (ll i = 20; i >= 0; i--){
                if (I2 + (1<<i) > n)
                    continue;
                if (P[I2 + (1<<i)].F == P[k].F)
                    I2 += (1<<i);
            }
            v.clear();
            for (ll i = 1; i < I1; i++){
                v.pb (P[i].S);
                P[i].F--;
            }
            for (ll i = I2; (ll)v.size() < k; i--){
                v.pb (P[i].S);
                P[i].F--;
            }
            V[++nn] = v;
        }
        if (P[1].F > 0){
            cout<<-1<<endl;
            return 0;
        }
        cout<<nn<<endl;
        for (ll i = 1; i <= nn; i++){
            cout<<"1 ";
            for (ll j = 0; j < k; j++)
                cout<<V[i][j]<<" ";
            cout<<endl;
        }
        return 0;
    }
    if (P[1].F == P[n].F){
        ll d = __gcd (n, k);
        ll m = k / d;
        if (P[1].F % m != 0){
            cout<<-1<<endl;
            return 0;
        }
        ll p = P[1].F / m;
        if ((n - k - n % k) + m * (k + n % k) > 3e6){
            cout<<-1<<endl;
            return 0;
        }
        cout<<(n - k - n % k) / k + (k + n % k) / d<<endl;
        for (ll i = 1; i <= k + n % k; i += d){
            cout<<p<<" ";
            for (ll j = i; j < i + k; j++)
                cout<<(j - 1) % n + 1<<" ";
            cout<<endl;
        }
        for (int i = 1; i <= n - k - n % k; i += k){
            cout<<P[1].F<<" ";
            for (int j = i; j < i + k; j++)
                cout<<(k + n % k + j - 1) % n + 1<<" ";
            cout<<endl;
        }
        return 0;
    }
    return 0;
}

Compilation message

nicegift.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB n=4
2 Correct 12 ms 12304 KB n=3
3 Correct 11 ms 12332 KB n=3
4 Correct 12 ms 12332 KB n=4
5 Correct 12 ms 12332 KB n=4
6 Correct 12 ms 12332 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB n=4
2 Correct 12 ms 12304 KB n=3
3 Correct 11 ms 12332 KB n=3
4 Correct 12 ms 12332 KB n=4
5 Correct 12 ms 12332 KB n=4
6 Correct 12 ms 12332 KB n=2
7 Correct 12 ms 12332 KB n=5
8 Correct 13 ms 12544 KB n=8
9 Correct 32 ms 12768 KB n=14
10 Correct 24 ms 12768 KB n=11
11 Correct 96 ms 15268 KB n=50000
12 Correct 97 ms 15376 KB n=50000
13 Correct 86 ms 15376 KB n=10
14 Correct 75 ms 15376 KB n=685
15 Correct 81 ms 15376 KB n=623
16 Correct 50 ms 15376 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB n=4
2 Correct 12 ms 12304 KB n=3
3 Correct 11 ms 12332 KB n=3
4 Correct 12 ms 12332 KB n=4
5 Correct 12 ms 12332 KB n=4
6 Correct 12 ms 12332 KB n=2
7 Correct 12 ms 12332 KB n=5
8 Correct 13 ms 12544 KB n=8
9 Correct 32 ms 12768 KB n=14
10 Correct 24 ms 12768 KB n=11
11 Correct 96 ms 15268 KB n=50000
12 Correct 97 ms 15376 KB n=50000
13 Correct 86 ms 15376 KB n=10
14 Correct 75 ms 15376 KB n=685
15 Correct 81 ms 15376 KB n=623
16 Correct 50 ms 15376 KB n=973
17 Correct 99 ms 15376 KB n=989
18 Correct 25 ms 15376 KB n=563
19 Correct 24 ms 15376 KB n=592
20 Correct 28 ms 15376 KB n=938
21 Correct 25 ms 15376 KB n=747
22 Correct 27 ms 15376 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 104 ms 20240 KB Jury has the answer but participant has not
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12024 KB n=4
2 Correct 12 ms 12304 KB n=3
3 Correct 11 ms 12332 KB n=3
4 Correct 12 ms 12332 KB n=4
5 Correct 12 ms 12332 KB n=4
6 Correct 12 ms 12332 KB n=2
7 Correct 12 ms 12332 KB n=5
8 Correct 13 ms 12544 KB n=8
9 Correct 32 ms 12768 KB n=14
10 Correct 24 ms 12768 KB n=11
11 Correct 96 ms 15268 KB n=50000
12 Correct 97 ms 15376 KB n=50000
13 Correct 86 ms 15376 KB n=10
14 Correct 75 ms 15376 KB n=685
15 Correct 81 ms 15376 KB n=623
16 Correct 50 ms 15376 KB n=973
17 Correct 99 ms 15376 KB n=989
18 Correct 25 ms 15376 KB n=563
19 Correct 24 ms 15376 KB n=592
20 Correct 28 ms 15376 KB n=938
21 Correct 25 ms 15376 KB n=747
22 Correct 27 ms 15376 KB n=991
23 Incorrect 104 ms 20240 KB Jury has the answer but participant has not
24 Halted 0 ms 0 KB -