Submission #165407

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
165407	2019-11-27T06:28:59 Z	egekabas	Marko (COCI15_marko)	C++14	0 / 50	106 ms	32988 KB

marko

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
int n;
int edge[1000009][15];
int final[1000009];
int cur = 1;
string ssr[1000009];
vector<int> v;
void change(string s){
    v.clear();
    for(auto u : s){
        if(u == 'a')
            v.pb(2);
        if(u == 'b'){
            v.pb(2);
            //v.pb(2);
        }
        if(u == 'c'){
            v.pb(2);
            //v.pb(2);
            //v.pb(2);
        }
        if(u == 'd')
            v.pb(3);
        if(u == 'e'){
            //v.pb(3);
            v.pb(3);
        }
        if(u == 'f'){
            v.pb(3);
            //v.pb(3);
            //v.pb(3);
        }
        if(u == 'g')
            v.pb(4);
        if(u == 'h'){
            v.pb(4);
            //v.pb(4);
        }
        if(u == 'i'){
            v.pb(4);
           // v.pb(4);
            //v.pb(4);
        }
        if(u == 'j')
            v.pb(5);
        if(u == 'k'){
            //v.pb(5);
            v.pb(5);
        }
        if(u == 'l'){
            //v.pb(5);
            //v.pb(5);
            v.pb(5);
        }
        if(u == 'm')
            v.pb(6);
        if(u == 'n'){
            v.pb(6);
            //v.pb(6);
        }
        if(u == 'o'){
            v.pb(6);
            //v.pb(6);
            //v.pb(6);
        }
        if(u == 'p')
            v.pb(7);
        if(u == 'q'){
            //v.pb(7);
            v.pb(7);
        }
        if(u == 'r'){
            v.pb(7);
            //v.pb(7);
            //v.pb(7);
        }
        if(u == 's'){
            v.pb(7);
            //v.pb(7);
            //v.pb(7);
            //v.pb(7);
        }
        if(u == 't')
            v.pb(8);
        if(u == 'u'){
            v.pb(8);
            //v.pb(8);
        }
        if(u == 'v'){
            v.pb(8);
            //v.pb(8);
            //v.pb(8);
        }
        if(u == 'w')
            v.pb(9);
        if(u == 'x'){
            v.pb(9);
            //v.pb(9);
        }
        if(u == 'y'){
            v.pb(9);
            //v.pb(9);
            //v.pb(9);
        }
        if(u == 'z'){
            v.pb(9);
            //v.pb(9);
            //v.pb(9);
            //v.pb(9);
        }
    }
}
void add(){
    int root = 1;
    for(auto u : v){
        if(edge[root][u] == 0){
            edge[root][u] = ++cur;
            root = cur;
        }
        else{
            root = edge[root][u];
        }
    }
    final[root]++;
}
int calc(){
    int root = 1;
    int ret = 0;
    for(auto u : v){
        if(edge[root][u] == 0){
            break;
        }
        else{
            root = edge[root][u];
            ret += final[root];
        }
    }
    return ret;
}
int main() {
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> ssr[i];
    }
    char c;
    v.clear();
    while(scanf("%c", &c) != EOF){
        if(c >= '0' && c <= '9')
            v.pb((int)c-(int)'0');
    }
    for(auto u : v)
            cout << u;
        cout << "\n";
    add();
    int ret = 0;
    for(int i = 0; i < n; ++i){
        change(ssr[i]);
        
        for(auto u : v)
            cout << u;
        cout << "\n";
        ret += calc();
    }
    cout << ret << "\n";
}

Subtask #1

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	33 ms	31608 KB	Output isn't correct
2	Incorrect	30 ms	31608 KB	Output isn't correct
3	Incorrect	30 ms	31608 KB	Output isn't correct
4	Incorrect	100 ms	32888 KB	Output isn't correct
5	Incorrect	40 ms	31864 KB	Output isn't correct
6	Incorrect	44 ms	31868 KB	Output isn't correct
7	Incorrect	72 ms	32388 KB	Output isn't correct
8	Incorrect	106 ms	32988 KB	Output isn't correct
9	Incorrect	43 ms	31864 KB	Output isn't correct
10	Incorrect	85 ms	32628 KB	Output isn't correct