# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375018 | ogibogi2004 | Cubeword (CEOI19_cubeword) | C++14 | 215 ms | 10604 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 ll long long
const int MAXK=26;
const int MAXN=1e5+6;
map<char,int>mp;
const ll mod=998244353;
string s[MAXN];
int cnt[100][100];
int ans=0,n;
int dp[100][100][100];
void solve(int d)
{
memset(cnt,0,sizeof(cnt));
memset(dp,0,sizeof(dp));
set<string>used;
for(int i=0;i<n;i++)
{
if(s[i].size()!=d)continue;
if(used.find(s[i])==used.end())
{
used.insert(s[i]);
cnt[mp[s[i][0]]][mp[s[i][s[i].size()-1]]]++;
}
reverse(s[i].begin(),s[i].end());
if(used.find(s[i])==used.end())
{
used.insert(s[i]);
cnt[mp[s[i][0]]][mp[s[i][s[i].size()-1]]]++;
}
Compilation message (stderr)
# | 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... |