ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#285 | #6. 「WyOJ Round 1」持 · 山海为肩 | lzx | 30 | 55ms | 3708kb | C++23 | 1.5kb | 2025-04-18 16:03:29 | 2025-04-18 18:04:37 |
answer
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define fi first
#define se second
using namespace std;
const int N=1000+10;
const int inf=0x3f3f3f3f3f3f3f3f;
int n,m;
int a[10];
int t[10];
int b[10];
double p[1010];
int c[1010][10];
double ans;
void dfs(int pos)
{
if(pos>m)
{
double res=0;
for(int i=1;i<=n;i++)
{
int cnt1=0,cnt2=0;
for(int j=1;j<=m;j++)
{
if(t[j]==c[i][j]) continue;
if((t[j]==1&&c[i][j]==3)||(t[j]==2&&c[i][j]==1)||(t[j]==3&&c[i][j]==2)) cnt1++;
else cnt2++;
}
if(cnt1>=cnt2) res+=p[i];
}
if(res>ans)
{
ans=res;
for(int i=1;i<=m;i++) a[i]=t[i];
}
return ;
}
for(int i=1;i<=3;i++)
{
t[pos]=i;
dfs(pos+1);
}
}
string s;
signed main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>p[i];
for(int j=1;j<=m;j++)
{
cin>>s;
if(s=="rock") c[i][j]=1;
if(s=="paper") c[i][j]=2;
if(s=="scissors") c[i][j]=3;
}
}
dfs(1);
cout<<fixed<<setprecision(6)<<ans<<endl;
for(int i=1;i<=m;i++)
{
if(a[i]==1) cout<<"rock";
if(a[i]==2) cout<<"paper";
if(a[i]==3) cout<<"scissors";
cout<<" ";
}
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 28ms
memory: 3692kb
input:
841 5 0.002262 paper rock rock scissors scissors 0.000665 rock paper paper scissors paper 0.001132 s...
output:
0.689135 paper paper rock rock paper
result:
ok 6 tokens
Test #2:
score: 10
Accepted
time: 0ms
memory: 3524kb
input:
320 1 0.001734 rock 0.000432 rock 0.003306 scissors 0.000322 paper 0.000380 rock 0.000817 scissors 0...
output:
0.728099 rock
result:
ok 2 tokens
Test #3:
score: 10
Accepted
time: 2ms
memory: 3632kb
input:
19 2 0.086520 scissors rock 0.028985 rock rock 0.056406 rock scissors 0.010732 scissors rock 0.04471...
output:
0.836348 scissors rock
result:
ok 3 tokens
Test #4:
score: 0
Wrong Answer
time: 7ms
memory: 3696kb
input:
100000 12 0.000008 rock rock rock scissors paper scissors paper paper paper scissors paper scissors ...
output:
0.000000 scissors rock paper
result:
wrong answer 1st words differ - expected: '0.578764', found: '0.000000'
Test #5:
score: 0
Wrong Answer
time: 3ms
memory: 3512kb
input:
82918 11 0.000009 paper rock rock scissors scissors paper rock paper rock rock paper 0.000000 scisso...
output:
0.000000
result:
wrong answer 1st words differ - expected: '0.582727', found: '0.000000'
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 3708kb
input:
63157 10 0.000004 rock scissors paper scissors paper scissors rock paper rock scissors 0.000007 rock...
output:
0.000000 paper
result:
wrong answer 1st words differ - expected: '0.587712', found: '0.000000'
Test #7:
score: 0
Wrong Answer
time: 7ms
memory: 3632kb
input:
100000 12 0.000003 rock rock rock paper paper rock paper paper paper rock rock scissors 0.000001 pap...
output:
0.000000 scissors rock scissors
result:
wrong answer 1st words differ - expected: '0.578665', found: '0.000000'
Test #8:
score: 0
Wrong Answer
time: 2ms
memory: 3512kb
input:
72055 11 0.000006 rock scissors scissors rock scissors scissors scissors scissors rock scissors scis...
output:
0.000000 rock scissors rock
result:
wrong answer 1st words differ - expected: '0.584229', found: '0.000000'
Test #9:
score: 0
Wrong Answer
time: 3ms
memory: 3672kb
input:
49463 12 0.000024 rock paper scissors paper rock scissors rock paper paper paper paper paper 0.00000...
output:
0.000000 rock
result:
wrong answer 1st words differ - expected: '0.584658', found: '0.000000'
Test #10:
score: 0
Wrong Answer
time: 3ms
memory: 3680kb
input:
100000 12 0.000007 rock paper scissors paper paper scissors rock rock scissors rock scissors paper 0...
output:
0.000000 scissors paper
result:
wrong answer 1st words differ - expected: '0.578092', found: '0.000000'