# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
407556 | 2021-05-19T02:53:41 Z | LptN21 | Baza (COCI17_baza) | C++14 | 107 ms | 9104 KB |
#include <bits/stdc++.h> using namespace std; #define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); #define FF first #define SS second #define pb push_back #define sz(x) (int)x.size() #define oo 1e9 #define eps 1e-9 #define PI acos(-1.0) #define lb lower_bound #define ub upper_bound typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> ii; const int N = 1e3+7, M=13+7; const int MOD = 1e9+7; int n, m, k, t; int a[N][N], b[N]; void qry() { int ans=0; for(int i=1;i<=m;i++) scanf("%d", &b[i]); for(int j, i=1;i<=n;i++) { for(j=1;j<=m;j++) if(b[j]!=-1&&b[j]!=a[i][j]) break; ans+=(j==m+1); } printf("%d\n", ans); } signed main() { //freopen("test.inp", "r", stdin); //freopen("test.out", "w", stdout); //fastIO; scanf("%d%d", &n, &m); for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%d", &a[i][j]); scanf("%d", &k); for(int i=1;i<=k;i++) qry(); return 0; } /* stuff you should look for - int overflow, array bounds - special cases (n=1?) - do smth instead of do nothing and stay organized - WRITE STUFF DOWN - DONT JUST STICK ON ONE APPROACH */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 2908 KB | Output is correct |
2 | Correct | 25 ms | 2548 KB | Output is correct |
3 | Correct | 64 ms | 7064 KB | Output is correct |
4 | Correct | 18 ms | 2320 KB | Output is correct |
5 | Correct | 56 ms | 4164 KB | Output is correct |
6 | Correct | 67 ms | 6600 KB | Output is correct |
7 | Correct | 107 ms | 9104 KB | Output is correct |
8 | Correct | 61 ms | 5488 KB | Output is correct |
9 | Correct | 45 ms | 5572 KB | Output is correct |
10 | Correct | 86 ms | 7808 KB | Output is correct |