QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#883578 | #2779. Detecting Molecules | thangthang | 9 | 1ms | 3840kb | C++14 | 1.3kb | 2025-02-05 17:04:51 | 2025-02-05 17:04:53 |
Judging History
answer
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#endif // ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
vector <int> find_subset(int l, int r, vector <int> w){
int n = w.size();
vector <pair <int, int>> a(n);
for (int i = 0; i < n; ++ i)
a[i] = {w[i], i};
sort(a.begin(), a.end());
int len = 0, sum = 0;
for (; len < n; len ++){
sum += a[len].first;
if (sum > r){
sum -= a[len].first;
break;
}
}
vector <int> res;
if (len == 0) return res;
if (sum >= l){
for (int i = 0; i < len; ++ i)
res.push_back(a[i].second);
return res;
}
for (int i = len; i < n; ++ i){
sum -= a[i - len].first;
sum += a[len].first;
if (sum >= l){
for (int j = i - len + 1; j <= i; ++ j)
res.push_back(a[j].second);
return res;
}
}
return res;
}
#ifndef ONLINE_JUDGE
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, l, r;
cin >> n >> l >> r;
vector <int> w(n);
for (int &W : w) cin >> W;
vector <int> res = find_subset(l, r, w);
for (int i : res)
cout << i << ' ';
return 0;
}
#endif // ONLINE_JUDGE
详细
Subtask #1:
score: 9
Accepted
Test #1:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
1 10 12 9
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 1, answer = NO)
Test #2:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
1 10 12 13
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 1, answer = NO)
Test #3:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
1 10 10 10
output:
14e047d7a2907b9034950b074822b302 1 0
result:
ok OK (n = 1, answer = YES)
Test #4:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
2 100 100 50 50
output:
14e047d7a2907b9034950b074822b302 2 0 1
result:
ok OK (n = 2, answer = YES)
Test #5:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
2 100 100 100 100
output:
14e047d7a2907b9034950b074822b302 1 0
result:
ok OK (n = 2, answer = YES)
Test #6:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 5 5 5 5 5
output:
14e047d7a2907b9034950b074822b302 1 0
result:
ok OK (n = 3, answer = YES)
Test #7:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
3 15 15 5 5 5
output:
14e047d7a2907b9034950b074822b302 3 0 1 2
result:
ok OK (n = 3, answer = YES)
Test #8:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
3 10 10 5 5 5
output:
14e047d7a2907b9034950b074822b302 2 0 1
result:
ok OK (n = 3, answer = YES)
Test #9:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 10 15 5 5 5
output:
14e047d7a2907b9034950b074822b302 3 0 1 2
result:
ok OK (n = 3, answer = YES)
Test #10:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
3 5 15 5 5 5
output:
14e047d7a2907b9034950b074822b302 3 0 1 2
result:
ok OK (n = 3, answer = YES)
Test #11:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 1 5 5 5 5
output:
14e047d7a2907b9034950b074822b302 1 0
result:
ok OK (n = 3, answer = YES)
Test #12:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 11 15 5 5 5
output:
14e047d7a2907b9034950b074822b302 3 0 1 2
result:
ok OK (n = 3, answer = YES)
Test #13:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 6 9 5 5 5
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 3, answer = NO)
Test #14:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 1 9 5 5 5
output:
14e047d7a2907b9034950b074822b302 1 0
result:
ok OK (n = 3, answer = YES)
Test #15:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
3 14 19 5 5 5
output:
14e047d7a2907b9034950b074822b302 3 0 1 2
result:
ok OK (n = 3, answer = YES)
Test #16:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
3 1 4 5 5 5
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 3, answer = NO)
Test #17:
score: 9
Accepted
time: 1ms
memory: 3840kb
input:
3 16 20 5 5 5
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 3, answer = NO)
Test #18:
score: 9
Accepted
time: 0ms
memory: 3584kb
input:
100 971 971 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 ...
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 100, answer = NO)
Test #19:
score: 9
Accepted
time: 0ms
memory: 3712kb
input:
100 63 63 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
output:
14e047d7a2907b9034950b074822b302 63 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
result:
ok OK (n = 100, answer = YES)
Test #20:
score: 9
Accepted
time: 0ms
memory: 3840kb
input:
100 150 150 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 100, answer = NO)
Subtask #2:
score: 0
Wrong Answer
Dependency #1:
100%
Accepted
Test #21:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
4 14 15 5 5 6 6
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 4, answer = NO)
Test #22:
score: 10
Accepted
time: 0ms
memory: 3712kb
input:
12 302 304 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 2 3 4 5 6 7
result:
ok OK (n = 12, answer = YES)
Test #23:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 302 304 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 2 3 4 5 6 7
result:
ok OK (n = 12, answer = YES)
Test #24:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 307 317 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 12, answer = NO)
Test #25:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 290 299 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 12, answer = NO)
Test #26:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 290 300 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 0 1 2 3 4 5
result:
ok OK (n = 12, answer = YES)
Test #27:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 306 310 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 6 7 8 9 10 11
result:
ok OK (n = 12, answer = YES)
Test #28:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 303 304 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 3 4 5 6 7 8
result:
ok OK (n = 12, answer = YES)
Test #29:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
12 302 303 50 50 50 50 50 50 51 51 51 51 51 51
output:
14e047d7a2907b9034950b074822b302 6 2 3 4 5 6 7
result:
ok OK (n = 12, answer = YES)
Test #30:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
6 16 18 2 2 3 3 3 3
output:
14e047d7a2907b9034950b074822b302 6 0 1 2 3 4 5
result:
ok OK (n = 6, answer = YES)
Test #31:
score: 10
Accepted
time: 0ms
memory: 3712kb
input:
12 18 19 1 1 1 1 1 1 2 2 2 2 2 2
output:
14e047d7a2907b9034950b074822b302 12 0 1 2 3 4 5 6 7 8 9 10 11
result:
ok OK (n = 12, answer = YES)
Test #32:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
100 50 51 1 1 1 2 2 1 2 2 2 2 2 2 2 2 1 1 2 1 2 2 1 1 1 2 1 1 1 1 2 2 2 2 1 2 1 2 2 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 2 2 1 2 2 1 1 2 2 2 2 1 1 2 1 1 2 1 1 1 2 1 1 2 2 1 1 2 1 2 2 1 1 1 1 1 1 2 1 1 2 1 1 2 2 2 1
output:
14e047d7a2907b9034950b074822b302 51 0 1 2 5 14 15 17 20 21 22 24 25 26 27 32 34 37 38 40 41 42 44 45 46 47 48 49 50 51 52 55 58 59 64 65 67 68 70 71 72 74 75 78 79 81 84 85 86 87 88 89
result:
ok OK (n = 100, answer = YES)
Test #33:
score: 10
Accepted
time: 0ms
memory: 3840kb
input:
100 500 501 2 2 2 2 2 2 1 1 1 1 2 2 2 2 2 2 2 2 1 1 2 2 1 2 1 1 2 2 2 1 2 1 1 2 2 1 2 2 1 2 1 2 2 2 1 1 2 1 2 1 1 1 1 1 1 2 1 1 2 2 1 2 1 1 1 1 1 1 2 1 1 2 1 1 2 1 1 1 2 2 2 2 1 2 2 1 2 1 2 2 1 2 2 2 1 1 1 1 2 1
output:
14e047d7a2907b9034950b074822b302 0
result:
ok OK (n = 100, answer = NO)
Test #34:
score: 0
Wrong Answer
time: 0ms
memory: 3840kb
input:
100 999 1000 99 100 100 99 100 100 100 100 100 99 100 100 99 100 100 99 100 99 100 99 100 100 99 99 100 99 100 99 99 100 100 100 99 100 99 100 99 100 99 100 99 99 99 100 99 99 100 99 99 99 100 100 99 100 100 100 99 100 100 99 100 99 100 99 99 100 99 99 100 100 100 100 99 100 99 99 99 99 99 100 99 10...
output:
14e047d7a2907b9034950b074822b302 0
result:
wrong answer Contestant can not find answer, jury can
Subtask #3:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%
Subtask #4:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%
Subtask #5:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%
Subtask #6:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
0%