Submission #547470

#	Time	Username	Problem	Language	Result	Execution time	Memory
547470		duality	Copy and Paste 3 (JOI22_copypaste3)	C++17	100 / 100	1278 ms	67336 KiB

copypaste3

#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 ----------
#define MOD ((1LL << 53)-1)

char S[2500];
LLI h[2500][2500];
LLI dp[2500][2500];
int main() {
    int i;
    int N,A,B,C;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf(" %c",&S[i]);
    scanf("%d %d %d",&A,&B,&C);

    int j;
    for (i = 0; i < N; i++) {
        LLI x = 0;
        for (j = i; j < N; j++) x = (x*31+S[j]) % MOD,h[i][j] = x,dp[i][j] = 1e18;
    }
    for (i = 0; i < N; i++) dp[i][i] = A;
    for (i = 1; i <= N; i++) {
        vpii vv;
        for (j = 0; j <= N-i; j++) {
            if (i > 0) dp[j][j+i-1] = min(dp[j][j+i-1],min(dp[j+1][j+i-1],dp[j][j+i-2])+A);
            vv.pb(mp(h[j][j+i-1],j));
        }
        sort(vv.begin(),vv.end());
        for (pii p: vv) {
            int c = 1;
            j = p.second;
            while (1) {
                int q = lower_bound(vv.begin(),vv.end(),mp(p.first,j+i))-vv.begin();
                if ((q < vv.size()) && (vv[q].first == p.first)) {
                    j = vv[q].second,c++;
                    dp[p.second][j+i-1] = min(dp[p.second][j+i-1],dp[p.second][p.second+i-1]+B+(LLI) C*c+(LLI) A*(j+i-p.second-c*i));
                }
                else break;
            }
        }
    }
    printf("%lld\n",dp[0][N-1]);

    return 0;
}

Compilation message (stderr)

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:87:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |                 if ((q < vv.size()) && (vv[q].first == p.first)) {
      |                      ~~^~~~~~~~~~~
copypaste3.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
copypaste3.cpp:66:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     for (i = 0; i < N; i++) scanf(" %c",&S[i]);
      |                             ~~~~~^~~~~~~~~~~~~
copypaste3.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     scanf("%d %d %d",&A,&B,&C);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 1 / 1
• Subtask 2: 5 / 5
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 32 / 32
• Subtask 6: 38 / 38