跳转至

CF VP 950 (Div.3)

A

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <bits/stdc++.h>
#define int long long
using namespace std;
int t,n,m,a[10];
string s;
signed main(void){
    scanf("%lld",&t);
    while(t--){
        memset(a,0,sizeof(a));
        scanf("%lld%lld",&n,&m);
        cin>>s;
        for(int i=0;i<s.size();i++){
            a[s[i]-'A']++;
        }
        int ans=0;
        for(int i=0;i<7;i++){
            if(a[i]-m<0){
                ans-=(a[i]-m);
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}

B

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <bits/stdc++.h>
using namespace std;
int t,n,f,k,a[109];
bool cmp(int a,int b){
    return a>b;
}
int main(void){
    scanf("%d",&t);
    while(t--){
        int fcnt=0;
        scanf("%d%d%d",&n,&f,&k);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]==f){
                fcnt++;
            }
        }
        int nrf=a[f];
        sort(a+1,a+n+1,cmp);
        if((a[k]==nrf)&&k+1<=n&&a[k+1]==nrf){
            puts("MAYBE");
        }else{
            bool flag=true;
            for(int i=1;i<=k;i++){
                if(a[i]==nrf){
                    flag=false;
                }
            }
            if(flag){
                puts("NO");
            }else{
                puts("YES");
            }
        }
    }
    return 0;
}

C

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
#define int long long
using namespace std;
map<int,int> dd;
int t,n,m,a[200009],b[200009],d[200009],different[200009];
void solve(){
    dd.clear();
    scanf("%lld",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    for(int i=1;i<=n;i++){
        scanf("%lld",&b[i]);
    }
    scanf("%lld",&m);
    for(int i=1;i<=m;i++){
        scanf("%lld",&d[i]);
        dd[d[i]]++;
    }
    int flag=true;
    memset(different,false,sizeof(different));
    for(int i=1;i<=n;i++){
        if(b[i]==d[m]){
            flag=false;
        }
        if(a[i]!=b[i]){
            different[i]=true;
        }
    }
    if(flag){
        puts("NO");
        return;
    }
    for(int i=1;i<=n;i++){
        if(different[i]){
            if(dd.count(b[i])==0||dd[b[i]]==0){
                puts("NO");
                return;
            }else{
                dd[b[i]]--;
            }
        }
    }
    puts("YES");
    return;
}
signed main(void){
    scanf("%lld",&t);
    while(t--){
        solve();
    }
    return 0;
}