oj.uz

답안 #90946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90946 2018-12-25T09:17:04 Z toloraia Gift (IZhO18_nicegift) C++14
49 / 100
 994 ms 220960 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 = 2e6 + 5, INF = 2e18 + 5;

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

main()
{
    ios::sync_with_stdio(false);
    cin>>n>>k;
    for (ll i = 1; i <= n; i++){
        cin>>P[i].F;
        P[i].S = i;
    }
    sort (P + 1, P + n + 1);
    reverse (P + 1, P + n + 1);
    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;
        cout<<n / d<<endl;
        for (ll i = 1; i <= n; i += d){
            cout<<p<<" ";
            for (ll j = i; j < i + k; j++)
                cout<<(j - 1) % n + 1<<" ";
            cout<<endl;
        }
        return 0;
    }
        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);
            }
            ll x = min (max (1ll, P[I1 - 1].F - P[I1].F), P[I2].F - P[I2 + 1].F);
            v.clear();
            v.pb(x);
            for (ll i = 1; i < I1; i++){
                v.pb (P[i].S);
                P[i].F-=x;
            }
            for (ll i = I2; (ll)v.size() <= k; i--){
                v.pb (P[i].S);
                P[i].F-=x;
            }
            V[++nn] = v;
        }
        if (P[1].F > 0){
            cout<<-1<<endl;
            return 0;
        }
        cout<<nn<<endl;
        for (ll i = 1; i <= nn; i++){
            cout<<V[i][0]<<" ";
            for (ll j = 1; j <= k; j++)
                cout<<V[i][j]<<" ";
            cout<<endl;
        }
    return 0;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 43 ms 47356 KB n=3
3 Correct 37 ms 47416 KB n=3
4 Correct 43 ms 47460 KB n=4
5 Correct 40 ms 47476 KB n=4
6 Correct 43 ms 47476 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 43 ms 47356 KB n=3
3 Correct 37 ms 47416 KB n=3
4 Correct 43 ms 47460 KB n=4
5 Correct 40 ms 47476 KB n=4
6 Correct 43 ms 47476 KB n=2
7 Correct 43 ms 47476 KB n=5
8 Correct 45 ms 47480 KB n=8
9 Correct 49 ms 47608 KB n=14
10 Correct 52 ms 47608 KB n=11
11 Correct 100 ms 49784 KB n=50000
12 Correct 123 ms 49968 KB n=50000
13 Correct 102 ms 49968 KB n=10
14 Correct 112 ms 49968 KB n=685
15 Correct 117 ms 49968 KB n=623
16 Correct 84 ms 49968 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 43 ms 47356 KB n=3
3 Correct 37 ms 47416 KB n=3
4 Correct 43 ms 47460 KB n=4
5 Correct 40 ms 47476 KB n=4
6 Correct 43 ms 47476 KB n=2
7 Correct 43 ms 47476 KB n=5
8 Correct 45 ms 47480 KB n=8
9 Correct 49 ms 47608 KB n=14
10 Correct 52 ms 47608 KB n=11
11 Correct 100 ms 49784 KB n=50000
12 Correct 123 ms 49968 KB n=50000
13 Correct 102 ms 49968 KB n=10
14 Correct 112 ms 49968 KB n=685
15 Correct 117 ms 49968 KB n=623
16 Correct 84 ms 49968 KB n=973
17 Correct 97 ms 49968 KB n=989
18 Correct 51 ms 49968 KB n=563
19 Correct 58 ms 49968 KB n=592
20 Correct 56 ms 49968 KB n=938
21 Correct 53 ms 49968 KB n=747
22 Correct 53 ms 49968 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 994 ms 77320 KB n=1000000
2 Correct 532 ms 77320 KB n=666666
3 Correct 267 ms 77320 KB n=400000
4 Correct 649 ms 77320 KB n=285714
5 Correct 51 ms 77320 KB n=20000
6 Correct 486 ms 77320 KB n=181818
7 Correct 43 ms 77320 KB n=10000
8 Correct 65 ms 77320 KB n=6666
9 Correct 38 ms 77320 KB n=4000
10 Correct 187 ms 77320 KB n=2857
11 Correct 39 ms 77320 KB n=2000

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 47352 KB n=4
2 Correct 43 ms 47356 KB n=3
3 Correct 37 ms 47416 KB n=3
4 Correct 43 ms 47460 KB n=4
5 Correct 40 ms 47476 KB n=4
6 Correct 43 ms 47476 KB n=2
7 Correct 43 ms 47476 KB n=5
8 Correct 45 ms 47480 KB n=8
9 Correct 49 ms 47608 KB n=14
10 Correct 52 ms 47608 KB n=11
11 Correct 100 ms 49784 KB n=50000
12 Correct 123 ms 49968 KB n=50000
13 Correct 102 ms 49968 KB n=10
14 Correct 112 ms 49968 KB n=685
15 Correct 117 ms 49968 KB n=623
16 Correct 84 ms 49968 KB n=973
17 Correct 97 ms 49968 KB n=989
18 Correct 51 ms 49968 KB n=563
19 Correct 58 ms 49968 KB n=592
20 Correct 56 ms 49968 KB n=938
21 Correct 53 ms 49968 KB n=747
22 Correct 53 ms 49968 KB n=991
23 Correct 994 ms 77320 KB n=1000000
24 Correct 532 ms 77320 KB n=666666
25 Correct 267 ms 77320 KB n=400000
26 Correct 649 ms 77320 KB n=285714
27 Correct 51 ms 77320 KB n=20000
28 Correct 486 ms 77320 KB n=181818
29 Correct 43 ms 77320 KB n=10000
30 Correct 65 ms 77320 KB n=6666
31 Correct 38 ms 77320 KB n=4000
32 Correct 187 ms 77320 KB n=2857
33 Correct 39 ms 77320 KB n=2000
34 Runtime error 440 ms 220960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
35 Halted 0 ms 0 KB -