oj.uz

Submission #891954

# Submission time Handle Problem Language Result Execution time Memory
891954 2023-12-24T13:55:01 Z Elvin_Fritl Gift (IZhO18_nicegift) C++17
30 / 100
 2000 ms 399388 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;
     set<pair<int , int>> q;
     vector<vector<int>> res;
     int sum = 0;
     rep(i,0,n) {
		 int x;
		 cin >> x;
		 q.insert({x , i});
		 sum += x;
	 }
	 if(sum%k != 0) {
		 cout << -1 << endl;
		 return;
	 }
	 for(int i=0;i<n - 1;i++) {
		 if(sum == 0) {
			 break;
		 }
		 if(q.size() == 0) {
			 break;
		 }
		 int pos = (*q.begin()).second;
		 int val = (*q.begin()).first;
		 q.erase(q.begin());
		 sum -= val;
		 while(val--) {
			 if(sum == 0) {
				 break;
			 }
			 if((int)q.size() < k - 1) {
				 cout << "-1 "<< endl;
				 return;
			 }
			 vector<int> ind , tmp(k);
			 vector<int> ind2(k);
			 ind.push_back(1);
			 for(int j=k - 1;j>=1;j--) {
				 tmp[j] = (*q.rbegin()).first;
				 ind.push_back((*q.rbegin()).second + 1);
				 ind2[j] = (*q.rbegin()).second + 1;
				 q.erase(--q.end());
			 }
			 ind.push_back(pos + 1);
			 if(tmp[1] == 0) {
				 cout << "-1 "<< endl;
				 return;
			 }
			 res.push_back(ind);
			 for(int j=1;j<k;j++) {
				 if(tmp[j] == 1) {
					 continue;
				 }
				 tmp[j]--;
				 sum--;
				 q.insert({tmp[j] , ind2[j] - 1});
			 }
		 }
	 }
	 if(q.size() > 0) {
		 cout << "-1 "<< endl;
		 return;
	 }
	 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 1 ms 348 KB n=3
4 Correct 0 ms 348 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 1 ms 348 KB n=3
4 Correct 0 ms 348 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 3 ms 1112 KB n=8
9 Correct 21 ms 1176 KB n=14
10 Correct 13 ms 1116 KB n=11
11 Correct 87 ms 5600 KB n=50000
12 Correct 90 ms 5736 KB n=50000
13 Correct 76 ms 3560 KB n=10
14 Correct 65 ms 3072 KB n=685
15 Correct 76 ms 3236 KB n=623
16 Correct 40 ms 1960 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 1 ms 348 KB n=3
4 Correct 0 ms 348 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 3 ms 1112 KB n=8
9 Correct 21 ms 1176 KB n=14
10 Correct 13 ms 1116 KB n=11
11 Correct 87 ms 5600 KB n=50000
12 Correct 90 ms 5736 KB n=50000
13 Correct 76 ms 3560 KB n=10
14 Correct 65 ms 3072 KB n=685
15 Correct 76 ms 3236 KB n=623
16 Correct 40 ms 1960 KB n=973
17 Correct 55 ms 3328 KB n=989
18 Correct 16 ms 1368 KB n=563
19 Correct 19 ms 1884 KB n=592
20 Correct 22 ms 1884 KB n=938
21 Correct 23 ms 1368 KB n=747
22 Correct 21 ms 1880 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2017 ms 399388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 1 ms 348 KB n=3
4 Correct 0 ms 348 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 3 ms 1112 KB n=8
9 Correct 21 ms 1176 KB n=14
10 Correct 13 ms 1116 KB n=11
11 Correct 87 ms 5600 KB n=50000
12 Correct 90 ms 5736 KB n=50000
13 Correct 76 ms 3560 KB n=10
14 Correct 65 ms 3072 KB n=685
15 Correct 76 ms 3236 KB n=623
16 Correct 40 ms 1960 KB n=973
17 Correct 55 ms 3328 KB n=989
18 Correct 16 ms 1368 KB n=563
19 Correct 19 ms 1884 KB n=592
20 Correct 22 ms 1884 KB n=938
21 Correct 23 ms 1368 KB n=747
22 Correct 21 ms 1880 KB n=991
23 Execution timed out 2017 ms 399388 KB Time limit exceeded
24 Halted 0 ms 0 KB -