# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
495262 |
2021-12-18T08:14:59 Z |
mansur |
Gift (IZhO18_nicegift) |
C++14 |
|
2000 ms |
267740 KB |
#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e9, N = 1e5 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
multiset<pii> s;
for (int i = 1; i <= n; i++) {
s.insert({a[i], i});
}
vector<vector<pii>> ans;
while (sz(s) >= k) {
vector<pii> pos;
while (sz(pos) < k) {
pii x = *--s.end();
x.ff--;
pos.pb(x);
s.erase(--s.end());
}
ans.pb(pos);
for (auto e: pos) {
if (e.ff) {
s.insert(e);
}
}
}
if (sz(s)) cout << -1, E;
cout << sz(ans) << nl;
for (auto e: ans) {
cout << 1 << ' ';
for (auto x: e) cout << x.ss << ' ';
cout << nl;
}
}
Compilation message
nicegift.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
3 | #pragma optimize ("g",on)
|
nicegift.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
34 | main() {
| ^~~~
nicegift.cpp: In function 'int main()':
nicegift.cpp:48:15: warning: comparison of integer expressions of different signedness: 'std::multiset<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
48 | while (sz(s) >= k) {
| ^
nicegift.cpp:50:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
50 | while (sz(pos) < k) {
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
n=4 |
2 |
Correct |
1 ms |
204 KB |
n=3 |
3 |
Correct |
1 ms |
204 KB |
n=3 |
4 |
Correct |
1 ms |
204 KB |
n=4 |
5 |
Correct |
0 ms |
204 KB |
n=4 |
6 |
Correct |
0 ms |
204 KB |
n=2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
n=4 |
2 |
Correct |
1 ms |
204 KB |
n=3 |
3 |
Correct |
1 ms |
204 KB |
n=3 |
4 |
Correct |
1 ms |
204 KB |
n=4 |
5 |
Correct |
0 ms |
204 KB |
n=4 |
6 |
Correct |
0 ms |
204 KB |
n=2 |
7 |
Correct |
1 ms |
204 KB |
n=5 |
8 |
Correct |
4 ms |
972 KB |
n=8 |
9 |
Correct |
7 ms |
1400 KB |
n=14 |
10 |
Correct |
5 ms |
972 KB |
n=11 |
11 |
Correct |
42 ms |
6760 KB |
n=50000 |
12 |
Correct |
36 ms |
6816 KB |
n=50000 |
13 |
Correct |
26 ms |
4212 KB |
n=10 |
14 |
Correct |
27 ms |
3640 KB |
n=685 |
15 |
Correct |
27 ms |
4048 KB |
n=623 |
16 |
Correct |
17 ms |
2436 KB |
n=973 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
n=4 |
2 |
Correct |
1 ms |
204 KB |
n=3 |
3 |
Correct |
1 ms |
204 KB |
n=3 |
4 |
Correct |
1 ms |
204 KB |
n=4 |
5 |
Correct |
0 ms |
204 KB |
n=4 |
6 |
Correct |
0 ms |
204 KB |
n=2 |
7 |
Correct |
1 ms |
204 KB |
n=5 |
8 |
Correct |
4 ms |
972 KB |
n=8 |
9 |
Correct |
7 ms |
1400 KB |
n=14 |
10 |
Correct |
5 ms |
972 KB |
n=11 |
11 |
Correct |
42 ms |
6760 KB |
n=50000 |
12 |
Correct |
36 ms |
6816 KB |
n=50000 |
13 |
Correct |
26 ms |
4212 KB |
n=10 |
14 |
Correct |
27 ms |
3640 KB |
n=685 |
15 |
Correct |
27 ms |
4048 KB |
n=623 |
16 |
Correct |
17 ms |
2436 KB |
n=973 |
17 |
Correct |
28 ms |
3424 KB |
n=989 |
18 |
Correct |
12 ms |
1592 KB |
n=563 |
19 |
Correct |
21 ms |
2456 KB |
n=592 |
20 |
Correct |
19 ms |
2356 KB |
n=938 |
21 |
Correct |
14 ms |
1904 KB |
n=747 |
22 |
Correct |
17 ms |
2064 KB |
n=991 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2096 ms |
267740 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
n=4 |
2 |
Correct |
1 ms |
204 KB |
n=3 |
3 |
Correct |
1 ms |
204 KB |
n=3 |
4 |
Correct |
1 ms |
204 KB |
n=4 |
5 |
Correct |
0 ms |
204 KB |
n=4 |
6 |
Correct |
0 ms |
204 KB |
n=2 |
7 |
Correct |
1 ms |
204 KB |
n=5 |
8 |
Correct |
4 ms |
972 KB |
n=8 |
9 |
Correct |
7 ms |
1400 KB |
n=14 |
10 |
Correct |
5 ms |
972 KB |
n=11 |
11 |
Correct |
42 ms |
6760 KB |
n=50000 |
12 |
Correct |
36 ms |
6816 KB |
n=50000 |
13 |
Correct |
26 ms |
4212 KB |
n=10 |
14 |
Correct |
27 ms |
3640 KB |
n=685 |
15 |
Correct |
27 ms |
4048 KB |
n=623 |
16 |
Correct |
17 ms |
2436 KB |
n=973 |
17 |
Correct |
28 ms |
3424 KB |
n=989 |
18 |
Correct |
12 ms |
1592 KB |
n=563 |
19 |
Correct |
21 ms |
2456 KB |
n=592 |
20 |
Correct |
19 ms |
2356 KB |
n=938 |
21 |
Correct |
14 ms |
1904 KB |
n=747 |
22 |
Correct |
17 ms |
2064 KB |
n=991 |
23 |
Execution timed out |
2096 ms |
267740 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |