oj.uz

답안 #714355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714355 2023-03-24T09:29:06 Z 089487 Copy and Paste 3 (JOI22_copypaste3) C++14
62 / 100
 3000 ms 152028 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=25e2+7;
const int INF=1e18;
const int p=29;
pii operator + (pii a, int b){
	return mp(a.F+b,a.S+b);
}
pii operator + (pii a,pii b){
	return mp(a.F+b.F,a.S+b.S);
}
pii operator % (pii a,pii b){
	return mp(a.F%b.F,a.S%b.S);
}
pii operator - (pii a,pii b){
	return mp(a.F-b.F,a.S-b.S);
}
pii operator * (pii a,int b){
	return mp(a.F*b,a.S*b);
}
pii operator * (pii a,pii b){
	return mp(a.F*b.F,a.S*b.S);
}
const pair<int,int> Mod=mp(1234567891,998244353);
pii pref[N];
pii px[N];
int dp[N][N];
string s;
void build(int n){
	mt19937 rand(time(0));
	px[0]=mp(1,1);
	rep(i,1,n){
		px[i]=px[i-1]*p%Mod;
		pref[i]=pref[i-1]*p%Mod+(s[i-1]-'a'+2);
	}
}
pii q(int l,int r){
	return (pref[r]-pref[l-1]*px[r-l+1]%Mod+Mod)%Mod;
}
int nxt[N];
signed main(){
	quick

	int n;
	cin>>n;
	cin>>s;
	build(n);
	int a,b,c;
	cin>>a>>b>>c;
	map<pii,vector<int> > mx;
	rep(i,1,n){
		rep(j,i,n){
			dp[i][j]=(j-i+1)*a;
			mx[q(i,j)].eb(i);
		}
	}
	rep(L,1,n){
		fill(nxt,nxt+n+1,-1);
		map<pii,bool> vis;
		rep(l,1,n-L+1){
			int r=l+L-1;
			pii qx=q(l,r);
			int n2=sz(mx[qx]);
			if(l<r) dp[l][r]=min({dp[l][r],dp[l][r-1]+a,dp[l+1][r]+a});
			if(!vis[qx]&&n2!=1){
				int _r=0;
				rep(i,0,n2-2){
					while(_r<n2&&mx[qx][_r]<=mx[qx][i]+L-1) _r++;
					nxt[mx[qx][i]]=(_r>=n2 ? -1 : mx[qx][_r]);
				}
				vis[qx]=true;
			}
			int px=nxt[l];
			int pst=1;
			while(px!=-1){
				dp[l][px+L-1]=min(dp[l][px+L-1],(px-l-pst*L)*a+pst*c+b+c+dp[l][r]);
				pst++;
				px=nxt[px];
			}
		}
	}
	cout<<dp[1][n]<<"\n";
	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
3 Correct 395 ms 38832 KB Output is correct
4 Correct 467 ms 43844 KB Output is correct
5 Correct 583 ms 51264 KB Output is correct
6 Correct 614 ms 58836 KB Output is correct
7 Correct 765 ms 68040 KB Output is correct
8 Correct 780 ms 68080 KB Output is correct
9 Correct 828 ms 68100 KB Output is correct
10 Correct 1 ms 340 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 1 ms 340 KB Output is correct
16 Correct 1 ms 468 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 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 1 ms 468 KB Output is correct
26 Correct 1 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 340 KB Output is correct
35 Correct 0 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 0 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 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 1 ms 468 KB Output is correct
26 Correct 1 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 340 KB Output is correct
35 Correct 0 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 0 ms 340 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 3 ms 1492 KB Output is correct
42 Correct 16 ms 3284 KB Output is correct
43 Correct 13 ms 3384 KB Output is correct
44 Correct 20 ms 3392 KB Output is correct
45 Correct 16 ms 3488 KB Output is correct
46 Correct 14 ms 3464 KB Output is correct
47 Correct 12 ms 2004 KB Output is correct
48 Correct 16 ms 2644 KB Output is correct
49 Correct 15 ms 2920 KB Output is correct
50 Correct 14 ms 2852 KB Output is correct
51 Correct 15 ms 2584 KB Output is correct
52 Correct 13 ms 2588 KB Output is correct
53 Correct 12 ms 3412 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 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 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 1 ms 468 KB Output is correct
26 Correct 1 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 340 KB Output is correct
35 Correct 0 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 0 ms 340 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 3 ms 1492 KB Output is correct
42 Correct 16 ms 3284 KB Output is correct
43 Correct 13 ms 3384 KB Output is correct
44 Correct 20 ms 3392 KB Output is correct
45 Correct 16 ms 3488 KB Output is correct
46 Correct 14 ms 3464 KB Output is correct
47 Correct 12 ms 2004 KB Output is correct
48 Correct 16 ms 2644 KB Output is correct
49 Correct 15 ms 2920 KB Output is correct
50 Correct 14 ms 2852 KB Output is correct
51 Correct 15 ms 2584 KB Output is correct
52 Correct 13 ms 2588 KB Output is correct
53 Correct 12 ms 3412 KB Output is correct
54 Correct 130 ms 13572 KB Output is correct
55 Correct 117 ms 13764 KB Output is correct
56 Correct 920 ms 62312 KB Output is correct
57 Correct 915 ms 62748 KB Output is correct
58 Correct 975 ms 62896 KB Output is correct
59 Correct 954 ms 63060 KB Output is correct
60 Correct 1002 ms 63084 KB Output is correct
61 Correct 796 ms 36132 KB Output is correct
62 Correct 123 ms 14532 KB Output is correct
63 Correct 876 ms 49728 KB Output is correct
64 Correct 801 ms 50672 KB Output is correct
65 Correct 810 ms 37360 KB Output is correct
66 Correct 872 ms 37364 KB Output is correct
67 Correct 1072 ms 63052 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 395 ms 38832 KB Output is correct
14 Correct 467 ms 43844 KB Output is correct
15 Correct 583 ms 51264 KB Output is correct
16 Correct 614 ms 58836 KB Output is correct
17 Correct 765 ms 68040 KB Output is correct
18 Correct 780 ms 68080 KB Output is correct
19 Correct 828 ms 68100 KB Output is correct
20 Correct 1 ms 340 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 1 ms 340 KB Output is correct
26 Correct 1 ms 468 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 0 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 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 2 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 1 ms 468 KB Output is correct
43 Correct 1 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 340 KB Output is correct
52 Correct 0 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 0 ms 340 KB Output is correct
56 Correct 0 ms 468 KB Output is correct
57 Correct 2 ms 980 KB Output is correct
58 Correct 3 ms 1492 KB Output is correct
59 Correct 16 ms 3284 KB Output is correct
60 Correct 13 ms 3384 KB Output is correct
61 Correct 20 ms 3392 KB Output is correct
62 Correct 16 ms 3488 KB Output is correct
63 Correct 14 ms 3464 KB Output is correct
64 Correct 12 ms 2004 KB Output is correct
65 Correct 16 ms 2644 KB Output is correct
66 Correct 15 ms 2920 KB Output is correct
67 Correct 14 ms 2852 KB Output is correct
68 Correct 15 ms 2584 KB Output is correct
69 Correct 13 ms 2588 KB Output is correct
70 Correct 12 ms 3412 KB Output is correct
71 Correct 130 ms 13572 KB Output is correct
72 Correct 117 ms 13764 KB Output is correct
73 Correct 920 ms 62312 KB Output is correct
74 Correct 915 ms 62748 KB Output is correct
75 Correct 975 ms 62896 KB Output is correct
76 Correct 954 ms 63060 KB Output is correct
77 Correct 1002 ms 63084 KB Output is correct
78 Correct 796 ms 36132 KB Output is correct
79 Correct 123 ms 14532 KB Output is correct
80 Correct 876 ms 49728 KB Output is correct
81 Correct 801 ms 50672 KB Output is correct
82 Correct 810 ms 37360 KB Output is correct
83 Correct 872 ms 37364 KB Output is correct
84 Correct 1072 ms 63052 KB Output is correct
85 Execution timed out 3025 ms 152028 KB Time limit exceeded
86 Halted 0 ms 0 KB -