oj.uz

Submission #1076566

# Submission time Handle Problem Language Result Execution time Memory
1076566 2024-08-26T14:46:32 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
Compilation error
 0 ms 0 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()

const ll N = 3000;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll block = 350;
ll n,a,b,c;
string s;
vector<int> z_function(string s) {
    ll n = s.length();
    vector<int> z(n);
    ll l = 0, r = 0;
    for (int i = 0; i < n; ++i) {
        if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
        while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
        if (i + z[i] - 1 > r) {
            l = i;
            r = i + z[i] - 1;
        } 
    }
    return z;
}
struct ccjv{int l,r,cnt;};
int st[N][13];
ll dp[N][N];
vector<ccjv>adj[N][N];
ll get(ll l, ll r){
	ll p = 31 - __builtin_clz(r - l + 1);
	return max(st[l][p], st[r - (1 << p) + 1][p]);
}
void to_thic_cau(){ 
	cin >> n >> s >> a >> b >> c;
	s = " " + s;
	for(ll i = 1; i <= n;i++){
		for(ll j = 1; j <= n;j++) dp[i][j] = (j - i + 1) * a;
	}
	for(int i = 1; i <= n;i++){
		string t;
		for(int j = i; j <= n;j++) t += s[j];
		vector<int>z = z_function(t);
		ll sz = (ll)t.size() - 1;
		for(int i = 0; i <= sz;i++) st[i][0] = z[i];
		for(int j = 1; j <= 12;j++){
			for(int i = 0; i + (1 << j) <= sz + 1;i++) st[i][j] = max(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
		}
		for(int len = 1; len <= sz;len++){
			ll cnt = 0, idx = -1, fir = -1;
			while(1){
				ll l = idx + 1, r = sz, pos = -1;
				while(l <= r){
					ll mid = (l + r) / 2;
					if(get(idx + 1, mid) >= len) pos = mid, r = mid - 1;
					else l = mid + 1;
				}
				if(pos == -1) break;
				if(fir == -1) fir = pos;
				idx = pos + len - 1, cnt++;
				adj[fir + i][idx + i].pb({fir + i, fir + len - 1 + i, cnt});
			}
		}
	}
	for(int len = 0; len <= n;len++){
		for(ll i = 1; i + len <= n;i++){
			ll j = i + len;
			for(auto x : adj[i][j]){
				ll l = x.l, r = x.r, cnt = x.cnt;
				if(l == i && r == j) continue;
				dp[i][j] = min(dp[i][j], ((j - i + 1) - (r - l + 1) * cnt) * a + b + dp[l][r] + c * cnt);
			}
			if(i - 1 >= 0) dp[i-1][j] = min(dp[i-1][j], dp[i][j] + a);
			if(j + 1 <= n) dp[i][j+1] = min(dp[i][j+1], dp[i][j] + a);
		}
	}
	cout << dp[1][n] << "\n";
}     

signed main()   
{  
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Compilation message

copypaste3.cpp: In function 'std::vector<int> z_function(std::string)':
copypaste3.cpp:23:57: error: no matching function for call to 'min(long long int, __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   23 |         if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
      |                                                         ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from copypaste3.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
copypaste3.cpp:23:57: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   23 |         if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
      |                                                         ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from copypaste3.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
copypaste3.cpp:23:57: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   23 |         if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
      |                                                         ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from copypaste3.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
copypaste3.cpp:23:57: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   23 |         if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
      |                                                         ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from copypaste3.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
copypaste3.cpp:23:57: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   23 |         if (i <= r) z[i] = min(r - i * 1ll + 1, z[i - l]);
      |                                                         ^
copypaste3.cpp: In function 'void to_thic_cau()':
copypaste3.cpp:67:35: warning: narrowing conversion of '(fir + ((long long int)i))' from 'long long int' to 'int' [-Wnarrowing]
   67 |     adj[fir + i][idx + i].pb({fir + i, fir + len - 1 + i, cnt});
      |                               ~~~~^~~
copypaste3.cpp:67:54: warning: narrowing conversion of '(((fir + ((long long int)len)) - 1) + ((long long int)i))' from 'long long int' to 'int' [-Wnarrowing]
   67 |     adj[fir + i][idx + i].pb({fir + i, fir + len - 1 + i, cnt});
      |                                        ~~~~~~~~~~~~~~^~~
copypaste3.cpp:67:59: warning: narrowing conversion of 'cnt' from 'long long int' to 'int' [-Wnarrowing]
   67 |     adj[fir + i][idx + i].pb({fir + i, fir + len - 1 + i, cnt});
      |                                                           ^~~