Diary_2.27

Codeforces

1. Swap Columns and Find a Path

#define int long long
void solve(){
    int n;  cin >> n;
    int a[2][n+2], cnt = 0;
    a[0][0] = a[1][0] = a[0][n+1] = a[1][n+1] = 0;
    for(int i=0; i<2; i++){
        for(int k=1; k<=n; k++){
            cin >> a[i][k];
        }
    }
    for(int i=1; i<=n; i++){
        cnt += max(a[0][i], a[1][i]);
    }
    int ans = -1e18;
    for(int i=1; i<=n; i++){
        ans = max(ans, cnt+min(a[0][i], a[1][i]));
    }
    cout << ans << endl;
}

2. Game with Colored Marbles

void solve(){
    map<int, int> q;
    int n;  cin >> n;
    int a[n];
    for(int i=0; i<n; i++){
        cin >> a[i];
        q[a[i]]++;
    }
    int cnt = 0;
    for(auto &x: q){
        if(x.second == 1){
            cnt++;
        }
    }
    int len = q.size();
    int ans = (cnt+1)/2*2+(len-cnt);
    cout << ans << endl;
}

PS. 没学到啥新东西的题没贴，都是水题没啥能贴的