Submission #1270948

#TimeUsernameProblemLanguageResultExecution timeMemory
1270948soabTopical (NOI23_topical)C++20
12 / 100
117 ms39588 KiB
// soab

#include <bits/stdc++.h>

using namespace std;

#define int long long 
#define nl '\n'

void io() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}   

const int maxn = 1e3 + 1;
int n, k;

void sub1(const vector<vector<int>>& r) {   
    for(int i = 1; i <= k; i++) {
        if(r[1][i] != 0) {

            cout << 0;
            return;
        }
    }
    cout << 1;
}

signed main() {
    io();

    cin >> n >> k;
    vector<vector<int>> r(n + 1, vector<int>(k + 1));
    vector<vector<int>> u(n + 1, vector<int>(k + 1));
    // int r[n + 1][k + 1], u[n + 1][k + 1];

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) cin >> r[i][j];
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) cin >> u[i][j];
    }

    // for(int i = 1; i <= n; i++) {
    //     for(int j = 1; j <= k; j++) {
    //         cout << u[i][j] << ' ';
    //     }
    //     cout << nl;
    // }

    sub1(r);


    return 0;
}   
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...