CodeForces Round #549 Div.2

A. The Doors

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + ;
int N;
int Zero = , One = ;
int a[maxn], b[maxn], suma[maxn], sumb[maxn];
int num1, num2, ans;

int main() {
    scanf("%d", &N);
    for(int i = ; i < N; i ++) {
        scanf("%d", &a[i]);
        if(a[i] == ) {
            b[i] = ;
            One ++;
        }
        if(a[i] == ) {
            b[i] = ;
            Zero ++;
        }
        if(i == ) suma[i] = a[i], sumb[i] = b[i];
        else suma[i] = suma[i - ] + a[i], sumb[i] = sumb[i - ] + b[i];
    }

    for(int i = ; i < N; i ++) {
        if(suma[i] == One) {
            num1 = i;
            break;
        }
    }
    for(int i = ; i < N; i ++) {
        if(sumb[i] == Zero) {
            num2 = i;
            break;
        }
    }

    ans = min(num1, num2);
    printf("%d\n", ans + );

    return ;
}

B. Nirvana

代码：

#include <bits/stdc++.h>
using namespace std;

int N;

int Ans(int x) {
    if(x < ) return max(, x);
    return max((x % ) * Ans(x / ),  * Ans(x /  - ));
}

int main() {
    scanf("%d", &N);
    printf("%d\n", Ans(N));
    return ;
}

C. Queen

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + ;
const int inf = 0x3f3f3f3f;
int N;
int root;
int vis[maxn];
vector<int> ans;

int main() {
    scanf("%d", &N);
    for(int i = ; i <= N; i ++) {
        int st, col;
        scanf("%d%d", &st, &col);
        if(col == ) {
            if(st != -)
                vis[st] = ;
            vis[i] = ;
        }
    }

    for(int i = ; i <= N; i ++) {
        if(vis[i] != )
            ans.push_back(i);
    }

    if(ans.size() == ) printf("-1\n");
    else {
        sort(ans.begin(), ans.end());
        for(int i = ; i < ans.size(); i ++)
            printf("%d%s", ans[i], i != ans.size() -  ? " " : "\n");
    }

    return ;
}

最近是理解能力下降？？？读题读不清楚？？？菜是原罪！！！