QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#540730	#8936. Team Arrangement	ucup-team3282^#	WA	0ms	3688kb	C++20	1.3kb	2024-08-31 17:45:50	2024-08-31 17:45:51

Judging History

This is the latest submission verdict.

[2024-08-31 17:45:51]
Judged

Verdict: WA
Time: 0ms
Memory: 3688kb

Show

[2024-08-31 17:45:50]
Submitted

answer

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
pair<int,int>mp[65];
long long ans=-1e18;
long long w[65];
int stk[61];
int n;
long long check(){
    // for(int i=1;i<=n;i++){
    //     for(int j=1;j<=stk[i];j++){
    //         cout<<i<<",";
    //     }
    // }
    // cout<<endl;
    int nw=1;
    long long cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=stk[i];j++){
            int cp=i;
            while(cp){
                // cout<<"<"<<nw<<">";
                if(mp[nw].first<=i&&mp[nw].second>=i){
                    cp--;nw++;
                }else{
                    // cout<<i<<":"<<"NO\n";
                    return -1e18;
                }
            }
        }
        cnt+=w[i]*stk[i];
    }
    // cout<<"YES\n";
    return cnt;
}
void dfs(int step,int cnt){
    if(cnt>n)return;
    if(step==n+1){
        stk[1]=n-cnt;
        ans=max(ans,check());
        return;
    }
    for(int i=0;i<=n;i++){
        stk[step]=i;
        dfs(step+1,cnt+i*step);
    }
    return;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>mp[i].first>>mp[i].second;
    }
    sort(mp+1,mp+n+1);
    for(int i=1;i<=n;i++)cin>>w[i];
    dfs(2,0);
    if(ans<-1e17)cout<<"impossible\n";
    else cout<<ans<<endl;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3612kb

input:

output:

result:

ok single line: '9'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3688kb

input:

output:

result:

ok single line: '100'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

output:

impossible

result:

ok single line: 'impossible'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

3
2 3
1 2
2 2
-100 -200 100000

output:

-300

result:

ok single line: '-300'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3632kb

input:

9
1 4
2 5
3 4
1 5
1 1
2 5
3 5
1 3
1 1
1 1 1 1 1 1 1 1 1

output:

result:

ok single line: '6'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3604kb

input:

14
3 3
1 2
2 3
2 3
2 3
1 1
2 3
1 3
3 3
1 3
1 3
1 2
2 3
1 3
-9807452 -9610069 4156341 2862447 6969109 -7245265 -2653530 -5655094 6467527 -6872459 3971784 7312155 9766298 -2719573

output:

-16558567

result:

ok single line: '-16558567'

Test #7:

score: -100

Wrong Answer

time: 0ms

memory: 3684kb

input:

14
1 2
1 4
2 3
3 5
4 5
2 5
2 4
2 4
1 2
3 4
1 5
2 4
1 1
4 5
-13763 -7354207 1096407 -9063321 -4824546 -6275546 1258145 -5272834 -8631107 3581157 2320771 -7714508 8446625 -6816167

output:

-6925559

result:

wrong answer 1st lines differ - expected: '-2673021', found: '-6925559'