oj.uz

답안 #721579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721579 2023-04-11T04:55:02 Z becaido Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 1394 ms 34264 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int base = 10007;
const int MOD = 998244353;
const ll INF = 1e18;
const int SIZE = 2505;

int n;
string s;
int A, B, C;
ll dp[SIZE][SIZE];
int nxt[SIZE];

int pro[SIZE], inv[SIZE], pre[SIZE];
int power(int d, int up) {
    int re = 1;
    while (up) {
        if (up & 1) re = 1ll * re * d % MOD;
        d = 1ll * d * d % MOD;
        up >>= 1;
    }
    return re;
}
int cal(int l, int r) {
    int x = pre[r] - pre[l - 1];
    if (x < 0) x += MOD;
    return 1ll * x * inv[l] % MOD;
}

void solve() {
    cin >> n >> s;
    cin >> A >> B >> C;
    s = " " + s;
    pro[0] = inv[0] = 1;
    inv[1] = power(base, MOD - 2);
    FOR (i, 1, n) {
        pro[i] = 1ll * pro[i - 1] * base % MOD;
        inv[i] = 1ll * inv[i - 1] * inv[1] % MOD;
        pre[i] = (pre[i - 1] + 1ll * pro[i] * s[i]) % MOD;
    }
    FOR (i, 1, n) FOR (j, i, n) dp[i][j] = INF;
    FOR (len, 1, n) {
        unordered_map<int, int> pos;
        unordered_map<int, vector<int>> mp;
        for (int l = 1, r = len; r <= n; l++, r++) {
            dp[l][r] = min(dp[l][r], min(dp[l][r - 1], dp[l + 1][r]) + A);
            int val = cal(l, r);
            pos[val] = 0;
            mp[val].pb(l);
        }
        for (int l = 1, r = len; r <= n; l++, r++) {
            int val = cal(l, r);
            while (pos[val] < mp[val].size() && mp[val][pos[val]] <= r) pos[val]++;
            if (pos[val] == mp[val].size()) nxt[l] = n + 1;
            else nxt[l] = mp[val][pos[val]];
        }
        for (int l = 1, r = len; r <= n; l++, r++) {
            int pl = l, pr = r, cnt = 1;
            while (pr <= n) {
                dp[l][pr] = min(dp[l][pr], dp[l][r] + B + 1ll * C * cnt + 1ll * A * (pr - l + 1 - len * cnt));
                pl = nxt[pl];
                pr = pl + len - 1;
                cnt++;
            }
        }
    }
    cout << dp[1][n] << '\n';
}

int main() {
    Waimai;
    solve();
}

Compilation message

copypaste3.cpp: In function 'void solve()':
copypaste3.cpp:72:29: warning: comparison of integer expressions of different signedness: 'std::unordered_map<int, int>::mapped_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             while (pos[val] < mp[val].size() && mp[val][pos[val]] <= r) pos[val]++;
copypaste3.cpp:73:26: warning: comparison of integer expressions of different signedness: 'std::unordered_map<int, int>::mapped_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             if (pos[val] == mp[val].size()) nxt[l] = n + 1;

Subtask #1
1.0 / 1.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 385 ms 20780 KB Output is correct
4 Correct 437 ms 23612 KB Output is correct
5 Correct 584 ms 26772 KB Output is correct
6 Correct 629 ms 30168 KB Output is correct
7 Correct 744 ms 33876 KB Output is correct
8 Correct 778 ms 33876 KB Output is correct
9 Correct 791 ms 33876 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 392 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 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 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 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 392 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 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 6 ms 1236 KB Output is correct
42 Correct 8 ms 1344 KB Output is correct
43 Correct 9 ms 1336 KB Output is correct
44 Correct 10 ms 1236 KB Output is correct
45 Correct 9 ms 1320 KB Output is correct
46 Correct 8 ms 1340 KB Output is correct
47 Correct 6 ms 1236 KB Output is correct
48 Correct 7 ms 1236 KB Output is correct
49 Correct 9 ms 1324 KB Output is correct
50 Correct 7 ms 1236 KB Output is correct
51 Correct 6 ms 1236 KB Output is correct
52 Correct 7 ms 1320 KB Output is correct
53 Correct 10 ms 1336 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 392 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 340 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 6 ms 1236 KB Output is correct
42 Correct 8 ms 1344 KB Output is correct
43 Correct 9 ms 1336 KB Output is correct
44 Correct 10 ms 1236 KB Output is correct
45 Correct 9 ms 1320 KB Output is correct
46 Correct 8 ms 1340 KB Output is correct
47 Correct 6 ms 1236 KB Output is correct
48 Correct 7 ms 1236 KB Output is correct
49 Correct 9 ms 1324 KB Output is correct
50 Correct 7 ms 1236 KB Output is correct
51 Correct 6 ms 1236 KB Output is correct
52 Correct 7 ms 1320 KB Output is correct
53 Correct 10 ms 1336 KB Output is correct
54 Correct 40 ms 2900 KB Output is correct
55 Correct 105 ms 8280 KB Output is correct
56 Correct 228 ms 8432 KB Output is correct
57 Correct 217 ms 8428 KB Output is correct
58 Correct 197 ms 8428 KB Output is correct
59 Correct 188 ms 8448 KB Output is correct
60 Correct 268 ms 8448 KB Output is correct
61 Correct 153 ms 8312 KB Output is correct
62 Correct 113 ms 8396 KB Output is correct
63 Correct 188 ms 8372 KB Output is correct
64 Correct 225 ms 8372 KB Output is correct
65 Correct 168 ms 8348 KB Output is correct
66 Correct 168 ms 8320 KB Output is correct
67 Correct 193 ms 8424 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 385 ms 20780 KB Output is correct
14 Correct 437 ms 23612 KB Output is correct
15 Correct 584 ms 26772 KB Output is correct
16 Correct 629 ms 30168 KB Output is correct
17 Correct 744 ms 33876 KB Output is correct
18 Correct 778 ms 33876 KB Output is correct
19 Correct 791 ms 33876 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 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 340 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 492 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 392 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 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 0 ms 468 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 6 ms 1236 KB Output is correct
59 Correct 8 ms 1344 KB Output is correct
60 Correct 9 ms 1336 KB Output is correct
61 Correct 10 ms 1236 KB Output is correct
62 Correct 9 ms 1320 KB Output is correct
63 Correct 8 ms 1340 KB Output is correct
64 Correct 6 ms 1236 KB Output is correct
65 Correct 7 ms 1236 KB Output is correct
66 Correct 9 ms 1324 KB Output is correct
67 Correct 7 ms 1236 KB Output is correct
68 Correct 6 ms 1236 KB Output is correct
69 Correct 7 ms 1320 KB Output is correct
70 Correct 10 ms 1336 KB Output is correct
71 Correct 40 ms 2900 KB Output is correct
72 Correct 105 ms 8280 KB Output is correct
73 Correct 228 ms 8432 KB Output is correct
74 Correct 217 ms 8428 KB Output is correct
75 Correct 197 ms 8428 KB Output is correct
76 Correct 188 ms 8448 KB Output is correct
77 Correct 268 ms 8448 KB Output is correct
78 Correct 153 ms 8312 KB Output is correct
79 Correct 113 ms 8396 KB Output is correct
80 Correct 188 ms 8372 KB Output is correct
81 Correct 225 ms 8372 KB Output is correct
82 Correct 168 ms 8348 KB Output is correct
83 Correct 168 ms 8320 KB Output is correct
84 Correct 193 ms 8424 KB Output is correct
85 Correct 515 ms 16764 KB Output is correct
86 Correct 1394 ms 34252 KB Output is correct
87 Correct 1341 ms 34264 KB Output is correct
88 Correct 1308 ms 34260 KB Output is correct
89 Correct 1212 ms 34232 KB Output is correct
90 Correct 1186 ms 34236 KB Output is correct
91 Correct 720 ms 33900 KB Output is correct
92 Correct 899 ms 33884 KB Output is correct
93 Correct 1131 ms 34060 KB Output is correct
94 Correct 1164 ms 34256 KB Output is correct
95 Correct 1115 ms 34084 KB Output is correct
96 Correct 1103 ms 34028 KB Output is correct
97 Incorrect 1220 ms 34256 KB Output isn't correct
98 Halted 0 ms 0 KB -