Codeforces Round 912 (Div. 2) A-D1

程序员永不秃头

已于 2023-12-01 16:40:36 修改

阅读量718

点赞数 18

文章标签：算法

于 2023-12-01 16:38:37 首次发布

本文链接：https://blog.csdn.net/xzxxn12138/article/details/134737685

版权

签到题

#include<iostream>
#include<sstream>
#include <cstdio>
#include<stack>
#include<vector>
#include<list>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
#include<utility>
#include<cctype>
#include<cstdio>
#include<map>
#include<set>
#define int long long
using namespace std;
int a[300050];
void solve() {
    int n, k;
    cin >> n >> k;
    int i;
    for (i = 1; i <= n; i++) {
        cin >> a[i];
    }
    if (k == 1) {
        for (i = 1; i <n; i++) {
            if (a[i] > a[i + 1]) {
                cout << "NO" << endl;
                return;
            }
        }
        cout << "YES" << endl;
    }
    else cout << "YES" << endl;
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

题意：给你一个n*n的矩阵，如果i!=j，Mij=ai|aj；请你找出能符合Mij的数组

解法，暴力贪心,a[i]只能为Mij和Mji中不冲突的值，使用AND来判断。

#include<iostream>
#include<sstream>
#include <cstdio>
#include<stack>
#include<vector>
#include<list>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
#include<utility>
#include<cctype>
#include<cstdio>
#include<map>
#include<set>
#define int long long
using namespace std;
int a[300050];
int m[1010][1010];
void solve() {
    int n;
    cin >> n;
    int i,j;
    for (i = 1; i <= n; i++) {
        a[i] = (1 << 30) - 1;
    }
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            cin >> m[i][j];
            if (j != i) {
                a[i] &= m[i][j];
                a[j] &= m[i][j];
            }
        }
    }
    int flag = 0;
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            if (j != i&&(a[i]|a[j])!=m[i][j]) {
                flag = 1;
            }
        }
    }
    if (flag == 1)cout << "NO" << endl;
    else {
        cout << "YES" << endl;
        for (i = 1; i <= n; i++) {
            cout << a[i] << " ";
        }
        cout << endl;
    }
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

C:Codeforces Round 912 (Div. 2) C-CSDN博客

D1:Codeforces Round 912 (Div. 2) D-CSDN博客