oj.uz

답안 #548907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548907 2022-04-14T16:32:56 Z Ronin13 Copy and Paste 3 (JOI22_copypaste3) C++14
1 / 100
 3000 ms 178900 KB 
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;

const int NMAX = 2501 + 1;
const int inf = 1e9 + 1;
const ll linf = 1e18 + 1;
const ll mod = 1e9 + 7;
const ll pr = 29;

ll po[NMAX];
ll h[NMAX];

void hashing(string &s){
    h[0] = 0;
    int n = s.size();
    for(int i = 1; i <= n; i++){
        ll x = s[i - 1] - 'a' + 1;
        h[i] = h[i - 1] * pr + x;
        h[i] %= mod;
    }
}

ll get(int l, int r){
    ll x = h[r] - h[l - 1] * po[r - l + 1];
    x %= mod;
    x += mod;
    x %= mod;
    return x;
}

ll dp[NMAX][NMAX];
int adj[NMAX][NMAX];

int main(){
    po[0] = 1;
    for(int i = 1; i < NMAX; i++){
        po[i] = po[i - 1] * pr;
    }
    for(int i = 1; i < NMAX; i++){
        for(int j = 1; j < NMAX; j++){
            dp[i][j] = linf;
        }
    }
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    string s; cin >> s;
    ll a, b, c;
    cin >> a >> b >> c;
    hashing(s);
    map <ll, int> mp;
    vector < vector <ll> > vec(n + 1);
    for(int i = 1; i <= n; i++){
        for(ll to : vec[i - 1]) mp[to] = i - 1;
        for(int j = i; j <= n; j++){
            ll x = get(i, j);
            int v = mp[x];
            if(v != 0)
            adj[i][j - i + 1] = v - (j - i);
            vec[j].pb(x);
        }
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            cout << adj[i][j] << ' ';
        }
        cout << "\n";
    }*/
    for(int r = 1; r <= n; r++){
        vector < vector <int> > v(n + 1);
        vector <ll> cnt(n + 1, 0);
        for(int i = 1; i <= r; i++){
            int cur = r - i + 1;
            while(cur){
                v[cur].pb(i);
                cur = adj[cur][i];
            }
        }
        ll mn = 0;
        dp[r][r] = a;
        for(int l = r; l >= 1; l--){
            for(ll to : v[l]){
                cnt[to]++;
                ll val = dp[r - to + 1][r] + b;
                val += (c - to * a) * cnt[to];
                mn = min(mn, val);
            }
            dp[l][r] = mn + (r - l + 1) * a;
            dp[l][r] = min(dp[l][r], dp[l][r - 1] + a);
        }
    }
    /*for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dp[i][j] == linf) cout << "-1 ";
            else cout << dp[i][j] << " ";
        }
        cout << "\n";
    }*/
    cout << dp[1][n];
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49268 KB Output is correct
2 Correct 23 ms 49236 KB Output is correct
3 Correct 20 ms 49228 KB Output is correct
4 Correct 21 ms 49304 KB Output is correct
5 Correct 20 ms 49284 KB Output is correct
6 Correct 20 ms 49236 KB Output is correct
7 Correct 20 ms 49260 KB Output is correct
8 Correct 20 ms 49312 KB Output is correct
9 Correct 21 ms 49304 KB Output is correct
10 Correct 22 ms 49288 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49356 KB Output is correct
2 Correct 20 ms 49236 KB Output is correct
3 Execution timed out 3070 ms 178900 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49268 KB Output is correct
2 Correct 23 ms 49236 KB Output is correct
3 Correct 20 ms 49228 KB Output is correct
4 Correct 21 ms 49304 KB Output is correct
5 Correct 20 ms 49284 KB Output is correct
6 Correct 20 ms 49236 KB Output is correct
7 Correct 20 ms 49260 KB Output is correct
8 Correct 20 ms 49312 KB Output is correct
9 Correct 21 ms 49304 KB Output is correct
10 Correct 22 ms 49288 KB Output is correct
11 Correct 19 ms 49236 KB Output is correct
12 Correct 20 ms 49316 KB Output is correct
13 Correct 20 ms 49388 KB Output is correct
14 Correct 20 ms 49312 KB Output is correct
15 Correct 20 ms 49332 KB Output is correct
16 Correct 20 ms 49336 KB Output is correct
17 Correct 21 ms 49296 KB Output is correct
18 Correct 23 ms 49236 KB Output is correct
19 Correct 21 ms 49264 KB Output is correct
20 Correct 25 ms 49208 KB Output is correct
21 Correct 20 ms 49372 KB Output is correct
22 Correct 21 ms 49444 KB Output is correct
23 Correct 20 ms 49364 KB Output is correct
24 Correct 20 ms 49436 KB Output is correct
25 Correct 21 ms 49364 KB Output is correct
26 Correct 20 ms 49272 KB Output is correct
27 Correct 21 ms 49352 KB Output is correct
28 Correct 21 ms 49372 KB Output is correct
29 Correct 22 ms 49364 KB Output is correct
30 Correct 21 ms 49392 KB Output is correct
31 Correct 21 ms 49368 KB Output is correct
32 Incorrect 24 ms 49444 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49268 KB Output is correct
2 Correct 23 ms 49236 KB Output is correct
3 Correct 20 ms 49228 KB Output is correct
4 Correct 21 ms 49304 KB Output is correct
5 Correct 20 ms 49284 KB Output is correct
6 Correct 20 ms 49236 KB Output is correct
7 Correct 20 ms 49260 KB Output is correct
8 Correct 20 ms 49312 KB Output is correct
9 Correct 21 ms 49304 KB Output is correct
10 Correct 22 ms 49288 KB Output is correct
11 Correct 19 ms 49236 KB Output is correct
12 Correct 20 ms 49316 KB Output is correct
13 Correct 20 ms 49388 KB Output is correct
14 Correct 20 ms 49312 KB Output is correct
15 Correct 20 ms 49332 KB Output is correct
16 Correct 20 ms 49336 KB Output is correct
17 Correct 21 ms 49296 KB Output is correct
18 Correct 23 ms 49236 KB Output is correct
19 Correct 21 ms 49264 KB Output is correct
20 Correct 25 ms 49208 KB Output is correct
21 Correct 20 ms 49372 KB Output is correct
22 Correct 21 ms 49444 KB Output is correct
23 Correct 20 ms 49364 KB Output is correct
24 Correct 20 ms 49436 KB Output is correct
25 Correct 21 ms 49364 KB Output is correct
26 Correct 20 ms 49272 KB Output is correct
27 Correct 21 ms 49352 KB Output is correct
28 Correct 21 ms 49372 KB Output is correct
29 Correct 22 ms 49364 KB Output is correct
30 Correct 21 ms 49392 KB Output is correct
31 Correct 21 ms 49368 KB Output is correct
32 Incorrect 24 ms 49444 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49268 KB Output is correct
2 Correct 23 ms 49236 KB Output is correct
3 Correct 20 ms 49228 KB Output is correct
4 Correct 21 ms 49304 KB Output is correct
5 Correct 20 ms 49284 KB Output is correct
6 Correct 20 ms 49236 KB Output is correct
7 Correct 20 ms 49260 KB Output is correct
8 Correct 20 ms 49312 KB Output is correct
9 Correct 21 ms 49304 KB Output is correct
10 Correct 22 ms 49288 KB Output is correct
11 Correct 19 ms 49236 KB Output is correct
12 Correct 20 ms 49316 KB Output is correct
13 Correct 20 ms 49388 KB Output is correct
14 Correct 20 ms 49312 KB Output is correct
15 Correct 20 ms 49332 KB Output is correct
16 Correct 20 ms 49336 KB Output is correct
17 Correct 21 ms 49296 KB Output is correct
18 Correct 23 ms 49236 KB Output is correct
19 Correct 21 ms 49264 KB Output is correct
20 Correct 25 ms 49208 KB Output is correct
21 Correct 20 ms 49372 KB Output is correct
22 Correct 21 ms 49444 KB Output is correct
23 Correct 20 ms 49364 KB Output is correct
24 Correct 20 ms 49436 KB Output is correct
25 Correct 21 ms 49364 KB Output is correct
26 Correct 20 ms 49272 KB Output is correct
27 Correct 21 ms 49352 KB Output is correct
28 Correct 21 ms 49372 KB Output is correct
29 Correct 22 ms 49364 KB Output is correct
30 Correct 21 ms 49392 KB Output is correct
31 Correct 21 ms 49368 KB Output is correct
32 Incorrect 24 ms 49444 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 49268 KB Output is correct
2 Correct 23 ms 49236 KB Output is correct
3 Correct 20 ms 49228 KB Output is correct
4 Correct 21 ms 49304 KB Output is correct
5 Correct 20 ms 49284 KB Output is correct
6 Correct 20 ms 49236 KB Output is correct
7 Correct 20 ms 49260 KB Output is correct
8 Correct 20 ms 49312 KB Output is correct
9 Correct 21 ms 49304 KB Output is correct
10 Correct 22 ms 49288 KB Output is correct
11 Correct 20 ms 49356 KB Output is correct
12 Correct 20 ms 49236 KB Output is correct
13 Execution timed out 3070 ms 178900 KB Time limit exceeded
14 Halted 0 ms 0 KB -