oj.uz

답안 #77596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77596 2018-09-28T19:33:43 Z duality Palindromic Partitions (CEOI17_palindromic) C++11
35 / 100
 10000 ms 808 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

char s[1000001];
int dp[1000000];
int main() {
    int i,j,k,l;
    int t,n;
    scanf("%d",&t);
    for (i = 0; i < t; i++) {
        scanf("%s",s);
        n = strlen(s);

        int ans = 1;
        for (j = 0; j < n/2; j++) {
            int m = -MAX_VAL;
            for (k = 0; k <= j; k++) {
                for (l = k; l <= j; l++) {
                    if (s[l] != s[n-j-1+l-k]) break;
                }
                if (l > j) m = max(m,(k == 0) ? 0:dp[k-1]);
            }
            dp[j] = m+1;
            ans = max(ans,2*dp[j]+((2*(j+1) == n) ? 0:1));
        }
        printf("%d\n",ans);
    }

    return 0;
}

Compilation message

palindromic.cpp: In function 'int main()':
palindromic.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&t);
     ~~~~~^~~~~~~~~
palindromic.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",s);
         ~~~~~^~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 5 ms 628 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 2 ms 688 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 5 ms 628 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Execution timed out 10088 ms 808 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 5 ms 628 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Execution timed out 10088 ms 808 KB Time limit exceeded
11 Halted 0 ms 0 KB -