# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951572 | 2024-03-22T06:49:18 Z | mocha | Genetics (BOI18_genetics) | C++14 | 2000 ms | 30452 KB |
#include <bits/stdc++.h> using namespace std; const int mx = 4105; int n, m, k; int a[mx][mx]; string st[mx]; int main() { cin.tie(0);ios::sync_with_stdio(0); cin >> n >> m >> k; for (int i=0;i<n;i++) { cin >> st[i]; } for (int i=0;i<m;i++) { for (int j=0;j<n;j++) { for (int k=0;k<n;k++) { if (st[j][i] != st[k][i]) { a[j][k]++; } } } } int ans = -1; for (int i=0;i<n;i++) { bool fl = 1; for (int j=0;j<n;j++) { if (i == j) continue; if (a[i][j] != k) { fl = 0; break; } } if (fl) { cout << i+1 << "\n"; return 0; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2652 KB | Output is correct |
2 | Correct | 2 ms | 2652 KB | Output is correct |
3 | Correct | 1 ms | 2652 KB | Output is correct |
4 | Correct | 1 ms | 2648 KB | Output is correct |
5 | Correct | 1 ms | 2652 KB | Output is correct |
6 | Correct | 2 ms | 2652 KB | Output is correct |
7 | Correct | 1 ms | 2652 KB | Output is correct |
8 | Correct | 1 ms | 604 KB | Output is correct |
9 | Correct | 2 ms | 2804 KB | Output is correct |
10 | Correct | 2 ms | 2652 KB | Output is correct |
11 | Correct | 2 ms | 2648 KB | Output is correct |
12 | Correct | 2 ms | 2652 KB | Output is correct |
13 | Correct | 2 ms | 2652 KB | Output is correct |
14 | Correct | 1 ms | 2652 KB | Output is correct |
15 | Correct | 2 ms | 2652 KB | Output is correct |
16 | Correct | 1 ms | 2652 KB | Output is correct |
17 | Correct | 1 ms | 2652 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2028 ms | 30452 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2028 ms | 30452 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2652 KB | Output is correct |
2 | Correct | 2 ms | 2652 KB | Output is correct |
3 | Correct | 1 ms | 2652 KB | Output is correct |
4 | Correct | 1 ms | 2648 KB | Output is correct |
5 | Correct | 1 ms | 2652 KB | Output is correct |
6 | Correct | 2 ms | 2652 KB | Output is correct |
7 | Correct | 1 ms | 2652 KB | Output is correct |
8 | Correct | 1 ms | 604 KB | Output is correct |
9 | Correct | 2 ms | 2804 KB | Output is correct |
10 | Correct | 2 ms | 2652 KB | Output is correct |
11 | Correct | 2 ms | 2648 KB | Output is correct |
12 | Correct | 2 ms | 2652 KB | Output is correct |
13 | Correct | 2 ms | 2652 KB | Output is correct |
14 | Correct | 1 ms | 2652 KB | Output is correct |
15 | Correct | 2 ms | 2652 KB | Output is correct |
16 | Correct | 1 ms | 2652 KB | Output is correct |
17 | Correct | 1 ms | 2652 KB | Output is correct |
18 | Execution timed out | 2028 ms | 30452 KB | Time limit exceeded |
19 | Halted | 0 ms | 0 KB | - |