oj.uz

Submission #922686

# Submission time Handle Problem Language Result Execution time Memory
922686 2024-02-06T01:57:35 Z huutuan Copy and Paste 3 (JOI22_copypaste3) C++14
57 / 100
 3000 ms 72272 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define isz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

pair<int, int> mod={(int)1e9+7, (int)1e9+9};
const int base=311;

struct Hash{
   pair<int, int> value;
   Hash (int x=0){
      value={x%mod.first, x%mod.second};
   }
   Hash (int x, int y){
      value={x, y};
   }
   Hash operator-(){
      return Hash((mod.first-value.first)%mod.first, 
                  (mod.second-value.second)%mod.second);
   }
   Hash operator+(Hash b){
      return Hash((value.first+b.value.first)%mod.first, 
                  (value.second+b.value.second)%mod.second);
   }
   Hash operator*(Hash b){
      return Hash(value.first*b.value.first%mod.first, 
                  value.second*b.value.second%mod.second);
   }
   bool operator<(Hash b) const {
      return value<b.value;
   }
   bool operator==(Hash b) const {
      return value==b.value;
   }
};

const int N=2510;
int f[N][N], add, cut, paste, n;
int g[N][N];
Hash pf[N];
Hash pw[N];
string s;

Hash get(int l, int r){
   return pf[r]+(-pf[l-1])*pw[r-l+1];
}

void precalc(){
   pw[0]=1;
   for (int i=1; i<=n; ++i){
      pw[i]=pw[i-1]*base;
   }
   for (int i=1; i<=n; ++i){
      pf[i]=pf[i-1]*base+s[i];
   }
   for (int t=1; t<=n; ++t){
      map<Hash, int> mp;
      for (int r=t; r<=n; ++r){
         Hash h1=get(r-t+1, r);
         g[r][t]=mp.count(h1)?mp[h1]:-1;
         if (r-t+1>=t){
            Hash h2=get(r-t+1-t+1, r-t+1);
            mp[h2]=r-t+1;
         }
      }
   }
}

int count(int l, int r, int t){
   if (r-l+1<t) return 0;
   int pos=g[r][t];
   return count(l, pos, t)+1;
}

int dp(int l, int r){
   if (l>r) return 0;
   if (f[l][r]!=-1) return f[l][r];
   int res=dp(l, r-1)+add;
   for (int t=l; t<=r; ++t){
      int cnt=count(l, r, r-t+1);
      if (cnt!=1) res=min(res, dp(t, r)+cut+cnt*paste+add*(r-l+1-cnt*(r-t+1)));
   }
   return f[l][r]=res;
}

void solve(){
   memset(f, -1, sizeof f);
   cin >> n >> s;
   s=" "+s;
   precalc();
   cin >> add >> cut >> paste;
   cout << dp(1, n);
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   int ntests=1;
   // cin >> ntests;
   for (int i=1; i<=ntests; ++i) solve();
   return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 19 ms 51804 KB Output is correct
3 Correct 19 ms 51672 KB Output is correct
4 Correct 19 ms 51804 KB Output is correct
5 Correct 19 ms 51804 KB Output is correct
6 Correct 20 ms 51804 KB Output is correct
7 Correct 19 ms 51800 KB Output is correct
8 Correct 18 ms 51804 KB Output is correct
9 Correct 19 ms 51804 KB Output is correct
10 Correct 19 ms 51696 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51804 KB Output is correct
2 Correct 19 ms 51800 KB Output is correct
3 Execution timed out 3037 ms 72272 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 19 ms 51804 KB Output is correct
3 Correct 19 ms 51672 KB Output is correct
4 Correct 19 ms 51804 KB Output is correct
5 Correct 19 ms 51804 KB Output is correct
6 Correct 20 ms 51804 KB Output is correct
7 Correct 19 ms 51800 KB Output is correct
8 Correct 18 ms 51804 KB Output is correct
9 Correct 19 ms 51804 KB Output is correct
10 Correct 19 ms 51696 KB Output is correct
11 Correct 21 ms 51804 KB Output is correct
12 Correct 19 ms 51792 KB Output is correct
13 Correct 19 ms 51868 KB Output is correct
14 Correct 19 ms 51804 KB Output is correct
15 Correct 19 ms 51800 KB Output is correct
16 Correct 21 ms 52056 KB Output is correct
17 Correct 19 ms 51804 KB Output is correct
18 Correct 22 ms 51804 KB Output is correct
19 Correct 19 ms 51804 KB Output is correct
20 Correct 19 ms 51804 KB Output is correct
21 Correct 19 ms 51804 KB Output is correct
22 Correct 19 ms 51916 KB Output is correct
23 Correct 19 ms 51804 KB Output is correct
24 Correct 20 ms 51800 KB Output is correct
25 Correct 20 ms 51804 KB Output is correct
26 Correct 21 ms 51804 KB Output is correct
27 Correct 20 ms 52056 KB Output is correct
28 Correct 19 ms 51804 KB Output is correct
29 Correct 20 ms 51784 KB Output is correct
30 Correct 19 ms 51988 KB Output is correct
31 Correct 22 ms 51896 KB Output is correct
32 Correct 19 ms 51980 KB Output is correct
33 Correct 20 ms 51804 KB Output is correct
34 Correct 20 ms 51652 KB Output is correct
35 Correct 20 ms 51852 KB Output is correct
36 Correct 19 ms 51804 KB Output is correct
37 Correct 21 ms 51804 KB Output is correct
38 Correct 19 ms 51804 KB Output is correct
39 Correct 24 ms 51800 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 19 ms 51804 KB Output is correct
3 Correct 19 ms 51672 KB Output is correct
4 Correct 19 ms 51804 KB Output is correct
5 Correct 19 ms 51804 KB Output is correct
6 Correct 20 ms 51804 KB Output is correct
7 Correct 19 ms 51800 KB Output is correct
8 Correct 18 ms 51804 KB Output is correct
9 Correct 19 ms 51804 KB Output is correct
10 Correct 19 ms 51696 KB Output is correct
11 Correct 21 ms 51804 KB Output is correct
12 Correct 19 ms 51792 KB Output is correct
13 Correct 19 ms 51868 KB Output is correct
14 Correct 19 ms 51804 KB Output is correct
15 Correct 19 ms 51800 KB Output is correct
16 Correct 21 ms 52056 KB Output is correct
17 Correct 19 ms 51804 KB Output is correct
18 Correct 22 ms 51804 KB Output is correct
19 Correct 19 ms 51804 KB Output is correct
20 Correct 19 ms 51804 KB Output is correct
21 Correct 19 ms 51804 KB Output is correct
22 Correct 19 ms 51916 KB Output is correct
23 Correct 19 ms 51804 KB Output is correct
24 Correct 20 ms 51800 KB Output is correct
25 Correct 20 ms 51804 KB Output is correct
26 Correct 21 ms 51804 KB Output is correct
27 Correct 20 ms 52056 KB Output is correct
28 Correct 19 ms 51804 KB Output is correct
29 Correct 20 ms 51784 KB Output is correct
30 Correct 19 ms 51988 KB Output is correct
31 Correct 22 ms 51896 KB Output is correct
32 Correct 19 ms 51980 KB Output is correct
33 Correct 20 ms 51804 KB Output is correct
34 Correct 20 ms 51652 KB Output is correct
35 Correct 20 ms 51852 KB Output is correct
36 Correct 19 ms 51804 KB Output is correct
37 Correct 21 ms 51804 KB Output is correct
38 Correct 19 ms 51804 KB Output is correct
39 Correct 24 ms 51800 KB Output is correct
40 Correct 19 ms 52056 KB Output is correct
41 Correct 24 ms 52828 KB Output is correct
42 Correct 22 ms 52828 KB Output is correct
43 Correct 23 ms 52828 KB Output is correct
44 Correct 22 ms 52748 KB Output is correct
45 Correct 22 ms 52724 KB Output is correct
46 Correct 22 ms 52648 KB Output is correct
47 Correct 22 ms 52832 KB Output is correct
48 Correct 22 ms 52828 KB Output is correct
49 Correct 22 ms 52828 KB Output is correct
50 Correct 22 ms 52780 KB Output is correct
51 Correct 25 ms 52992 KB Output is correct
52 Correct 24 ms 52824 KB Output is correct
53 Correct 21 ms 52812 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 19 ms 51804 KB Output is correct
3 Correct 19 ms 51672 KB Output is correct
4 Correct 19 ms 51804 KB Output is correct
5 Correct 19 ms 51804 KB Output is correct
6 Correct 20 ms 51804 KB Output is correct
7 Correct 19 ms 51800 KB Output is correct
8 Correct 18 ms 51804 KB Output is correct
9 Correct 19 ms 51804 KB Output is correct
10 Correct 19 ms 51696 KB Output is correct
11 Correct 21 ms 51804 KB Output is correct
12 Correct 19 ms 51792 KB Output is correct
13 Correct 19 ms 51868 KB Output is correct
14 Correct 19 ms 51804 KB Output is correct
15 Correct 19 ms 51800 KB Output is correct
16 Correct 21 ms 52056 KB Output is correct
17 Correct 19 ms 51804 KB Output is correct
18 Correct 22 ms 51804 KB Output is correct
19 Correct 19 ms 51804 KB Output is correct
20 Correct 19 ms 51804 KB Output is correct
21 Correct 19 ms 51804 KB Output is correct
22 Correct 19 ms 51916 KB Output is correct
23 Correct 19 ms 51804 KB Output is correct
24 Correct 20 ms 51800 KB Output is correct
25 Correct 20 ms 51804 KB Output is correct
26 Correct 21 ms 51804 KB Output is correct
27 Correct 20 ms 52056 KB Output is correct
28 Correct 19 ms 51804 KB Output is correct
29 Correct 20 ms 51784 KB Output is correct
30 Correct 19 ms 51988 KB Output is correct
31 Correct 22 ms 51896 KB Output is correct
32 Correct 19 ms 51980 KB Output is correct
33 Correct 20 ms 51804 KB Output is correct
34 Correct 20 ms 51652 KB Output is correct
35 Correct 20 ms 51852 KB Output is correct
36 Correct 19 ms 51804 KB Output is correct
37 Correct 21 ms 51804 KB Output is correct
38 Correct 19 ms 51804 KB Output is correct
39 Correct 24 ms 51800 KB Output is correct
40 Correct 19 ms 52056 KB Output is correct
41 Correct 24 ms 52828 KB Output is correct
42 Correct 22 ms 52828 KB Output is correct
43 Correct 23 ms 52828 KB Output is correct
44 Correct 22 ms 52748 KB Output is correct
45 Correct 22 ms 52724 KB Output is correct
46 Correct 22 ms 52648 KB Output is correct
47 Correct 22 ms 52832 KB Output is correct
48 Correct 22 ms 52828 KB Output is correct
49 Correct 22 ms 52828 KB Output is correct
50 Correct 22 ms 52780 KB Output is correct
51 Correct 25 ms 52992 KB Output is correct
52 Correct 24 ms 52824 KB Output is correct
53 Correct 21 ms 52812 KB Output is correct
54 Correct 32 ms 54356 KB Output is correct
55 Correct 1043 ms 59892 KB Output is correct
56 Correct 89 ms 59724 KB Output is correct
57 Correct 88 ms 59732 KB Output is correct
58 Correct 87 ms 59728 KB Output is correct
59 Correct 87 ms 59728 KB Output is correct
60 Correct 87 ms 59728 KB Output is correct
61 Correct 139 ms 59916 KB Output is correct
62 Correct 588 ms 59908 KB Output is correct
63 Correct 114 ms 59924 KB Output is correct
64 Correct 115 ms 59724 KB Output is correct
65 Correct 248 ms 59800 KB Output is correct
66 Correct 273 ms 59916 KB Output is correct
67 Correct 93 ms 59736 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 51800 KB Output is correct
2 Correct 19 ms 51804 KB Output is correct
3 Correct 19 ms 51672 KB Output is correct
4 Correct 19 ms 51804 KB Output is correct
5 Correct 19 ms 51804 KB Output is correct
6 Correct 20 ms 51804 KB Output is correct
7 Correct 19 ms 51800 KB Output is correct
8 Correct 18 ms 51804 KB Output is correct
9 Correct 19 ms 51804 KB Output is correct
10 Correct 19 ms 51696 KB Output is correct
11 Correct 19 ms 51804 KB Output is correct
12 Correct 19 ms 51800 KB Output is correct
13 Execution timed out 3037 ms 72272 KB Time limit exceeded
14 Halted 0 ms 0 KB -