# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
879444 |
2023-11-27T12:42:04 Z |
TAhmed33 |
Akcija (COCI21_akcija) |
C++ |
|
1815 ms |
524288 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <pair <ll, ll>> subs;
int n; ll w[2001], dd[2001];
vector <int> cur;
void recurse (int pos, int sze, ll cost) {
if (pos == n) {
vector <int> s = cur;
sort(s.begin(), s.end(), [&] (int a, int b) {
return dd[a] < dd[b];
});
bool flag = 1;
for (int i = 0; i < sze; i++) {
flag &= i <= dd[s[i]];
}
if (!flag) return;
subs.push_back({sze, cost});
return;
}
recurse(pos + 1, sze, cost);
cur.push_back(pos);
recurse(pos + 1, sze + 1, cost + w[pos]);
cur.pop_back();
}
int main () {
cin >> n; int k; cin >> k;
for (int i = 0; i < n; i++) cin >> w[i] >> dd[i], dd[i]--;
recurse(0, 0, 0);
sort(subs.begin(), subs.end(), [] (pair <ll, ll> &a, pair <ll, ll> &b) {
return a.first == b.first ? a.second < b.second : a.first > b.first;
});
for (int i = 0; i < k; i++) {
cout << subs[i].first << " " << subs[i].second << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1815 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1815 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1784 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
94 ms |
9160 KB |
Output is correct |
2 |
Correct |
197 ms |
17408 KB |
Output is correct |
3 |
Correct |
44 ms |
5324 KB |
Output is correct |
4 |
Correct |
30 ms |
2512 KB |
Output is correct |
5 |
Correct |
170 ms |
17444 KB |
Output is correct |
6 |
Correct |
12 ms |
344 KB |
Output is correct |
7 |
Correct |
52 ms |
1228 KB |
Output is correct |
8 |
Correct |
21 ms |
656 KB |
Output is correct |
9 |
Correct |
19 ms |
548 KB |
Output is correct |
10 |
Correct |
28 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
64 ms |
5580 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1793 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1815 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |