oj.uz

답안 #891987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891987 2023-12-24T14:38:25 Z Elvin_Fritl Gift (IZhO18_nicegift) C++17
100 / 100
 1437 ms 89968 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
/// toto -> 1
 
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define io                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define all(a) a.begin(),a.end()
#define rep(k,i,n) for(int k=i;k<n;k++)
#define repp(k,i,n) for(int k=n-1;k>=i;k--)
#define rech(k) for(char k='a';k<='z';k++)
#define SZ(a) (int)a.size()
#define MX(a) *max_element(all(a))
#define MN(a) *min_element(all(a))
#define SM(a) accumulate(all(a),0LL)
#define vi vector<int>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define vvi vector<vector<int>>
 
/// toto -> 2
 
const int modd = 1e9 + 7 , mod = 998244353;
 
 
typedef long long ll;
 
void F1(bool res) {
    if(res) {
        cout<<"Yes\n" ;
    }
    else {
        cout<<"No\n" ;
    }
}
 
struct mint{
    ll val;
 
    mint(int64_t v = 0) {
        v %= mod;
        if (v < 0) v += mod;
        val = v;
    }
 
    mint& operator+=(const mint& other) {
        val += other.val;
        if (val >= mod) val -= mod;
        return *this;
    }
 
    mint& operator-=(const mint& other) {
        val += mod - other.val;
        if (val >= mod) val -= mod;
        return *this;
    }
 
    mint& operator*=(const mint& other) {
        val = (int64_t)val * other.val % mod;
        return *this;
    }
 
    mint& operator/=(const mint& other) {
        return *this *= other.inv();
    }
 
    friend mint operator+(mint a, const mint& b) { return a += b; }
    friend mint operator-(mint a, const mint& b) { return a -= b; }
    friend mint operator*(mint a, const mint& b) { return a *= b; }
    friend mint operator/(mint a, const mint& b) { return a /= b; }
 
    mint pow(int64_t exp) const {
        mint a = *this, res = 1;
        while (exp > 0) {
            if (exp & 1)
                res *= a;
            a *= a;
            exp >>= 1;
        }
        return res;
    }
 
    mint inv() const {
        assert(val != 0);
        return pow(mod - 2);
    }
 
    friend ostream& operator<<(ostream& os, const mint& m) {
        return os << m.val;
    }
};
 
ll bp(ll n,ll m){
    if(m == 0){
        return 1;
    }
    if(m == 1){
        return n%mod;
    }
    if(m%2==0){
        return bp(n*n%mod,m/2)%mod;
    }
    return n*bp(n,m-1)%mod;
}
 
 
/// toto -> 3
 
const int N = 2e5 + 545, M = 2e4 + 434, inf = 1e9 + 99;
const ll inff = 1e12;
 
#define int long long
 
void solve() {
     int n,k;
     cin >> n >> k;
     priority_queue<pair<int , int>> q;
     vector<vector<int>> res;
     int sum = 0;
     rep(i,0,n) {
		 int x;
		 cin >> x;
		 q.push({x , i});
		 sum += x;
	 }
	 if(sum%k != 0 || (q.top()).first > sum/k) {
		 cout << -1 << endl;
		 return;
	 }
	 while(sum > 0) {
		 if((int)q.size() < k) {
			 cout << -1 << endl;
			 return;
		 }
		 vector<int> tmp(k);
		 vector<int> ind(k);
		 for(int j=k - 1;j>=0;j--) {
			 tmp[j] = q.top().first;
			 ind[j] = (q.top().second);
			 q.pop();
		 }
		 int fer = tmp[0];
		 if(q.size() > 0) {
		 	 fer = min(fer , sum/k - q.top().first);
		 }
		 assert(fer >= 0);
		 if(tmp[0] == 0) {
			 cout << -1 << endl;
			 return;
		 }
		 sum -= fer*k;
		 rep(j,0,k) {
			 if(tmp[j] <= fer) {
				 continue;
			 }
			 tmp[j] -= fer;
			 q.push({tmp[j] , ind[j]});
		 }
		 vector<int> tmpp;
		 tmpp.push_back(fer);
		 rep(j,0,k) {
			 tmpp.push_back(ind[j] + 1);
		 }
		 res.push_back(tmpp);
	 }
	 cout << res.size() << endl;
	 for(auto i:res) {
		 for(auto j:i) {
			 cout << j << " ";
		 }
		 cout << endl;
	 }
	 cout << endl;
}	 
 
int32_t main() {
 
    io;
    
    ll t=1;
    /// cin>>t;
    rep(_,1,t+1) {
        cerr << "Start of test case " << _ << "\n";
        ///cout<<"Case #"<<_<<": ";
        solve();
        cerr << endl;
        cerr << endl;
    }
    return 0;
 
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 600 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 600 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 51 ms 3304 KB n=50000
12 Correct 43 ms 2952 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 600 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 51 ms 3304 KB n=50000
12 Correct 43 ms 2952 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 344 KB n=938
21 Correct 1 ms 348 KB n=747
22 Correct 1 ms 348 KB n=991

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 931 ms 58656 KB n=1000000
2 Correct 478 ms 44192 KB n=666666
3 Correct 219 ms 26140 KB n=400000
4 Correct 131 ms 16568 KB n=285714
5 Correct 6 ms 1248 KB n=20000
6 Correct 71 ms 10432 KB n=181818
7 Correct 4 ms 856 KB n=10000
8 Correct 3 ms 604 KB n=6666
9 Correct 2 ms 600 KB n=4000
10 Correct 3 ms 604 KB n=2857
11 Correct 1 ms 600 KB n=2000

Subtask #5
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 1 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 600 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 1 ms 348 KB n=8
9 Correct 1 ms 348 KB n=14
10 Correct 0 ms 344 KB n=11
11 Correct 51 ms 3304 KB n=50000
12 Correct 43 ms 2952 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 1 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 348 KB n=592
20 Correct 1 ms 344 KB n=938
21 Correct 1 ms 348 KB n=747
22 Correct 1 ms 348 KB n=991
23 Correct 931 ms 58656 KB n=1000000
24 Correct 478 ms 44192 KB n=666666
25 Correct 219 ms 26140 KB n=400000
26 Correct 131 ms 16568 KB n=285714
27 Correct 6 ms 1248 KB n=20000
28 Correct 71 ms 10432 KB n=181818
29 Correct 4 ms 856 KB n=10000
30 Correct 3 ms 604 KB n=6666
31 Correct 2 ms 600 KB n=4000
32 Correct 3 ms 604 KB n=2857
33 Correct 1 ms 600 KB n=2000
34 Correct 31 ms 2104 KB n=23514
35 Correct 31 ms 2264 KB n=23514
36 Correct 2 ms 348 KB n=940
37 Correct 0 ms 348 KB n=2
38 Correct 57 ms 4804 KB n=100000
39 Correct 53 ms 4808 KB n=100000
40 Correct 0 ms 344 KB n=10
41 Correct 1 ms 348 KB n=100
42 Correct 2 ms 604 KB n=1000
43 Correct 1294 ms 80272 KB n=1000000
44 Correct 1437 ms 89968 KB n=1000000
45 Correct 804 ms 59160 KB n=666666
46 Correct 387 ms 36004 KB n=400000
47 Correct 8 ms 1112 KB n=2336
48 Correct 755 ms 53416 KB n=285714
49 Correct 591 ms 46536 KB n=181818
50 Correct 22 ms 2768 KB n=40000
51 Correct 10 ms 1500 KB n=20000
52 Correct 6 ms 992 KB n=10000
53 Correct 38 ms 4436 KB n=6666
54 Correct 4 ms 600 KB n=4000
55 Correct 157 ms 16216 KB n=2857
56 Correct 3 ms 600 KB n=2000