# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
370388 | 2021-02-24T00:57:33 Z | TosakaUCW | Baza (COCI17_baza) | C++17 | 1000 ms | 380 KB |
#include <stdio.h> #include <algorithm> int read(int x = 0, int f = 0, char ch = getchar()) { while ('0' > ch or ch > '9') f = ch == '-', ch = getchar(); while ('0' <= ch and ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar(); return f ? -x : x; } const int N = 1e3 + 5; int n, m; int a[N][N], b[N]; int main() { freopen("baza.in", "r", stdin), freopen("baza.out", "w", stdout); n = read(), m = read(); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) a[i][j] = read(); for (int q = read(); q--;) { for (int i = 1; i <= m; i++) b[i] = read(); int res = 0; for (int i = 1; i <= n; i++) { bool flag = true; for (int j = 1; j <= m; j++) if (b[j] ^ -1) flag &= b[j] == a[i][j]; res += flag; } printf("%d\n", res); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1050 ms | 256 KB | Time limit exceeded |
2 | Execution timed out | 1092 ms | 256 KB | Time limit exceeded |
3 | Execution timed out | 1085 ms | 256 KB | Time limit exceeded |
4 | Execution timed out | 1086 ms | 256 KB | Time limit exceeded |
5 | Execution timed out | 1087 ms | 256 KB | Time limit exceeded |
6 | Execution timed out | 1084 ms | 256 KB | Time limit exceeded |
7 | Execution timed out | 1088 ms | 256 KB | Time limit exceeded |
8 | Execution timed out | 1040 ms | 256 KB | Time limit exceeded |
9 | Execution timed out | 1058 ms | 256 KB | Time limit exceeded |
10 | Execution timed out | 1092 ms | 380 KB | Time limit exceeded |