QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #636116 | #6143. 滚榜 | propane | 60 | 176ms | 3776kb | C++20 | 1.2kb | 2024-10-12 22:20:27 | 2024-10-12 22:20:27 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<vector>
#include<set>
#include<numeric>
#include<algorithm>
using namespace std;
using LL = long long;
int main(){
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("data.out", "w", stdout);
#endif
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
vector<int> id(n);
iota(id.begin(), id.end(), 0);
int ans = 0;
do{
int lastb = 0, sum = 0;
bool ok = true;
pair<int, int> mx{0, 0};
for(int i = 0; i < n; i++){
mx = max(mx, make_pair(a[i], -i));
}
for(auto x : id){
int need = max(lastb, mx.first - a[x]);
if (make_pair(a[x] + need, -x) < mx){
need += 1;
}
sum += need;
if (sum > m){
ok = false;
break;
}
lastb = need;
mx = make_pair(a[x] + need, -x);
}
ans += ok;
}while(next_permutation(id.begin(), id.end()));
cout << ans << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Final Tests
Test #1:
score: 5
Accepted
time: 0ms
memory: 3600kb
input:
2 8 8950 8954
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 5
Accepted
time: 0ms
memory: 3580kb
input:
2 10 8841 8843
output:
2
result:
ok 1 number(s): "2"
Test #3:
score: 5
Accepted
time: 0ms
memory: 3556kb
input:
3 9 8765 8761 8765
output:
2
result:
ok 1 number(s): "2"
Test #4:
score: 5
Accepted
time: 0ms
memory: 3772kb
input:
3 8 8385 8385 8387
output:
6
result:
ok 1 number(s): "6"
Test #5:
score: 5
Accepted
time: 0ms
memory: 3604kb
input:
3 9 8581 8585 8582
output:
2
result:
ok 1 number(s): "2"
Test #6:
score: 5
Accepted
time: 2ms
memory: 3552kb
input:
8 100 8856 8864 8858 8860 8856 8863 8859 8857
output:
17589
result:
ok 1 number(s): "17589"
Test #7:
score: 5
Accepted
time: 0ms
memory: 3548kb
input:
8 100 8238 8239 8245 8244 8245 8244 8238 8244
output:
32475
result:
ok 1 number(s): "32475"
Test #8:
score: 5
Accepted
time: 2ms
memory: 3552kb
input:
8 100 9804 9806 9807 9802 9801 9803 9801 9806
output:
37012
result:
ok 1 number(s): "37012"
Test #9:
score: 5
Accepted
time: 159ms
memory: 3612kb
input:
10 200 8002 8014 8011 8013 8002 8003 8002 8016 8009 8004
output:
606309
result:
ok 1 number(s): "606309"
Test #10:
score: 5
Accepted
time: 176ms
memory: 3616kb
input:
10 200 8324 8323 8328 8322 8325 8328 8328 8323 8334 8323
output:
2504995
result:
ok 1 number(s): "2504995"
Test #11:
score: 5
Accepted
time: 151ms
memory: 3776kb
input:
10 200 9416 9415 9417 9404 9408 9409 9410 9416 9415 9411
output:
2553164
result:
ok 1 number(s): "2553164"
Test #12:
score: 5
Accepted
time: 149ms
memory: 3580kb
input:
10 200 9422 9430 9425 9425 9425 9423 9431 9428 9432 9434
output:
2687280
result:
ok 1 number(s): "2687280"
Test #13:
score: 0
Time Limit Exceeded
input:
12 300 9281 9292 9279 9280 9289 9291 9285 9279 9280 9281 9290 9281
output:
result:
Test #14:
score: 0
Time Limit Exceeded
input:
12 300 9737 9726 9731 9736 9723 9727 9722 9732 9736 9733 9737 9728
output:
result:
Test #15:
score: 0
Time Limit Exceeded
input:
12 300 8707 8708 8712 8704 8705 8704 8716 8711 8713 8712 8702 8710
output:
result:
Test #16:
score: 0
Time Limit Exceeded
input:
12 300 9200 9194 9191 9195 9197 9192 9206 9206 9197 9198 9192 9202
output:
result:
Test #17:
score: 0
Time Limit Exceeded
input:
13 500 8217 8233 8238 8217 8237 8237 8217 8217 8230 8234 8225 8223 8220
output:
result:
Test #18:
score: 0
Time Limit Exceeded
input:
13 500 9781 9780 9772 9779 9785 9788 9788 9777 9791 9784 9782 9777 9768
output:
result:
Test #19:
score: 0
Time Limit Exceeded
input:
13 500 8096 8078 8103 8104 8085 8089 8081 8085 8102 8095 8097 8100 8090
output:
result:
Test #20:
score: 0
Time Limit Exceeded
input:
13 500 8739 8728 8743 8727 8730 8735 8733 8738 8731 8743 8728 8722 8722