QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#623515 | #8790. First Billion | rns_ksr# | WA | 170ms | 3804kb | C++14 | 1.1kb | 2024-10-09 12:36:47 | 2024-10-09 12:36:47 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define N 150
int A[N], Id[N], vis[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> A[i];
iota(Id, Id + n + 1, 0);
sort(Id, Id + n, [&](int a, int b) {
return (A[a] < A[b]);
});
fill(vis, vis + n + 5, 0);
int s = 0, m = min(n, 23);
for (int i = n - 1; i >= m; i--) {
int u = Id[i];
if (s > 0) {
vis[u] = 1;
s -= A[u];
}
else {
vis[u] = 0;
s += A[u];
}
}
int up = 1 << m;
for (int i = 0; i < up; i++) {
int ss = s;
for (int j = 0; j < m; j++) {
int u = Id[j];
int t = ((i >> j) & 1);
vis[u] = t;
if (t) ss -= A[u];
else ss += A[u];
}
if (!ss) {
break;
}
}
vector<int> ans;
for (int i = 0; i < n; i++) if (!vis[i]) {
s += A[i];
ans.push_back(i + 1);
}
cout << ans.size() << ' ';
for (auto e : ans) cout << e << ' ';
cout << endl;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
input:
10 386413329 88494216 245947398 316438989 192751270 204627269 65749456 3938400 150458676 345180997
output:
5 1 5 6 7 9
result:
ok OK (n = 10)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
10 119486233 299942886 169540407 349937991 597883752 32230162 140514533 57341098 12602102 220520836
output:
5 2 5 6 8 9
result:
ok OK (n = 10)
Test #3:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
14 384615281 84612238 83310504 54746763 142296081 56775470 128760350 343006424 177232390 214368720 67220468 21895072 16352717 224807522
output:
7 1 6 7 9 10 12 13
result:
ok OK (n = 14)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
14 270208635 14270307 89661499 113578022 47687195 101043954 38775146 208193324 650676076 351701957 3427619 59535626 24230888 27009752
output:
7 5 7 8 9 11 13 14
result:
ok OK (n = 14)
Test #5:
score: 0
Accepted
time: 8ms
memory: 3544kb
input:
20 61638928 106712373 5946815 178135484 4937573 111395400 15504655 67139983 101814514 312223647 130341028 43244171 37671364 54108486 337181317 37924824 153793862 70383750 102917244 66984582
output:
10 1 2 3 6 7 15 16 17 19 20
result:
ok OK (n = 20)
Test #6:
score: 0
Accepted
time: 9ms
memory: 3584kb
input:
20 67858098 61231428 99398662 1883806 82465954 303619377 87516412 154956240 94872199 76508350 13276828 136541811 203282099 99160366 127539385 13364660 141176136 39751629 67888657 127707903
output:
10 2 6 7 9 10 15 16 18 19 20
result:
ok OK (n = 20)
Test #7:
score: 0
Accepted
time: 151ms
memory: 3804kb
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 1 2 6 7 8 9 11 12 14 16 21 24
result:
ok OK (n = 24)
Test #8:
score: 0
Accepted
time: 103ms
memory: 3600kb
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 2 4 6 8 9 13 14 15 16 18 22 24
result:
ok OK (n = 24)
Test #9:
score: 0
Accepted
time: 149ms
memory: 3548kb
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
output:
14 3 7 9 10 13 14 19 20 21 22 23 24 25 27
result:
ok OK (n = 28)
Test #10:
score: -100
Wrong Answer
time: 170ms
memory: 3544kb
input:
28 213829745 40823140 14876795 22548901 35958464 159026037 106482651 52655603 76733934 102794554 100713772 80174862 125840182 3619651 74158077 27699586 14743901 68385227 55117143 39623241 67325444 95072408 46052588 46086093 11650160 66077724 149558313 102371804
output:
2 1 13
result:
wrong answer need sum 1000000000, got sum 339669927