| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339431 | po_rag526 | Parametriziran (COCI19_parametriziran) | C++20 | 3093 ms | 1972 KiB |
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int N = 50005;
string s[N];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i ++) {
cin >> s[i];
}
long long ans = 0;
for (int i = 0; i < n; i ++) {
for (int j = i + 1; j < n; j ++) {
bool ok = true;
for (int k = 0; k < m; k ++) {
if (s[i][k] != s[j][k] && s[i][k] != '?' && s[j][k] != '?') {
ok = false;
}
}
if (ok) {
ans ++;
}
}
}
cout << ans << '\n';
}
/*
367432
*/
| # | 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... | ||||
