| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324963 | uranhishig | Topical (NOI23_topical) | C++20 | 388 ms | 16044 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for(int i = 0; i < (n); i++)
const int mod = 1000000007;
signed main(){
int n, k;
cin >> n >> k;
int r[n][k];
int u[n][k];
rep (i, n) {
rep (j, k) {
cin>>r[i][j];
}
}
rep (i, n) {
rep (j, k) {
cin>>u[i][j];
}
}
rep (i, k) {
if (r[0][i] != 0) {
cout<<0<<endl;
return 0;
}
}
cout<<1<<endl;
}| # | 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... | ||||
