# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1016466 | Salty | Topical (NOI23_topical) | C++14 | 384 ms | 23684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define pii pair<vector<int>,int>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<vector<int>> u(n,vector<int>(k)),r(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];
vector<int> cur (k,0);
int ans = 0;
//sub1
for(int i = 0; i < k; i++) if(r[0][i] > 0){ cout << 0; return 0;}
cout << 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |