# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
281697 | williamMBDK | Cubeword (CEOI19_cubeword) | C++14 | 860 ms | 144544 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M = 62;
string chars = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890";
vector<vector<vector<int>>> cnt (11, vector<vector<int>> (M, vector<int> (M)));
vector<int> f = {0,1,2,6,24};
int cntuni(vector<int> arr){
map<int,int> cnt;
for(auto e : arr) cnt[e]++;
int res = 1;
for(auto p : cnt) res *= f[p.second];
return 24 / res;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<char,int> mp;
for(int i = 0; i < M; i++) mp[chars[i]] = i;
int N; cin >> N;
set<string> seen;
for(int i = 0; i < N; i++){
string s; cin >> s;
if(seen.count(s)) continue;
cnt[s.length()][mp[s[0]]][mp[s[s.length() - 1]]]++;
seen.insert(s);
reverse(s.begin(), s.end());
if(seen.count(s)) continue;
cnt[s.length()][mp[s[0]]][mp[s[s.length() - 1]]]++;
seen.insert(s);
# | 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... |