QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #463106 | #8008. Fortune Wheel | PhantomThreshold# | WA | 38ms | 6172kb | C++17 | 951b | 2024-07-04 13:51:19 | 2024-07-04 13:51:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e9;
ll n,x,m;
ll a[505];
ll dis[100050];
int main(){
ios_base::sync_with_stdio(false);
cin >> n >> x >> m;
for (int i=1;i<=m;i++) cin >> a[i];
for (int i=1;i<n;i++) dis[i]=INF;
queue<int> q;
q.push(0);
dis[0]=0;
while (!q.empty()){
int u=q.front();
q.pop();
for (int i=1;i<=m;i++){
int v=(u+n-a[i])%n;
if (dis[v]>dis[u]+1){
dis[v]=dis[u]+1;
q.push(v);
}
}
}
vector<pair<ll,ll>> v;
for (int i=0;i<n;i++) v.emplace_back(dis[i],i);
sort(v.begin(),v.end());
ll sum=0;
ll lp=n,lq=1;
for (int i=1;i<n;i++){
if (v[i].first*i>(sum+n)){
lp=sum+n;
lq=i;
break;
}
sum=sum+v[i].first;
}
for (auto [d,u]:v) if (u==x){
if (d*lq>lp){
cout << lp << " " << lq << "\n";
return 0;
}
else{
cout << d << " " << 1 << "\n";
return 0;
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
input:
6 3 2 2 4
output:
8 3
result:
ok 2 number(s): "8 3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
5 4 1 1
output:
1 1
result:
ok 2 number(s): "1 1"
Test #3:
score: 0
Accepted
time: 38ms
memory: 6172kb
input:
99999 65238 100 64714 45675 36156 13116 93455 22785 10977 60219 14981 25839 83709 80404 41400 12469 31530 65521 35436 20326 96792 50699 27522 98233 26187 12509 90992 72693 83919 74145 80892 68422 38333 33497 89154 88403 77492 4570 3908 59194 3482 89871 96330 45114 5555 73987 95832 476 949 74649 2084...
output:
3 1
result:
ok 2 number(s): "3 1"
Test #4:
score: 0
Accepted
time: 2ms
memory: 3748kb
input:
10000 23 7 9594 8998 9330 6851 1662 6719 583
output:
42726 4805
result:
ok 2 number(s): "42726 4805"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
100 3 100 7 68 28 98 19 32 90 79 92 40 96 30 95 91 71 15 33 18 69 1 61 43 5 75 73 64 58 100 88 20 99 37 17 22 82 67 70 55 47 80 66 12 4 24 26 54 74 57 21 77 86 89 83 29 46 31 2 16 49 48 25 93 52 9 85 84 42 39 8 65 10 45 63 87 78 60 23 14 34 59 81 38 41 76 3 13 27 36 35 51 44 62 53 94 6 50 11 97 72 56
output:
1 1
result:
ok 2 number(s): "1 1"
Test #6:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
100 93 4 63 58 3 89
output:
285 60
result:
wrong answer 1st numbers differ - expected: '19', found: '285'