atcoder abc 128 A-D

1. Apple-pie

#include <iostream>
using namespace std;
int A,P;
int main (){
  cin>>A>>P;
  cout<<(3*A+P)/2<<endl;
  return 0;}

2. Guidebook

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using Graph = vector<vector<int>>;
const int INF = (1 << 29);
const long long LINF = 1LL << 60;
 
 
 
int main() {
    int n;
    cin >> n;
    vector<tuple<string,int,int>> es;
    for(int i = 0; i < n; i++) {
        string s;
        int p;
        cin >> s;
        cin >> p;
        p *= -1;
        es.emplace_back(s,p,i);
    }
    sort(es.begin(), es.end());
    for(int i = 0; i < n; i++) {
        string s;
        int p, j;
        tie(s,p,j) = es[i];
        cout << j+1 << endl;
    }
}

3. Switches

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=55;
const int M=4005;
 
int n,m,ans;
vector<int>sw[N];
int p[N],temp[N];
bool vis[N];
 
void dfs(int x)
{
    if(x==n+1)
    {
        memset(temp,0,sizeof(temp));
        for(int i=1;i<=n;i++)
        {
            if(!vis[i]) continue;
            for(int j=0;j<sw[i].size();j++)
            {
                int b=sw[i][j];
                temp[b]++;
            }
        }
        for(int i=1;i<=m;i++) if(temp[i]%2!=p[i]) return ;
        ans++;
        return ;
    }
    dfs(x+1);
    vis[x]=true;
    dfs(x+1);
    vis[x]=false;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int k;
        scanf("%d",&k);
        for(int j=0;j<k;j++)
        {
            int t;
            scanf("%d",&t);
            sw[t].push_back(i);
        }
    }
    for(int i=1;i<=m;i++) scanf("%d",&p[i]);
    dfs(1);
    printf("%d\n",ans);
    return 0;
}
 

4. equeue

#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
typedef long long LL;
const int N=52;
int v[N];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>v[i];
    LL res=0;
    for(int i=0;i<=n;i++){
        for(int j=0;i+j<=n;j++){
            if(i+j>m) continue;
            int k=m-i-j;
            LL ans=0;
            priority_queue<int,vector<int>,greater<int>>heap;
            for(int p=1;p<=i;p++){
                heap.push({v[p]});
                ans+=v[p];
            }
            for(int p=n;p>=n-j+1;p--){
                heap.push({v[p]});
                ans+=v[p];
            }
            while(heap.size()&&heap.top()<0&&k>0){
                k--;
                ans-=heap.top();
                heap.pop();
            }
            res=max(res,ans);
        }
    }
    cout<<res<<endl;
    return 0;
}