oj.uz

답안 #47328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47328 2018-05-01T04:50:04 Z Talant 회문 (APIO14_palindrome) C++17
0 / 100
 175 ms 44176 KB 
#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long

using namespace std;

const int inf = (int)1e18 + 7;
const int N = (int)2e5 + 7;

int p = 97;
int dp[1002][1002];
int hs[N],pw[N];
int n,ans;

string a;
unordered_map<int,int> u;

void f (int l,int r) {
      int lst= 0;
      if (l > 0)
            lst = hs[l - 1];

      int o = hs[r] - lst;

      o *= pw[n - l];

      u[o] ++;
      ans = max(ans,u[o] * (r - l + 1));
}
main () {
      pw[0] = 1;
      for (int i = 1; i <= 1010; i ++)
            pw[i] = pw[i - 1] * p;

      cin >> a;

      n = a.size();

      hs[0] = (int)(a[0] - 'a' + 1);

      for (int i = 1; i < n; i ++)
            hs[i] = hs[i - 1] + (pw[i] * (int)(a[i] - 'a' + 1));

      for (int i = 0; i < n; i ++) {
            for (int j = i; j >= 0; j --) {
                  if (i - j <= 1) {
                        if (a[i] == a[j]) {
                              dp[j][i] = 1;
                              f(j,i);
                        }
                  }
                  else if (dp[j + 1][i - 1]){
                        dp[j][i] = 1;
                        f(j,i);
                  }
            }
      }
      cout << ans << endl;
}

Compilation message

palindrome.cpp:36:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 2 ms 800 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 KB Output is correct
11 Incorrect 2 ms 800 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 7560 KB Output is correct
2 Correct 61 ms 13380 KB Output is correct
3 Correct 34 ms 13380 KB Output is correct
4 Correct 103 ms 19592 KB Output is correct
5 Correct 33 ms 19592 KB Output is correct
6 Correct 33 ms 19592 KB Output is correct
7 Incorrect 74 ms 19592 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 35 ms 19592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 32 ms 19592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 175 ms 44176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -