제출 #223417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
223417		dwsc	Lampice (COCI19_lampice)	C++14	0 / 110	2106 ms	524292 KiB

lampice

#include <bits/stdc++.h>
using namespace std;
string act;
vector<int> adj[50010];
map<string,int> m;
void dfs(int u,int pa,string s){
    m[s]++;
    //cout << s << "hi\n";
    //cout << s << "hi\n";
    for (int v: adj[u]){
        if (v == pa) continue;
        dfs(v,u,s+act[v]);
    }
}
int main(){
    int n;
    cin >> n;
    cin >> act;
    //cout << act << "read\n";
    for (int i = 0; i < n-1; i++){
        int a,b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    int ans = 0;
    for (int i = 0; i < n; i++){
        m.clear();
        //cout << act[i] << "\n";
        string s = "";
        s += act[i];
        dfs(i,-1,s);
        for (auto it = m.begin(); it != m.end(); ++it){
           //cout<< it->first << " " << it->second << "\n";
            if (it->second >= 2) ans = max(ans,2*(int)((it->first).length())-1);
        }
       // cout << "hi\n";
    }
    cout << ans;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 31
• Subtask 4: 0 / 37