QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#667410#7159. CandyWarinchai_s#0 3ms3780kbC++14737b2024-10-22 22:48:572024-10-22 22:49:07

Judging History

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

  • [2024-10-22 22:49:07]
  • 评测
  • 测评结果:0
  • 用时:3ms
  • 内存:3780kb
  • [2024-10-22 22:48:57]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
int ar[105];
int dp[105][105];
vector<pair<int,int>>v;
map<int,int>mp[105];
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,f,t;cin>>n>>f>>t;
    for(int i=0;i<n;i++){
        cin>>ar[i];
    }
    int ans=LLONG_MAX;
    for(int i=0;i<(1<<20);i++){
        int x=__builtin_popcount(i);
        if(x!=f)continue;
        vector<int>v;
        int sum=0;
        for(int j=0;j<20;j++){
            if((i>>j)&1)v.push_back(j),sum+=ar[j];
        }
        if(sum<t)continue;
        int tans=0;
        for(int j=0;j<f;j++){
            tans+=v[j]-j;
        }
        ans=min(ans,tans);
    }
    cout<<ans;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 6
Accepted
time: 3ms
memory: 3524kb

input:

1 1 7
7

output:

0

result:

ok single line: '0'

Test #2:

score: 0
Wrong Answer
time: 3ms
memory: 3776kb

input:

1 1 8
7

output:

9223372036854775807

result:

wrong answer 1st lines differ - expected: 'NO', found: '9223372036854775807'

Subtask #2:

score: 0
Wrong Answer

Test #9:

score: 0
Wrong Answer
time: 3ms
memory: 3780kb

input:

100 50 50
1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 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:

9223372036854775807

result:

wrong answer 1st lines differ - expected: '1805', found: '9223372036854775807'

Subtask #3:

score: 0
Skipped

Dependency #1:

0%

Subtask #4:

score: 0
Skipped

Dependency #1:

0%

Subtask #5:

score: 0
Skipped

Dependency #1:

0%