Submission #1324332

#TimeUsernameProblemLanguageResultExecution timeMemory
1324332benjaminshihSet (COCI21_set)C++20
40 / 110
1098 ms58452 KiB
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n,k;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> k;
    map<string,int> mp;
    vector<string> cards(n);
    for(int i = 0 ; i < n ; i++){
        cin >> cards[i];
        mp[cards[i]] = i;
    }
    ll cnt = 0;
    for(int i = 0 ; i < n ; i++){
        for(int j = i+1 ; j < n ; j++){
            string tar;

            for(int l = 0 ; l < k ; l++){
                if(cards[i][l] == cards[j][l]){
                    tar += cards[i][l];
                }
                else{
                    char miss = '1'+'2'+'3' - cards[i][l] - cards[j][l];
                    tar += miss;
                }
            }
            if(mp.count(tar)){
                if(mp[tar] > j){
                    cnt++;
                }
            }
        }
    }
    cout << cnt << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...