Atcoder Beginner Contest 264 A - D题解

目录

A

B

C

D

---

A

传送门

没什么好说的，for循环

记得从前写过一个叫substr的东东，写在编译器里了，所以临场手速狗调用了一发（dogo）

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
string s;
string substr(int a,int b,string c){
    string t;
    for(int i = a ; i <= b ; i ++) t += c[i];
    return t;
}
signed main(){
    int n,m,k;
    cin >> n >> m;
    s = "atcoder";
    cout << substr(n - 1,m - 1,s) << endl;
    return 0;
}

B

传送门

简单的手速打表题，还因为奇奇怪怪的敲错吃了三发罚时QAQ😭

这题可以“简单的”运用一下递归，因为你会发现这是一个轴对称图形

上下是一样的，所以你可以return check(16 - n , m)

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
string s;
int a[M][M];
bool check(int n,int m){
    if (n == 1 || m == 1 || n == 15 || m == 15) return true;
    else{
        if (n == 2){
            if (m == 1 || m == 15) return true;
            else return false;
        }
        else if (n == 3){
            if (m == 2 || m == 14) return false;
            else return true;
        }
        else if (n == 4){
            if (m == 1 || m == 3 || m == 15 || m == 13) return true;
            else return false;
        }
        else if (n == 5){
            if (m == 2 || m == 4 || m == 14 || m == 12) return false;
            else return true;
        }
        else if (n == 6){
            if (m == 1 || m == 3 || m == 5 || m == 15 || m == 13 || m == 11) return true;
            else return false;
        }
        else if (n == 7) {
            if (m == 1 || m == 3 || m == 5 || m == 8 ||  m == 7 || m == 9 || m == 11 || m == 13 || m == 15) return true;
            else return false;
        }
        else if (n == 8){
            if (m == 1 || m == 3 || m == 5 || m == 7 || m == 9 || m == 11 || m == 13 || m == 15) return true;
            else return false;
        }
        else return check(16 - n , m);
    }
}
signed main(){
    int n,m,k;
    cin >> n >> m;
    if (check(n,m)) cout << "black" << endl;
    else cout << "white" << endl;
    return 0;
}

C

传送门

check函数表示删除后的a数组和b数组是否相同，

DFS2表示删除行，DFS1表示删除列，刚开始从0，0删除，表示一边不删

然后枚举要删的边，再搜索就可以了

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int n, m, k, l;
int a[15][15], b[15][15];
bool vish[15], visl[15];
bool f;
void check(){
    bool t = 1;
    int bi = 1;
    for (int i = 1; i <= n; i++){
        if (vish[i]) continue;
        int bj = 1;
        for (int j = 1; j <= m; j++){
            if (visl[j]) continue;
            if (a[i][j] != b[bi][bj]){
                t = 0;
                break;
            }
            bj++;
        }
        bi++;
    }
    if (t == 1) f = 1;
}
void DFS2(int num, int last){
    if (num == m - l){
        check();
        return;
    }
    for (int i = last + 1; i <= m; i++){
        visl[i] = 1;
        DFS2(num + 1, i);
        visl[i] = 0;
    }
}
void DFS1(int num, int last){
    if (num == n - k){
        DFS2(0, 0);
        return;
    }
    for (int i = last + 1; i <= n; i++){
        vish[i] = 1;
        DFS1(num + 1, i);
        vish[i] = 0;
    }
}
signed main(){
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    cin >> k >> l;
    for (int i = 1; i <= k; i++)
        for (int j = 1; j <= l; j++)
            cin >> b[i][j];

    if (n < k || m < l) {
        cout << "No" << endl;
        return 0;
    }
    DFS1(0, 0);
    if (f) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

D

传送门

求逆序对个数，有以下两个做法：

建议第一个做法，

考试的时候，在可以（比如数据量只有5000就可以用 , 数据量用,数据量500大概可以floyd(n的三次方)）的情况下一定要用自己最拿手的方法（一般比较暴力）

因为数据量太小，所以可以用做法完全可以过

不是吹，都能过

但是需要重新构造一下每个字符的大小

用m[i]表示每个字符的大小

"atcoder"

a = 1 , t = 2 , c = 3 ,o = 4, d = 5 , e = 6,r  = 7 

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1048586
#define endl "\n"
string s;
string t = "atcoder";
map<char ,int> m;
// 重构
void init(){
    m['a'] = 1;
    m['t'] = 2;
    m['c'] = 3;
    m['o'] = 4;
    m['d'] = 5;
    m['e'] = 6;
    m['r'] = 7;
}
signed main(){
    int n,k;
    init();
    cin >> s;
    int cnt = 0;
    for(int i = 0 ; i < s.size() ; i ++){
        for(int j = i + 1 ; j < s.size(); j ++){
            if (m[s[j]] < m[s[i]]) cnt ++;
        }
    }
    cout << cnt << endl;
    return 0;
}

2.树状数组

n log n就是都可以过，至于树状数组，大家自行百度

同样也需要重构每个字符的大小，至于重构过程就是i从1-7点for循环

稍微地有一点点装

#include<bits/stdc++.h>
#define lowbit(x) ((x)&(-(x)))
using namespace std;
#define int long long
int n, m, ans;
#define N 500005
int a[N], b[N], c[N];
void add(int p, int v){
    while(p <= n + 1000){
        c[p] += v;
        p += lowbit(p);
    }
}

int query(int p){
    int ret = 0;
    while(p>0){
        ret += c[p];
        p -= lowbit(p);
    }
    return ret;
} 

int main(){
	n = 7;
	string s;
	cin >> s;
	for (int i = 1; i <= 7; i++) {
		if (s[i - 1] == 'a') a[i] = 1;
		if (s[i - 1] == 't') a[i] = 2;
		if (s[i - 1] == 'c') a[i] = 3;
		if (s[i - 1] == 'o') a[i] = 4;
		if (s[i - 1] == 'd') a[i] = 5;
		if (s[i - 1] == 'e') a[i] = 6;
		if (s[i - 1] == 'r') a[i] = 7;
        b[i] = a[i];
	}
    sort(b + 1, b + n + 1);
    m = unique(b + 1, b + n + 1) - b;
    for (int i = 1; i <= n; i++) {
        int x = lower_bound(b + 1,b + m + 1, a[i]) - b;
        ans += (i - 1 - query(x));
        add(x, 1);
    }
    cout<<ans<<endl;
}