oj.uz

Submission #858975

# Submission time Handle Problem Language Result Execution time Memory
858975 2023-10-09T13:50:18 Z NaimSS Gift (IZhO18_nicegift) C++14
30 / 100
 92 ms 9264 KB 
#include <bits/stdc++.h>
#include <iostream>
// #define int long long
#define ld long double
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v)),v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
// std::mt19937_64 rng64((int) std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937 rng(
  
//  (int) std::chrono::steady_clock::now().time_since_epoch().count()
   1239010
);
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
    b%=m;
    ll ans = 1;
    for (; e; b = b * b % m, e /= 2)
        if (e & 1) ans = ans * b % m;
    return ans;
}
// debug:
template<class T>void print_vector(vector<T> &v){
    rep(i,0,sz(v))cout<<v[i]<<" \n"[i==sz(v)-1];
}
void dbg_out() {cerr << endl; }
template<typename Head, typename ... Tail> void dbg_out(Head H,Tail... T){
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__), cerr << endl
#else
#define dbg(...) 42
#endif
//

const int N = 1e6 + 100;
int a[N];

int32_t main(){
    fastio;
	int n,k;
	cin >> n >> k;
	ll sum=0;
	rep(i,1,n+1){
		cin >> a[i];
		sum += a[i];
	}
	if(sum%k != 0){
		cout << -1 << endl;
		return 0;
	}

	vi ids;
	rep(i,1,n+1)ids.pb(i);
	sort(all(ids),[&](int i,int j){
		return a[i] > a[j];
	});

	set<pll> S;
	rep(i,1,n+1){
		S.insert({a[i] , i});
	}

	vector<pair<ll,vi> > res;

	if(S.begin()->ff == S.rbegin()->ff){
		// all equal

		int i = 0;
		int c0=0;
		do{
			vi v;
			rep(j,0,k){
				v.pb((j + i)%n + 1);
				if((i+j)%n == 0)c0++;
			}
			res.pb({0,v});
			i = (i + k)%n;
		}while(i!=0);
		ll tot = a[1]/c0;
		for(auto &it : res)it.ff = tot;
		rep(i,1,n+1)a[i]=0;
		S.clear();
	}

 
	while(sz(S) > 0){
		vi v;
		ll mn = 1;
		if(sz(S) < k){
			cout << -1 << endl;
			return 0;
		}
		while(sz(v) < k){
			auto it = S.rbegin();
			int id = it->ss;
			v.pb(id);
			mn = min(mn, it->ff);
			S.erase(S.find({a[id], id}));
		}
		res.pb({mn, v});
		for(auto id : v){
			a[id] -= mn;
			if(a[id])S.insert({a[id] , id});
		}
	}
	rep(i,1,n+1)assert(a[i] == 0);

	cout << sz(res) << endl;

	for(auto [X,v] : res){
		cout << X << " ";
		for(auto id : v)cout << id<<" ";
		cout << endl;
	}

	// math -> gcd it all
    // Did you swap N,M? N=1?
}

Compilation message

nicegift.cpp: In function 'int32_t main()':
nicegift.cpp:137:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  137 |  for(auto [X,v] : res){
      |           ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 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 1 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 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 344 KB n=5
8 Correct 2 ms 1112 KB n=8
9 Correct 22 ms 1368 KB n=14
10 Correct 14 ms 1112 KB n=11
11 Correct 92 ms 9032 KB n=50000
12 Correct 88 ms 9264 KB n=50000
13 Correct 76 ms 3812 KB n=10
14 Correct 70 ms 3536 KB n=685
15 Correct 73 ms 3772 KB n=623
16 Correct 41 ms 2312 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 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 344 KB n=5
8 Correct 2 ms 1112 KB n=8
9 Correct 22 ms 1368 KB n=14
10 Correct 14 ms 1112 KB n=11
11 Correct 92 ms 9032 KB n=50000
12 Correct 88 ms 9264 KB n=50000
13 Correct 76 ms 3812 KB n=10
14 Correct 70 ms 3536 KB n=685
15 Correct 73 ms 3772 KB n=623
16 Correct 41 ms 2312 KB n=973
17 Correct 73 ms 2968 KB n=989
18 Correct 17 ms 1084 KB n=563
19 Correct 21 ms 1464 KB n=592
20 Correct 24 ms 1496 KB n=938
21 Correct 21 ms 1240 KB n=747
22 Correct 22 ms 1240 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 344 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 1 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 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 344 KB n=5
8 Correct 2 ms 1112 KB n=8
9 Correct 22 ms 1368 KB n=14
10 Correct 14 ms 1112 KB n=11
11 Correct 92 ms 9032 KB n=50000
12 Correct 88 ms 9264 KB n=50000
13 Correct 76 ms 3812 KB n=10
14 Correct 70 ms 3536 KB n=685
15 Correct 73 ms 3772 KB n=623
16 Correct 41 ms 2312 KB n=973
17 Correct 73 ms 2968 KB n=989
18 Correct 17 ms 1084 KB n=563
19 Correct 21 ms 1464 KB n=592
20 Correct 24 ms 1496 KB n=938
21 Correct 21 ms 1240 KB n=747
22 Correct 22 ms 1240 KB n=991
23 Incorrect 6 ms 344 KB Jury has the answer but participant has not
24 Halted 0 ms 0 KB -