| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|
| 1300257 | | tte0 | Set (COCI21_set) | C++20 | | 1097 ms | 17628 KiB |
// Author: Teoman Ata Korkmaz
#include <bits/stdc++.h>
#define int int_fast64_t
using namespace std;
constexpr int N=5.5e5;
///////////////////////////////////////////////////////////
int k,n;
string s[N];
inline bool is_set(int a,int b,int c){
for(int i=0;i<k;i++){
if( !( (s[a][i]==s[b][i] && s[b][i]==s[c][i]) ||
(s[a][i]!=s[b][i] && s[c][i]!=s[b][i] && s[a][i]!=s[c][i])))return false;
}
return true;
}
signed main(void){
cin>>n>>k;
for(int i=0;i<n;i++)cin>>s[i];
int ans=0;
for(int i=0;i<n-2;i++){
for(int j=i+1;j<n-1;j++){
for(int _=j+1;_<n;_++){
ans+=is_set(i,j,_);
}
}
}
cout<<ans<<endl;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |