Codeforces Round #593 (Div. 2)

Codeforces Round #593 (Div. 2)

A

# include <bits/stdc++.h>
using namespace std;
​
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        int aa=a,bb=b,cc=c;
        int ans2=0;
        int d=b/2;
        int ans1=0;
        ans1+=min(d,a)*3;
        b=b-min(a,d)*2;
        //cout<<b<<endl;
        int e=c/2;
        ans1+=min(b,e)*3;
        
        int ee=cc/2;
        ans2+=min(bb,ee)*3;
        bb=bb-min(bb,ee);
        int dd=bb/2;
        ans2+=min(aa,dd)*3;
        
        printf("%d\n",max(ans1,ans2));
    }
    
    return 0;
}
​

B

# include <bits/stdc++.h>
using namespace std;
​
typedef long long LL;
const LL mod=1e9+7;
LL quick_pow(LL a,LL b)
{
    LL ret=1;
    while(b){
        if(b&1) ret=ret*a%mod;
        a=a*a%mod;
        b=b/2;
    }
    return ret;
}
int main()
{
    LL n,m;
    scanf("%lld%lld",&n,&m);
    LL ans=quick_pow((quick_pow(2,m)-1),n);
    printf("%lld\n",ans);
    return 0;
}
​

C

# include <bits/stdc++.h>
using namespace std;
​
const int MAXN=400;
vector<int> a[MAXN];
int main()
{
    int n;
    int d=1;
    int c=1;
    scanf("%d",&n);
    for(int i=0;i<=n*n;i++){
        if((d%n==0||d%n==1)&&c){
            c=0;
        }else{
            if(d==n){
                c=-1;
            }
            if(d==1){
                c=1;
            }
        }
        //cout<<d<<endl;
        a[d].push_back(i);
        d=d+c;
    }
    for(int i=1;i<=n;i++){
        vector<int>::iterator it;
        for(it=a[i].begin();it!=a[i].end();it++){
            if(*it) cout<<*it<<" ";
        }
        cout<<endl;
    }
    return 0;
}
​

D

# include <bits/stdc++.h>
using namespace std;
​
const int MAXN=1e5+100;
int xx[MAXN],yy[MAXN];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m,&k);
    for(int i=0;i<k;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        xx[a]=1,yy[b]=1;
    }
    int idy=n/2+1;
    int idx=m/2+1;
    while(k--){
        if(xx[idx]&&yy[idy]){
            
        }else{
            break;
        }
    }
    if(k==0) printf("Yes\n");
    else printf("No\n");
    return 0;
}
​