# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
241008 | 2020-06-22T06:29:53 Z | SamAnd | Baza (COCI17_baza) | C++17 | 127 ms | 9080 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 1003; int n, m; int a[N][N]; int b[N]; void solv() { scanf("%d%d", &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scanf("%d", &a[i][j]); } } int qq; scanf("%d", &qq); while (qq--) { for (int i = 1; i <= m; ++i) scanf("%d", &b[i]); int ans = 0; for (int i = 1; i <= n; ++i) { bool z = true; for (int j = 1; j <= m; ++j) { if (b[j] == -1) continue; if (a[i][j] != b[j]) { z = false; break; } } ans += z; } printf("%d\n", ans); } } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 2936 KB | Output is correct |
2 | Correct | 30 ms | 2688 KB | Output is correct |
3 | Correct | 82 ms | 7160 KB | Output is correct |
4 | Correct | 24 ms | 2432 KB | Output is correct |
5 | Correct | 63 ms | 4344 KB | Output is correct |
6 | Correct | 93 ms | 6776 KB | Output is correct |
7 | Correct | 127 ms | 9080 KB | Output is correct |
8 | Correct | 79 ms | 5624 KB | Output is correct |
9 | Correct | 53 ms | 5624 KB | Output is correct |
10 | Correct | 120 ms | 7936 KB | Output is correct |