QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#630295 | #8790. First Billion | qianchen06# | TL | 108ms | 3912kb | C++20 | 911b | 2024-10-11 17:39:18 | 2024-10-11 17:39:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 10;
long long n;
pair<long long, int> a[N];
mt19937 rnd(time(0));
bool check()
{
long long sum = 0;
for (int i = 1; i <= n and sum < 1e9; i++)
sum += a[i].first;
return sum == 1e9;
}
void solve()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i].first;
a[i].second = i;
}
while (!check())
shuffle(a + 1, a + 1 + n, rnd);
long long sum = 0;
vector<int> ans;
for (int i = 1; i <= n and sum <1e9; i++)
{
ans.push_back(a[i].second);
sum += a[i].first;
}
cout << ans.size() << " ";
for (int ai : ans)
cout << ai << " ";
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3912kb
input:
10 386413329 88494216 245947398 316438989 192751270 204627269 65749456 3938400 150458676 345180997
output:
5 2 3 10 4 8
result:
ok OK (n = 10)
Test #2:
score: 0
Accepted
time: 1ms
memory: 3912kb
input:
10 119486233 299942886 169540407 349937991 597883752 32230162 140514533 57341098 12602102 220520836
output:
5 6 8 9 2 5
result:
ok OK (n = 10)
Test #3:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
14 384615281 84612238 83310504 54746763 142296081 56775470 128760350 343006424 177232390 214368720 67220468 21895072 16352717 224807522
output:
7 7 9 12 13 6 1 10
result:
ok OK (n = 14)
Test #4:
score: 0
Accepted
time: 1ms
memory: 3716kb
input:
14 270208635 14270307 89661499 113578022 47687195 101043954 38775146 208193324 650676076 351701957 3427619 59535626 24230888 27009752
output:
7 8 5 7 14 9 13 11
result:
ok OK (n = 14)
Test #5:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
20 61638928 106712373 5946815 178135484 4937573 111395400 15504655 67139983 101814514 312223647 130341028 43244171 37671364 54108486 337181317 37924824 153793862 70383750 102917244 66984582
output:
10 13 18 5 12 4 11 14 10 8 9
result:
ok OK (n = 20)
Test #6:
score: 0
Accepted
time: 9ms
memory: 3628kb
input:
20 67858098 61231428 99398662 1883806 82465954 303619377 87516412 154956240 94872199 76508350 13276828 136541811 203282099 99160366 127539385 13364660 141176136 39751629 67888657 127707903
output:
10 15 2 10 9 7 6 18 16 19 20
result:
ok OK (n = 20)
Test #7:
score: 0
Accepted
time: 107ms
memory: 3684kb
input:
24 17125795 281143405 10375259 196293002 158174864 34520650 52919232 87393970 99085271 62281508 67168428 55174991 54533464 51393059 89276370 41441658 72793517 30466999 73758332 97064918 111541434 142047546 12934221 101092107
output:
12 3 15 23 18 20 22 17 13 4 19 10 5
result:
ok OK (n = 24)
Test #8:
score: 0
Accepted
time: 108ms
memory: 3684kb
input:
24 70224368 148769600 36654748 23404220 15009825 57449487 46896672 6065662 10377031 133719710 23220853 184445684 8462667 88501546 155244839 229323557 140109402 52520271 78995771 75721556 87987586 118427778 107013825 101453342
output:
12 18 13 8 15 24 6 14 22 4 2 16 9
result:
ok OK (n = 24)
Test #9:
score: -100
Time Limit Exceeded
input:
28 122321206 60841271 22767116 183943582 6247754 32767541 19129802 21313874 144503909 59360441 12259051 19044256 50267333 25766572 133411289 32253746 102412217 46186594 55413161 39907615 52325783 86862071 185310732 138228874 22000146 149813853 98156445 77183766