Submission #1291568

#TimeUsernameProblemLanguageResultExecution timeMemory
1291568bilgunTopical (NOI23_topical)C++20
12 / 100
101 ms12032 KiB
#include<bits/stdc++.h> using namespace std; int n, k; void subo( vector<vector<int>>& r, vector<vector<int>>& u){ for( int i = 0; i < k; i++){ if( r[0][i] > u[0][i] ){ cout << 0; return; } } cout << 1; return; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> n >> k; vector<vector<int>> r(n, vector<int>(k)), u(n, vector<int>(k)); for( int i = 0; i < n; i++) for( int j = 0; j < k; j++) cin >> r[i][j]; for( int i = 0; i < n; i++) for( int j = 0; j < k; j++) cin >> u[i][j]; if( n == 1) subo(r, u); 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...