# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845439 | vjudge1 | Trener (COCI20_trener) | C++17 | 2041 ms | 158576 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 <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define pri pair<int,int>
#define prl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pair<int,int>>
#define vpl vector<pair<ll,ll>>
#define re return 0
#define sqrt sqrtl
struct node {
string val;
vector<int> adj; //asagi
ll ds = 0;
};
int insides(string s1, string s2) {
if (s1[0]!=s2[0] && s1[1]!=s2[0]) return 0;
int flag = 1;
for (int i = 1;i<s1.size();i++) {
if (s1[i]!=s2[i-1]) {flag=0;break;}
}
if (flag) return 1;
flag=1;
for (int i = 1;i<s1.size();i++) {
if (s1[i-1]!=s2[i-1]) {flag=0;break;}
}
if (flag) return 1;
return 0;
}
int32_t main() {
int n,k;cin>>n>>k;
vector<node> nodes(n*k);
for (int i = 0;i<n;i++) {
for (int j = 0;j<k;j++) {
string s1;cin>>s1;nodes[i*k+j].val=s1;
}
}
for (int i = n-1;i>-1;i--){
for (int j = 0;j<k;j++) {
if (i==n-1) {nodes[i*k+j].ds=1;continue;}
nodes[i*k+j].ds=0;
for (int x = 0;x<k;x++) {
if (nodes[(i+1)*k+x].ds==0) continue;
int st = insides(nodes[(i+1)*k+x].val,nodes[i*k+j].val);
if (st) {
nodes[(i+1)*k+x].adj.push_back(i*k+j);
nodes[i*k+j].ds+=nodes[(i+1)*k+x].ds;
nodes[i*k+j].ds%=MOD;
}
}
}
}
ll t = 0;
for (int i = 0;i<k;i++){
t+=nodes[i].ds;
t%=MOD;
} cout<<t%MOD<<endl;
/* for (int i = 0;i<n*k;i++) {
cout<<nodes[i].val<<" "<<nodes[i].ds<<" "<<nodes[i].adj.size()<<endl;
} */
return 0;
}
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... |