oj.uz

Submission #567816

# Submission time Handle Problem Language Result Execution time Memory
567816 2022-05-24T08:43:28 Z jamezzz Copy and Paste 3 (JOI22_copypaste3) C++17
25 / 100
 3000 ms 1687896 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#define getchar_unlocked getchar
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

#define mod 1000000007
#define mod2 1000000009

inline int add(int a,int b){
	int r=a+b;
	while(r>=mod)r-=mod;
	while(r<0)r+=mod;
	return r;
}

inline int mult(int a,int b){
	return (int)(((ll)(a*b))%mod);
}

inline int rd(){
	int x=0;
	char ch=getchar_unlocked();
	while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
    while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
		x=(x<<3)+(x<<1)+(ch&15);
		ch=getchar_unlocked();
	}
	return x;
}

int n,a,b,c,cnt;
char s[2505];
int hh[2505][2505],num[2505*2505];
map<ii,int> mp;
vector<ii> v[2505*2505];
vector<int> pos[2505];
ll memo[2505][2505];
unordered_map<int,int> vis[2505][2505];

ll dp(int l,int r){
	if(l==r)return a;
	if(memo[l][r]!=-1)return memo[l][r];
	ll ans=(ll)(r-l+1)*a;
	for(int i=l;i<=r;++i){
		for(int &j:pos[i]){
			if(j>r)break;
			int x=hh[i][j];
			if(vis[l][r][x]!=0)continue;
			vis[l][r][x]=1;
			int far=l-1,cnt=0;
			for(ii &pr:v[x]){
				if(pr.se>r)break;
				if(far<pr.fi&&pr.se<=r){
					++cnt;
					far=pr.se;
				}
			}
			if(cnt==1)continue;
			ans=min(ans,dp(v[x][0].fi,v[x][0].se)+b+(ll)cnt*c+(ll)(r-l+1-cnt*(j-i+1))*a);
		}
	}
	return memo[l][r]=ans;
}

int main(){
	sf("%d",&n);
	sf(" %s",&s);
	sf("%d%d%d",&a,&b,&c);
	for(int i=0;i<n;++i){
		ll cur=0,cur2=0;
		ll pw=1,pw2=1;
		for(int j=i;j<n;++j){
			cur+=pw*(s[j]-'a'+1);
			cur2+=pw2*(s[j]-'a'+1);
			cur%=mod;
			cur2%=mod2;
			pw*=31;pw%=mod;
			pw2*=31;pw2%=mod2;
			ii pr=ii((int)cur,(int)cur2);
			if(!mp.count(pr)){
				mp[pr]=cnt++;
			}
			hh[i][j]=mp[pr];
			v[hh[i][j]].pb({i,j});
		}
	}
	
	for(int i=n-1;i>=0;--i){
		for(int j=i;j<n;++j){
			if(num[hh[i][j]]!=0)pos[i].pb(j);
			++num[hh[i][j]];
		}
	}
	
	memset(memo,-1,sizeof memo);
	pf("%lld\n",dp(0,n-1));
}

Compilation message

copypaste3.cpp: In function 'int main()':
copypaste3.cpp:94:8: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[2505]' [-Wformat=]
   94 |  sf(" %s",&s);
      |       ~^  ~~
      |        |  |
      |        |  char (*)[2505]
      |        char*
copypaste3.cpp:93:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |  sf("%d",&n);
      |    ^
copypaste3.cpp:94:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |  sf(" %s",&s);
      |    ^
copypaste3.cpp:95:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |  sf("%d%d%d",&a,&b,&c);
      |    ^

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 540620 KB Output is correct
2 Correct 266 ms 540676 KB Output is correct
3 Correct 289 ms 540572 KB Output is correct
4 Correct 280 ms 540656 KB Output is correct
5 Correct 272 ms 540756 KB Output is correct
6 Correct 289 ms 540572 KB Output is correct
7 Correct 274 ms 540692 KB Output is correct
8 Correct 272 ms 540780 KB Output is correct
9 Correct 286 ms 540684 KB Output is correct
10 Correct 267 ms 540696 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 540652 KB Output is correct
2 Correct 262 ms 540700 KB Output is correct
3 Correct 1608 ms 599528 KB Output is correct
4 Correct 1861 ms 607840 KB Output is correct
5 Correct 2308 ms 618164 KB Output is correct
6 Correct 2876 ms 630232 KB Output is correct
7 Execution timed out 3086 ms 643336 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 540620 KB Output is correct
2 Correct 266 ms 540676 KB Output is correct
3 Correct 289 ms 540572 KB Output is correct
4 Correct 280 ms 540656 KB Output is correct
5 Correct 272 ms 540756 KB Output is correct
6 Correct 289 ms 540572 KB Output is correct
7 Correct 274 ms 540692 KB Output is correct
8 Correct 272 ms 540780 KB Output is correct
9 Correct 286 ms 540684 KB Output is correct
10 Correct 267 ms 540696 KB Output is correct
11 Correct 278 ms 540728 KB Output is correct
12 Correct 284 ms 540672 KB Output is correct
13 Correct 274 ms 540764 KB Output is correct
14 Correct 274 ms 540688 KB Output is correct
15 Correct 266 ms 540732 KB Output is correct
16 Correct 284 ms 540668 KB Output is correct
17 Correct 295 ms 540628 KB Output is correct
18 Correct 293 ms 540664 KB Output is correct
19 Correct 293 ms 540736 KB Output is correct
20 Correct 278 ms 540936 KB Output is correct
21 Correct 275 ms 540816 KB Output is correct
22 Correct 295 ms 540844 KB Output is correct
23 Correct 286 ms 540844 KB Output is correct
24 Correct 282 ms 540836 KB Output is correct
25 Correct 283 ms 540936 KB Output is correct
26 Correct 309 ms 540788 KB Output is correct
27 Correct 286 ms 540864 KB Output is correct
28 Correct 286 ms 540736 KB Output is correct
29 Correct 279 ms 540864 KB Output is correct
30 Correct 285 ms 540848 KB Output is correct
31 Correct 302 ms 540848 KB Output is correct
32 Correct 322 ms 540796 KB Output is correct
33 Correct 308 ms 540840 KB Output is correct
34 Correct 283 ms 540576 KB Output is correct
35 Correct 284 ms 540796 KB Output is correct
36 Correct 276 ms 540620 KB Output is correct
37 Correct 279 ms 540716 KB Output is correct
38 Correct 277 ms 540732 KB Output is correct
39 Correct 278 ms 540820 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 540620 KB Output is correct
2 Correct 266 ms 540676 KB Output is correct
3 Correct 289 ms 540572 KB Output is correct
4 Correct 280 ms 540656 KB Output is correct
5 Correct 272 ms 540756 KB Output is correct
6 Correct 289 ms 540572 KB Output is correct
7 Correct 274 ms 540692 KB Output is correct
8 Correct 272 ms 540780 KB Output is correct
9 Correct 286 ms 540684 KB Output is correct
10 Correct 267 ms 540696 KB Output is correct
11 Correct 278 ms 540728 KB Output is correct
12 Correct 284 ms 540672 KB Output is correct
13 Correct 274 ms 540764 KB Output is correct
14 Correct 274 ms 540688 KB Output is correct
15 Correct 266 ms 540732 KB Output is correct
16 Correct 284 ms 540668 KB Output is correct
17 Correct 295 ms 540628 KB Output is correct
18 Correct 293 ms 540664 KB Output is correct
19 Correct 293 ms 540736 KB Output is correct
20 Correct 278 ms 540936 KB Output is correct
21 Correct 275 ms 540816 KB Output is correct
22 Correct 295 ms 540844 KB Output is correct
23 Correct 286 ms 540844 KB Output is correct
24 Correct 282 ms 540836 KB Output is correct
25 Correct 283 ms 540936 KB Output is correct
26 Correct 309 ms 540788 KB Output is correct
27 Correct 286 ms 540864 KB Output is correct
28 Correct 286 ms 540736 KB Output is correct
29 Correct 279 ms 540864 KB Output is correct
30 Correct 285 ms 540848 KB Output is correct
31 Correct 302 ms 540848 KB Output is correct
32 Correct 322 ms 540796 KB Output is correct
33 Correct 308 ms 540840 KB Output is correct
34 Correct 283 ms 540576 KB Output is correct
35 Correct 284 ms 540796 KB Output is correct
36 Correct 276 ms 540620 KB Output is correct
37 Correct 279 ms 540716 KB Output is correct
38 Correct 277 ms 540732 KB Output is correct
39 Correct 278 ms 540820 KB Output is correct
40 Correct 280 ms 541416 KB Output is correct
41 Correct 272 ms 542132 KB Output is correct
42 Correct 318 ms 543628 KB Output is correct
43 Correct 333 ms 543556 KB Output is correct
44 Correct 292 ms 543524 KB Output is correct
45 Correct 319 ms 543472 KB Output is correct
46 Correct 295 ms 543448 KB Output is correct
47 Correct 478 ms 621560 KB Output is correct
48 Correct 819 ms 720484 KB Output is correct
49 Correct 552 ms 665944 KB Output is correct
50 Correct 563 ms 646044 KB Output is correct
51 Correct 655 ms 659988 KB Output is correct
52 Correct 630 ms 662948 KB Output is correct
53 Correct 302 ms 543520 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 540620 KB Output is correct
2 Correct 266 ms 540676 KB Output is correct
3 Correct 289 ms 540572 KB Output is correct
4 Correct 280 ms 540656 KB Output is correct
5 Correct 272 ms 540756 KB Output is correct
6 Correct 289 ms 540572 KB Output is correct
7 Correct 274 ms 540692 KB Output is correct
8 Correct 272 ms 540780 KB Output is correct
9 Correct 286 ms 540684 KB Output is correct
10 Correct 267 ms 540696 KB Output is correct
11 Correct 278 ms 540728 KB Output is correct
12 Correct 284 ms 540672 KB Output is correct
13 Correct 274 ms 540764 KB Output is correct
14 Correct 274 ms 540688 KB Output is correct
15 Correct 266 ms 540732 KB Output is correct
16 Correct 284 ms 540668 KB Output is correct
17 Correct 295 ms 540628 KB Output is correct
18 Correct 293 ms 540664 KB Output is correct
19 Correct 293 ms 540736 KB Output is correct
20 Correct 278 ms 540936 KB Output is correct
21 Correct 275 ms 540816 KB Output is correct
22 Correct 295 ms 540844 KB Output is correct
23 Correct 286 ms 540844 KB Output is correct
24 Correct 282 ms 540836 KB Output is correct
25 Correct 283 ms 540936 KB Output is correct
26 Correct 309 ms 540788 KB Output is correct
27 Correct 286 ms 540864 KB Output is correct
28 Correct 286 ms 540736 KB Output is correct
29 Correct 279 ms 540864 KB Output is correct
30 Correct 285 ms 540848 KB Output is correct
31 Correct 302 ms 540848 KB Output is correct
32 Correct 322 ms 540796 KB Output is correct
33 Correct 308 ms 540840 KB Output is correct
34 Correct 283 ms 540576 KB Output is correct
35 Correct 284 ms 540796 KB Output is correct
36 Correct 276 ms 540620 KB Output is correct
37 Correct 279 ms 540716 KB Output is correct
38 Correct 277 ms 540732 KB Output is correct
39 Correct 278 ms 540820 KB Output is correct
40 Correct 280 ms 541416 KB Output is correct
41 Correct 272 ms 542132 KB Output is correct
42 Correct 318 ms 543628 KB Output is correct
43 Correct 333 ms 543556 KB Output is correct
44 Correct 292 ms 543524 KB Output is correct
45 Correct 319 ms 543472 KB Output is correct
46 Correct 295 ms 543448 KB Output is correct
47 Correct 478 ms 621560 KB Output is correct
48 Correct 819 ms 720484 KB Output is correct
49 Correct 552 ms 665944 KB Output is correct
50 Correct 563 ms 646044 KB Output is correct
51 Correct 655 ms 659988 KB Output is correct
52 Correct 630 ms 662948 KB Output is correct
53 Correct 302 ms 543520 KB Output is correct
54 Correct 430 ms 553012 KB Output is correct
55 Correct 622 ms 560016 KB Output is correct
56 Correct 1074 ms 597152 KB Output is correct
57 Correct 1112 ms 595860 KB Output is correct
58 Correct 1152 ms 595568 KB Output is correct
59 Correct 1117 ms 595492 KB Output is correct
60 Correct 1108 ms 595596 KB Output is correct
61 Execution timed out 3181 ms 1687896 KB Time limit exceeded
62 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 540620 KB Output is correct
2 Correct 266 ms 540676 KB Output is correct
3 Correct 289 ms 540572 KB Output is correct
4 Correct 280 ms 540656 KB Output is correct
5 Correct 272 ms 540756 KB Output is correct
6 Correct 289 ms 540572 KB Output is correct
7 Correct 274 ms 540692 KB Output is correct
8 Correct 272 ms 540780 KB Output is correct
9 Correct 286 ms 540684 KB Output is correct
10 Correct 267 ms 540696 KB Output is correct
11 Correct 334 ms 540652 KB Output is correct
12 Correct 262 ms 540700 KB Output is correct
13 Correct 1608 ms 599528 KB Output is correct
14 Correct 1861 ms 607840 KB Output is correct
15 Correct 2308 ms 618164 KB Output is correct
16 Correct 2876 ms 630232 KB Output is correct
17 Execution timed out 3086 ms 643336 KB Time limit exceeded
18 Halted 0 ms 0 KB -