oj.uz

답안 #197987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197987 2020-01-24T12:41:25 Z model_code Lampice (COCI19_lampice) C++17
17 / 110
 5000 ms 9492 KB 
#include <bits/stdc++.h>
using namespace std;

#define x first
#define y second

typedef pair<long long, long long> hash_t;

hash_t operator+(hash_t a, hash_t b) { return {a.x + b.x, a.y + b.y}; }
hash_t operator*(hash_t a, hash_t b) { return {a.x * b.x, a.y * b.y}; }
hash_t operator+(hash_t a, char b) { return {a.x + b, a.y + b}; }
hash_t operator*(hash_t a, char b) { return {a.x * b, a.y * b}; }

const int MAXN = 100100;
const hash_t BASE = {31337, 10007};

int n;
char input[MAXN];
vector<int> adj[MAXN];
hash_t P[MAXN];

int ans = 1;

void rec(int x, int prev = -1, hash_t down = {0, 0}, hash_t up = {0, 0}, int len = 1) {
  down = down * BASE + input[x];
  up = up + P[len - 1] * input[x];
  if (up == down && len > ans)
    ans = len;
  for (int y : adj[x]) {
    if (y == prev) continue;
    rec(y, x, down, up, len + 1);
  }
}

int main(void) {
  cin >> n;
  cin >> input;
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  P[0] = {1, 1};
  for (int i = 1; i < n; ++i)
    P[i] = P[i - 1] * BASE;
  for (int i = 0; i < n; ++i)
    rec(i);
  cout << ans << endl;
  return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 11 ms 2680 KB Output is correct
3 Correct 36 ms 2808 KB Output is correct
4 Correct 97 ms 2852 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5071 ms 9492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5073 ms 6820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 11 ms 2680 KB Output is correct
3 Correct 36 ms 2808 KB Output is correct
4 Correct 97 ms 2852 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Execution timed out 5071 ms 9492 KB Time limit exceeded
9 Halted 0 ms 0 KB -