QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#539180#8936. Team Arrangementucup-team4717#WA 547ms4016kbC++142.3kb2024-08-31 14:12:482024-08-31 14:12:50

Judging History

This is the latest submission verdict.

  • [2024-08-31 14:12:50]
  • Judged
  • Verdict: WA
  • Time: 547ms
  • Memory: 4016kb
Show
  • [2024-08-31 14:12:48]
  • Submitted

answer

#include<bits/stdc++.h>
#define int long long
#define N 65
using namespace std;
int n;
int l[N],r[N];
int w[N];
int a[N][N];
int sum[N];
int b[N];
int ans=-1e18;
int vis[N];
pair<int,int> c[N];
vector<int> g[N];
void dfs(int x){
    if(x>n){
        int res=0;
        for(int i=1;i<=n;i++){
            if(b[i]%i!=0) return;
            res+=b[i]/i*w[i];
        }
        ans=max(ans,res);
            if((double)clock()/CLOCKS_PER_SEC>=0.97){
            if(ans==-1e18) printf("impossible");
            else printf("%lld",ans);
            exit(0);
        }
        return;
    }
    if((double)clock()/CLOCKS_PER_SEC>=0.97){
        if(ans==-1e18) printf("impossible");
        else printf("%lld",ans);
        exit(0);
    }
    if(vis[x]){dfs(x+1);return;}
    int ss=0,sss=0;
    for(int i=l[x];i<=r[x];i++){
        if(!a[x][i]) continue;
        int p=i-b[i]%i;
        if(sum[i]==p&&p!=i) ss++,sss=i;
    }
    if(ss>1) return;
    for(int j=1;j<=n;j++) if(a[x][j]) sum[j]--;
    if(ss==1){
        b[sss]++;
        dfs(x+1);
        b[sss]--;
        for(int j=l[x];j<=r[x];j++) if(a[x][j]) sum[j]++;
        return;
    }
    for(int i=l[x];i<=r[x];i++){
        if(!a[x][i]) continue;
        int p=i-b[i]%i;
        if(sum[i]+1<p) continue;
        b[i]++;
        dfs(x+1);
        b[i]--;
    }
    for(int j=l[x];j<=r[x];j++) if(a[x][j]) sum[j]++;
}
signed main(){
    scanf("%lld",&n);
    for(int i=1;i<=n;i++) scanf("%lld %lld",&l[i],&r[i]);
    for(int i=1;i<=n;i++) scanf("%lld",&w[i]);
    for(int i=1;i<=n;i++) c[i]={-w[i],i};
    sort(c+1,c+n+1);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            int id=c[j].second;
            if(l[i]<=id&&id<=r[i]) g[i].push_back(id);
        }
        for(int j=l[i];j<=r[i];j++) a[i][j]=1,sum[j]++;
    }
    for(int i=1;i<=n;i++){
        if(sum[i]<i){
            for(int j=1;j<=n;j++) a[j][i]=0;
            sum[i]=0;
        }
    }
    for(int i=1;i<=n;i++){
        int x=0,y=0;
        for(int j=1;j<=n;j++) if(a[i][j]) x=j,y++;
        if(!y){printf("impossible");return 0;}
        if(y==1){
            b[x]++;
            vis[i]=1;
            sum[x]--;
        }
    }
    dfs(1);
    if(ans==-1e18) printf("impossible");
    else printf("%lld",ans);
	return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3852kb

input:

3
2 3
1 2
2 2
4 5 100

output:

9

result:

ok single line: '9'

Test #2:

score: 0
Accepted
time: 0ms
memory: 4016kb

input:

3
1 3
3 3
2 3
1 1 100

output:

100

result:

ok single line: '100'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3816kb

input:

2
1 1
2 2
1 1

output:

impossible

result:

ok single line: 'impossible'

Test #4:

score: 0
Accepted
time: 0ms
memory: 4016kb

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: 4012kb

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:

6

result:

ok single line: '6'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3836kb

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: 0
Accepted
time: 0ms
memory: 3960kb

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:

-2673021

result:

ok single line: '-2673021'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3932kb

input:

14
2 3
4 4
1 7
3 6
3 4
1 1
1 4
4 7
3 7
1 7
2 3
6 6
1 1
3 6
2923142 1686477 640352 2848353 9202543 -4441381 4866381 -3610520 8124124 -1372894 1111310 -7538627 466143 9937961

output:

5939733

result:

ok single line: '5939733'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3772kb

input:

14
1 7
1 2
8 8
1 1
7 8
6 9
7 8
1 4
6 9
3 3
1 1
3 7
5 8
4 8
-7139089 6365816 -9893288 5936146 -2803918 -4961415 1495365 -2564851 -2630365 -8608883 5813455 -4005459 -8844054 6703783

output:

impossible

result:

ok single line: 'impossible'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3824kb

input:

14
6 13
3 7
2 13
6 8
4 5
12 13
3 10
4 11
2 14
3 4
5 13
10 14
10 14
3 12
-8599727 -1496394 855072 -7439122 -5170228 8009298 -250221 5841035 2949765 7166358 -3516548 -6851737 8173765 -917122

output:

impossible

result:

ok single line: 'impossible'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3876kb

input:

60
21 34
13 34
48 49
31 42
5 6
16 30
1 25
35 37
3 14
3 32
25 54
2 41
24 44
27 52
26 55
8 35
31 47
41 42
4 35
53 59
13 19
11 51
36 48
5 59
40 44
28 50
5 51
37 53
50 60
14 50
22 58
20 50
20 21
5 20
19 55
5 45
19 35
7 29
5 53
25 33
19 51
37 41
13 29
12 24
13 40
10 22
1 5
22 32
14 42
11 41
16 60
35 43
3...

output:

impossible

result:

ok single line: 'impossible'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3796kb

input:

60
4 11
1 7
8 24
2 18
11 26
6 18
5 26
5 11
6 21
17 30
9 22
1 29
7 14
9 18
23 26
3 28
3 14
4 16
7 18
2 3
8 8
10 20
8 29
5 28
5 7
16 19
16 18
8 11
5 28
12 21
8 20
8 27
9 23
15 28
1 4
6 27
10 15
10 20
2 7
4 21
9 23
23 25
20 23
19 29
16 25
12 15
3 27
3 9
1 26
9 11
12 14
14 24
16 22
7 7
9 26
24 29
3 27
1...

output:

impossible

result:

ok single line: 'impossible'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

60
2 4
15 18
1 17
3 10
11 19
3 14
14 14
9 10
9 15
1 17
10 17
3 9
4 10
6 10
7 14
3 20
20 20
5 14
1 9
3 17
10 14
3 13
8 15
9 13
5 9
2 16
4 9
9 19
13 18
4 20
8 19
13 18
9 11
11 14
8 17
7 11
1 11
5 7
10 12
3 8
8 18
9 20
11 19
1 16
1 17
3 20
3 3
2 10
7 7
4 18
8 16
5 7
16 20
1 5
10 15
9 11
2 6
11 19
6 16
...

output:

impossible

result:

ok single line: 'impossible'

Test #14:

score: -100
Wrong Answer
time: 547ms
memory: 3968kb

input:

60
1 3
1 3
3 5
2 6
5 5
2 5
5 6
1 5
3 6
6 6
2 6
2 2
2 3
1 6
2 4
2 3
1 3
4 5
2 4
5 5
3 5
3 5
1 5
2 6
3 6
1 6
1 4
3 3
2 2
1 6
2 3
2 6
4 6
5 5
1 6
2 3
1 2
4 4
2 5
1 4
4 4
4 6
2 6
2 3
2 4
1 2
1 4
3 6
2 5
2 6
1 1
1 5
5 6
3 6
1 2
3 5
5 6
5 6
1 6
3 4
-9765941 -9284625 -9136963 -1872925 -9334679 -67293 96416...

output:

-243813531

result:

wrong answer 1st lines differ - expected: '-87758107', found: '-243813531'
English 繁體中文 简体中文

Server Time: 2025-02-06 11:45:53 | OpenSource Project