QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#789512#8936. Team Arrangement_fcy_#TL 866ms3828kbC++141.8kb2024-11-27 20:38:012024-11-27 20:38:01

Judging History

This is the latest submission verdict.

  • [2024-11-27 20:38:01]
  • Judged
  • Verdict: TL
  • Time: 866ms
  • Memory: 3828kb
Show
  • [2024-11-27 20:38:01]
  • Submitted

answer

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
const int maxn=100+10;
vector <int> ver;
int inf=1e9+7;
int n,ans=-inf;
int vis[maxn],l[maxn],r[maxn],w[maxn];
void dfs(int x,int y){
    if(x==0){
        int val=0;
        for(auto u:ver){
            val+=w[u];
        }
        if(val<ans) return;
        vector <pii> t;
        for(int i=1;i<=n;i++){
            t.push_back({l[i],r[i]});
        }
        vector <int> ver2=ver;
        sort(ver.begin(),ver.end());
        sort(t.begin(),t.end(),[&](pii x,pii y){
            if(x.se==y.se) return x.fi>y.fi;
            else return x.se<y.se;
        });
        vector <int> vis(n,0);
        int flag=1;
        for(auto u:ver){
            int cnt=0;
            for(int i=0;i<n;i++){
                if(t[i].fi<=u&&u<=t[i].se&&vis[i]==0){
                    vis[i]=1; cnt++;
                    if(cnt==u) break;
                } 
            }
            if(cnt!=u){
                flag=0;
                break;
            }
        }
        ver=ver2;
        // for(auto u:ver){
        //     cout<<u<<" ";
        // }
        // cout<<endl;
        // cout<<val<<endl;
        // cout<<"------\n";
        if(flag==1){
            ans=max(ans,val);
        }
        return;
    }
    for(int i=1;i<=min(x,y);i++){
        ver.push_back(i);
        dfs(x-i,i);
        ver.pop_back();
    }
}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>l[i]>>r[i];
        for(int j=l[i];j<=r[i];j++){
            vis[j]++;
        }
    }
    for(int i=1;i<=n;i++){
        cin>>w[i];
    }
    dfs(n,100);
    if(ans==-inf) cout<<"impossible\n";
    else cout<<ans<<"\n";
    return 0;
}
源文件, 语言: C++14

详细

Test #1:

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

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

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

input:

2
1 1
2 2
1 1

output:

impossible

result:

ok single line: 'impossible'

Test #4:

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

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

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

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

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

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

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

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: 803ms
memory: 3548kb

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: 866ms
memory: 3604kb

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: -100
Time Limit Exceeded

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:
English 繁體中文 简体中文

服务器时间: 2025-02-05 15:46:28 | 开源项目