oj.uz

답안 #547470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547470 2022-04-10T19:26:17 Z duality Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 1278 ms 67336 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 ----------
#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

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.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 635 ms 41124 KB Output is correct
4 Correct 754 ms 46856 KB Output is correct
5 Correct 898 ms 53140 KB Output is correct
6 Correct 1109 ms 59900 KB Output is correct
7 Correct 1267 ms 67248 KB Output is correct
8 Correct 1278 ms 67248 KB Output is correct
9 Correct 1272 ms 67256 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 980 KB Output is correct
41 Correct 4 ms 2132 KB Output is correct
42 Correct 3 ms 2232 KB Output is correct
43 Correct 3 ms 2132 KB Output is correct
44 Correct 3 ms 2132 KB Output is correct
45 Correct 4 ms 2132 KB Output is correct
46 Correct 3 ms 2132 KB Output is correct
47 Correct 4 ms 2132 KB Output is correct
48 Correct 5 ms 2116 KB Output is correct
49 Correct 4 ms 2132 KB Output is correct
50 Correct 3 ms 2132 KB Output is correct
51 Correct 4 ms 2228 KB Output is correct
52 Correct 4 ms 2132 KB Output is correct
53 Correct 2 ms 2132 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 980 KB Output is correct
41 Correct 4 ms 2132 KB Output is correct
42 Correct 3 ms 2232 KB Output is correct
43 Correct 3 ms 2132 KB Output is correct
44 Correct 3 ms 2132 KB Output is correct
45 Correct 4 ms 2132 KB Output is correct
46 Correct 3 ms 2132 KB Output is correct
47 Correct 4 ms 2132 KB Output is correct
48 Correct 5 ms 2116 KB Output is correct
49 Correct 4 ms 2132 KB Output is correct
50 Correct 3 ms 2132 KB Output is correct
51 Correct 4 ms 2228 KB Output is correct
52 Correct 4 ms 2132 KB Output is correct
53 Correct 2 ms 2132 KB Output is correct
54 Correct 15 ms 5460 KB Output is correct
55 Correct 153 ms 16164 KB Output is correct
56 Correct 72 ms 16164 KB Output is correct
57 Correct 67 ms 16176 KB Output is correct
58 Correct 54 ms 16168 KB Output is correct
59 Correct 57 ms 16160 KB Output is correct
60 Correct 58 ms 16164 KB Output is correct
61 Correct 80 ms 16164 KB Output is correct
62 Correct 132 ms 16160 KB Output is correct
63 Correct 70 ms 16164 KB Output is correct
64 Correct 78 ms 16164 KB Output is correct
65 Correct 102 ms 16164 KB Output is correct
66 Correct 105 ms 16084 KB Output is correct
67 Correct 56 ms 16132 KB Output is correct

Subtask #6
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 635 ms 41124 KB Output is correct
14 Correct 754 ms 46856 KB Output is correct
15 Correct 898 ms 53140 KB Output is correct
16 Correct 1109 ms 59900 KB Output is correct
17 Correct 1267 ms 67248 KB Output is correct
18 Correct 1278 ms 67248 KB Output is correct
19 Correct 1272 ms 67256 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 0 ms 468 KB Output is correct
43 Correct 0 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 0 ms 340 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 980 KB Output is correct
58 Correct 4 ms 2132 KB Output is correct
59 Correct 3 ms 2232 KB Output is correct
60 Correct 3 ms 2132 KB Output is correct
61 Correct 3 ms 2132 KB Output is correct
62 Correct 4 ms 2132 KB Output is correct
63 Correct 3 ms 2132 KB Output is correct
64 Correct 4 ms 2132 KB Output is correct
65 Correct 5 ms 2116 KB Output is correct
66 Correct 4 ms 2132 KB Output is correct
67 Correct 3 ms 2132 KB Output is correct
68 Correct 4 ms 2228 KB Output is correct
69 Correct 4 ms 2132 KB Output is correct
70 Correct 2 ms 2132 KB Output is correct
71 Correct 15 ms 5460 KB Output is correct
72 Correct 153 ms 16164 KB Output is correct
73 Correct 72 ms 16164 KB Output is correct
74 Correct 67 ms 16176 KB Output is correct
75 Correct 54 ms 16168 KB Output is correct
76 Correct 57 ms 16160 KB Output is correct
77 Correct 58 ms 16164 KB Output is correct
78 Correct 80 ms 16164 KB Output is correct
79 Correct 132 ms 16160 KB Output is correct
80 Correct 70 ms 16164 KB Output is correct
81 Correct 78 ms 16164 KB Output is correct
82 Correct 102 ms 16164 KB Output is correct
83 Correct 105 ms 16084 KB Output is correct
84 Correct 56 ms 16132 KB Output is correct
85 Correct 174 ms 32536 KB Output is correct
86 Correct 491 ms 67164 KB Output is correct
87 Correct 433 ms 67248 KB Output is correct
88 Correct 401 ms 67252 KB Output is correct
89 Correct 392 ms 67312 KB Output is correct
90 Correct 380 ms 67256 KB Output is correct
91 Correct 676 ms 67276 KB Output is correct
92 Correct 824 ms 67252 KB Output is correct
93 Correct 471 ms 67248 KB Output is correct
94 Correct 507 ms 67276 KB Output is correct
95 Correct 782 ms 67252 KB Output is correct
96 Correct 761 ms 67336 KB Output is correct
97 Correct 361 ms 67256 KB Output is correct