# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
765705 | 2023-06-25T03:29:58 Z | boyliguanhan | Lampice (COCI19_lampice) | C++17 | 5000 ms | 524288 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 1492 KB | Output is correct |
2 | Correct | 14 ms | 1512 KB | Output is correct |
3 | Correct | 226 ms | 1588 KB | Output is correct |
4 | Correct | 366 ms | 1648 KB | Output is correct |
5 | Correct | 1 ms | 1364 KB | Output is correct |
6 | Correct | 1 ms | 1364 KB | Output is correct |
7 | Correct | 1 ms | 1364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 249 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5045 ms | 173664 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 1492 KB | Output is correct |
2 | Correct | 14 ms | 1512 KB | Output is correct |
3 | Correct | 226 ms | 1588 KB | Output is correct |
4 | Correct | 366 ms | 1648 KB | Output is correct |
5 | Correct | 1 ms | 1364 KB | Output is correct |
6 | Correct | 1 ms | 1364 KB | Output is correct |
7 | Correct | 1 ms | 1364 KB | Output is correct |
8 | Runtime error | 249 ms | 524288 KB | Execution killed with signal 9 |
9 | Halted | 0 ms | 0 KB | - |