QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#647503	#5137. Tower	xianyu	WA	27ms	5600kb	C++14	1.4kb	2024-10-17 14:30:15	2024-10-17 14:30:26

Judging History

你现在查看的是最新测评结果

[2024-10-17 14:30:26]
评测

测评结果：WA
用时：27ms
内存：5600kb

查看

[2024-10-17 14:30:15]
提交

answer

#include<bits/stdc++.h>
#define ls p*2
#define rs p*2+1
#define x first
#define y second
#define endl '\n'
using namespace std;

mt19937 rnd(time(0));
typedef long long LL;
typedef unsigned long long  uLL;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
const double PI=acos(-1);
const int N=5e2+10,M=500,MOD=998244353,NN=1e6+10;
LL a[N];
int n;
int m;
LL dp[N][N];
int T;
void init(){
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            dp[i][j]=1e14;
        }
    }
    for(int i=1;i<=n;i++){
        for(int k=0;k<=31;k++){
            for(int j=1;j<=n;j++){
                int cur=a[i];
                cur=cur>>k;
                dp[i][j]=min(dp[i][j],(LL)k+abs(cur-a[j]));
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>T;
    while(T--){

        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        init();
        LL ans=1e18;
        for(int i=1;i<=n;i++){
            vector<LL>v;
            for(int j=1;j<=n;j++){
                v.push_back(dp[j][i]);
            }
            sort(v.begin(),v.end());
            LL cur=0;
            for(int j=1;j<=n-m;j++){
                cur+=v[j-1];
            }
            ans=min(ans,cur);
        }
        cout<<ans<<endl;

    }



}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3652kb

input:

output:

2
4
1

result:

ok 3 number(s): "2 4 1"

Test #2:

score: 0

Accepted

time: 26ms

memory: 5296kb

input:

10
272 118
11 14 49 94 71 62 46 45 74 22 15 36 7 37 27 35 96 85 75 78 76 64 23 59 17 35 71 28 96 82 5 66 2 48 57 31 88 10 61 73 79 23 19 52 39 76 48 98 5 39 48 51 90 90 60 27 47 24 24 56 48 27 39 21 38 18 20 9 62 83 47 15 51 22 73 74 7 80 64 60 86 74 59 7 84 38 99 31 42 60 52 41 63 88 59 90 77 40 68...

output:

result:

ok 10 numbers

Test #3:

score: -100

Wrong Answer

time: 27ms

memory: 5600kb

input:

10
133 89
20 70 6 45 4 72 38 7 18 1 82 39 69 85 5 36 1 62 30 47 68 55 7 41 7 42 7 61 11 82 2 80 80 93 29 30 42 58 73 26 99 67 60 94 61 46 47 54 44 50 35 88 61 17 23 97 90 28 16 47 75 35 28 14 42 63 26 40 95 58 26 25 26 83 93 56 17 27 7 90 91 28 53 49 47 84 55 52 11 34 14 74 40 65 84 32 99 46 1 21 31...

output:

result:

wrong answer 9th numbers differ - expected: '96', found: '97'