oj.uz

답안 #667798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667798 2022-12-02T04:23:45 Z Kaztaev_Alisher Gift (IZhO18_nicegift) C++17
30 / 100
 1230 ms 238468 KB 
//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long  , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x  << " = " << x << endl;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;

const ll N = 1e6+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;

using namespace std;

set<pll>st;
pll b[N];
vector<int> v[N];
void solve(){
	ll n , k ,cnt = 0;
	cin >> n >> k;
	for(int i = 1; i <= n; i++){
		ll a;
		cin >> a;
		st.ins({a , i});
	}
	while(st.sz()){
		++cnt;
		if(st.sz() < k){
			cout << "-1\n";
			return;
		}
		for(int i = 1; i <= k; i++){
			b[i] = *st.rbegin();
			st.ers(*st.rbegin());
			v[cnt].pb(b[i].S);
		}
		for(int i = 1; i <= k; i++) {
			b[i].F--;
			if(b[i].F) st.ins({b[i].F , b[i].S});
		}
	}
	cout << cnt <<"\n";
	for(int i = 1; i <= cnt; i++){
		cout << 1 <<" ";
		for(int x : v[i]) cout << x <<" ";
		cout << "\n";
	}
}
signed main(){
	ios;
	solve();
	return 0;
}
/*
*/

Compilation message

nicegift.cpp: In function 'void solve()':
nicegift.cpp:50:14: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   50 |   if(st.sz() < k){
      |      ~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB n=4
2 Correct 12 ms 23764 KB n=3
3 Correct 12 ms 23764 KB n=3
4 Correct 12 ms 23760 KB n=4
5 Correct 12 ms 23744 KB n=4
6 Correct 13 ms 23764 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB n=4
2 Correct 12 ms 23764 KB n=3
3 Correct 12 ms 23764 KB n=3
4 Correct 12 ms 23760 KB n=4
5 Correct 12 ms 23744 KB n=4
6 Correct 13 ms 23764 KB n=2
7 Correct 12 ms 23764 KB n=5
8 Correct 15 ms 24020 KB n=8
9 Correct 19 ms 24256 KB n=14
10 Correct 16 ms 24144 KB n=11
11 Correct 53 ms 28272 KB n=50000
12 Correct 66 ms 28400 KB n=50000
13 Correct 35 ms 25728 KB n=10
14 Correct 36 ms 25540 KB n=685
15 Correct 40 ms 25676 KB n=623
16 Correct 29 ms 24844 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB n=4
2 Correct 12 ms 23764 KB n=3
3 Correct 12 ms 23764 KB n=3
4 Correct 12 ms 23760 KB n=4
5 Correct 12 ms 23744 KB n=4
6 Correct 13 ms 23764 KB n=2
7 Correct 12 ms 23764 KB n=5
8 Correct 15 ms 24020 KB n=8
9 Correct 19 ms 24256 KB n=14
10 Correct 16 ms 24144 KB n=11
11 Correct 53 ms 28272 KB n=50000
12 Correct 66 ms 28400 KB n=50000
13 Correct 35 ms 25728 KB n=10
14 Correct 36 ms 25540 KB n=685
15 Correct 40 ms 25676 KB n=623
16 Correct 29 ms 24844 KB n=973
17 Correct 40 ms 25216 KB n=989
18 Correct 26 ms 24356 KB n=563
19 Correct 38 ms 24780 KB n=592
20 Correct 36 ms 24696 KB n=938
21 Correct 29 ms 24616 KB n=747
22 Correct 32 ms 24588 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1230 ms 238468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB n=4
2 Correct 12 ms 23764 KB n=3
3 Correct 12 ms 23764 KB n=3
4 Correct 12 ms 23760 KB n=4
5 Correct 12 ms 23744 KB n=4
6 Correct 13 ms 23764 KB n=2
7 Correct 12 ms 23764 KB n=5
8 Correct 15 ms 24020 KB n=8
9 Correct 19 ms 24256 KB n=14
10 Correct 16 ms 24144 KB n=11
11 Correct 53 ms 28272 KB n=50000
12 Correct 66 ms 28400 KB n=50000
13 Correct 35 ms 25728 KB n=10
14 Correct 36 ms 25540 KB n=685
15 Correct 40 ms 25676 KB n=623
16 Correct 29 ms 24844 KB n=973
17 Correct 40 ms 25216 KB n=989
18 Correct 26 ms 24356 KB n=563
19 Correct 38 ms 24780 KB n=592
20 Correct 36 ms 24696 KB n=938
21 Correct 29 ms 24616 KB n=747
22 Correct 32 ms 24588 KB n=991
23 Runtime error 1230 ms 238468 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -