# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765705 | boyliguanhan | Lampice (COCI19_lampice) | C++17 | 5045 ms | 524288 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;
string S;
int ans = 0;
vector<int> adj[50100];
void dfs(int x, string str, int p) {
str+=S[x-1];
for(auto i: adj[x]) {
if(i!=p)
dfs(i,str,x);
}
if(ans < str.size()) {
string str2 = str;
reverse(str2.begin(), str2.end());
if(str==str2) ans = max(ans, (int)str.size());
}
}
int main() {
int n;
cin >> n >> S;
for(int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i = 1; i <= n; i++) {
dfs(i,"",0);
}
cout << ans << '\n';
}
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... |