oj.uz

Submission #735194

# Submission time Handle Problem Language Result Execution time Memory
735194 2023-05-03T16:54:38 Z Sam_a17 Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 1649 ms 371656 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2605;
const long long inf = 1e15;
long long a, b, c, dp[N][N], nxt[N];
int n;
string s;

const long long mod = 1e9 + 7;
long long h1[N], h2[N];
long long pw1[N], pw2[N];
 
long long compute1(int l, int r) {
  return (h1[l] - (pw1[r - l + 1] * h1[r + 1]) % mod + mod) % mod;
}
 
long long compute2(int l, int r) {
  return (h2[l] - (pw2[r - l + 1] * h2[r + 1]) % mod + mod) % mod;
}

pair<long long, long long> add(int l, int r) {
  l--, r--;
  pair<long long, long long> par;
  par.first = compute1(l, r);
  par.second = compute2(l, r);
  return par;
}

struct hash_pair {
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const
    {
        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);
 
        if (hash1 != hash2) {
            return hash1 ^ hash2;             
        }
         
        // If hash1 == hash2, their XOR is zero.
        return hash1;
    }
};

unordered_map<pair<long long, long long>, vector<int>, hash_pair> mp;

void solve_() {
  cin >> n >> s;
  cin >> a >> b >> c;

  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= n; j++) {
      dp[i][j] = inf;
    }
  }

  mp.reserve((N * N) / 2);

  //
  for(int i = n - 1; i >= 0; i--) {
    h1[i] = ((h1[i + 1] * 37ll) % mod + s[i] - 'a' + 1) % mod; 
    h2[i] = ((h2[i + 1] * 29ll) % mod + s[i] - 'a' + 1) % mod; 
  }

  pw1[0] = pw2[0] = 1;
  for(int i = 1; i <= n; i++) {
    pw1[i] = (pw1[i - 1] * 37ll) % mod;
    pw2[i] = (pw2[i - 1] * 29ll) % mod; 
  }

  for(int len = 1; len <= n; len++) {
    for(int l = 1; l + len - 1 <= n; l++) {
      int r = l + len - 1;
      nxt[l] = n + 1;
      mp[add(l, r)].push_back(l);

      if(len == 1) {
        dp[l][r] = a;
      } else {
        dp[l][r] = min(dp[l][r], dp[l][r - 1] + a);
        dp[l][r] = min(dp[l][r], dp[l + 1][r] + a);
      }
    }

    for(int l = n - len + 1; l >= 1; l--) {
      int r = l + len - 1;
      auto pr = add(l, r);
      auto it = lower_bound(all(mp[pr]), r + 1);
      if(it != mp[pr].end()) {
        nxt[l] = *it;
      }


      int li = l;
      long long pp = dp[l][r], cnt = 1;

      while(r <= n) {
        dp[l][r] = min(dp[l][r], pp + cnt * c + b + (r - l + 1 - cnt * len) * a);
        li = nxt[li];
        r = li + len - 1;
        cnt++;  
      }
    }

    for(int l = 1; l + len - 1 <= n; l++) {
      int r = l + len - 1;
      mp[add(l, r)].clear();
    }
  }

  assert(dp[1][n] >= 0);
  cout << dp[1][n] << '\n';
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

copypaste3.cpp: In function 'void setIO(std::string)':
copypaste3.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
copypaste3.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27220 KB Output is correct
2 Correct 15 ms 27196 KB Output is correct
3 Correct 15 ms 27220 KB Output is correct
4 Correct 16 ms 27348 KB Output is correct
5 Correct 16 ms 27220 KB Output is correct
6 Correct 15 ms 27188 KB Output is correct
7 Correct 15 ms 27220 KB Output is correct
8 Correct 14 ms 27228 KB Output is correct
9 Correct 14 ms 27220 KB Output is correct
10 Correct 14 ms 27276 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27348 KB Output is correct
2 Correct 14 ms 27184 KB Output is correct
3 Correct 314 ms 70024 KB Output is correct
4 Correct 392 ms 76380 KB Output is correct
5 Correct 428 ms 83056 KB Output is correct
6 Correct 499 ms 88816 KB Output is correct
7 Correct 660 ms 95172 KB Output is correct
8 Correct 632 ms 95312 KB Output is correct
9 Correct 605 ms 95292 KB Output is correct
10 Correct 14 ms 27252 KB Output is correct
11 Correct 16 ms 27192 KB Output is correct
12 Correct 15 ms 27236 KB Output is correct
13 Correct 14 ms 27288 KB Output is correct
14 Correct 17 ms 27272 KB Output is correct
15 Correct 16 ms 27220 KB Output is correct
16 Correct 15 ms 27380 KB Output is correct
17 Correct 14 ms 27220 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27220 KB Output is correct
2 Correct 15 ms 27196 KB Output is correct
3 Correct 15 ms 27220 KB Output is correct
4 Correct 16 ms 27348 KB Output is correct
5 Correct 16 ms 27220 KB Output is correct
6 Correct 15 ms 27188 KB Output is correct
7 Correct 15 ms 27220 KB Output is correct
8 Correct 14 ms 27228 KB Output is correct
9 Correct 14 ms 27220 KB Output is correct
10 Correct 14 ms 27276 KB Output is correct
11 Correct 16 ms 27348 KB Output is correct
12 Correct 14 ms 27356 KB Output is correct
13 Correct 17 ms 27328 KB Output is correct
14 Correct 14 ms 27220 KB Output is correct
15 Correct 16 ms 27340 KB Output is correct
16 Correct 19 ms 27220 KB Output is correct
17 Correct 18 ms 27236 KB Output is correct
18 Correct 16 ms 27252 KB Output is correct
19 Correct 15 ms 27256 KB Output is correct
20 Correct 15 ms 27232 KB Output is correct
21 Correct 15 ms 27388 KB Output is correct
22 Correct 16 ms 27352 KB Output is correct
23 Correct 15 ms 27348 KB Output is correct
24 Correct 19 ms 27328 KB Output is correct
25 Correct 15 ms 27348 KB Output is correct
26 Correct 15 ms 27348 KB Output is correct
27 Correct 15 ms 27348 KB Output is correct
28 Correct 16 ms 27348 KB Output is correct
29 Correct 18 ms 27420 KB Output is correct
30 Correct 15 ms 27348 KB Output is correct
31 Correct 16 ms 27380 KB Output is correct
32 Correct 15 ms 27424 KB Output is correct
33 Correct 15 ms 27348 KB Output is correct
34 Correct 15 ms 27280 KB Output is correct
35 Correct 14 ms 27224 KB Output is correct
36 Correct 15 ms 27220 KB Output is correct
37 Correct 15 ms 27220 KB Output is correct
38 Correct 19 ms 27216 KB Output is correct
39 Correct 18 ms 27348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27220 KB Output is correct
2 Correct 15 ms 27196 KB Output is correct
3 Correct 15 ms 27220 KB Output is correct
4 Correct 16 ms 27348 KB Output is correct
5 Correct 16 ms 27220 KB Output is correct
6 Correct 15 ms 27188 KB Output is correct
7 Correct 15 ms 27220 KB Output is correct
8 Correct 14 ms 27228 KB Output is correct
9 Correct 14 ms 27220 KB Output is correct
10 Correct 14 ms 27276 KB Output is correct
11 Correct 16 ms 27348 KB Output is correct
12 Correct 14 ms 27356 KB Output is correct
13 Correct 17 ms 27328 KB Output is correct
14 Correct 14 ms 27220 KB Output is correct
15 Correct 16 ms 27340 KB Output is correct
16 Correct 19 ms 27220 KB Output is correct
17 Correct 18 ms 27236 KB Output is correct
18 Correct 16 ms 27252 KB Output is correct
19 Correct 15 ms 27256 KB Output is correct
20 Correct 15 ms 27232 KB Output is correct
21 Correct 15 ms 27388 KB Output is correct
22 Correct 16 ms 27352 KB Output is correct
23 Correct 15 ms 27348 KB Output is correct
24 Correct 19 ms 27328 KB Output is correct
25 Correct 15 ms 27348 KB Output is correct
26 Correct 15 ms 27348 KB Output is correct
27 Correct 15 ms 27348 KB Output is correct
28 Correct 16 ms 27348 KB Output is correct
29 Correct 18 ms 27420 KB Output is correct
30 Correct 15 ms 27348 KB Output is correct
31 Correct 16 ms 27380 KB Output is correct
32 Correct 15 ms 27424 KB Output is correct
33 Correct 15 ms 27348 KB Output is correct
34 Correct 15 ms 27280 KB Output is correct
35 Correct 14 ms 27224 KB Output is correct
36 Correct 15 ms 27220 KB Output is correct
37 Correct 15 ms 27220 KB Output is correct
38 Correct 19 ms 27216 KB Output is correct
39 Correct 18 ms 27348 KB Output is correct
40 Correct 17 ms 27988 KB Output is correct
41 Correct 20 ms 28448 KB Output is correct
42 Correct 22 ms 30088 KB Output is correct
43 Correct 20 ms 30116 KB Output is correct
44 Correct 20 ms 30152 KB Output is correct
45 Correct 21 ms 30192 KB Output is correct
46 Correct 20 ms 30160 KB Output is correct
47 Correct 18 ms 28756 KB Output is correct
48 Correct 22 ms 29460 KB Output is correct
49 Correct 25 ms 29652 KB Output is correct
50 Correct 20 ms 29760 KB Output is correct
51 Correct 19 ms 29396 KB Output is correct
52 Correct 20 ms 29296 KB Output is correct
53 Correct 20 ms 30164 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27220 KB Output is correct
2 Correct 15 ms 27196 KB Output is correct
3 Correct 15 ms 27220 KB Output is correct
4 Correct 16 ms 27348 KB Output is correct
5 Correct 16 ms 27220 KB Output is correct
6 Correct 15 ms 27188 KB Output is correct
7 Correct 15 ms 27220 KB Output is correct
8 Correct 14 ms 27228 KB Output is correct
9 Correct 14 ms 27220 KB Output is correct
10 Correct 14 ms 27276 KB Output is correct
11 Correct 16 ms 27348 KB Output is correct
12 Correct 14 ms 27356 KB Output is correct
13 Correct 17 ms 27328 KB Output is correct
14 Correct 14 ms 27220 KB Output is correct
15 Correct 16 ms 27340 KB Output is correct
16 Correct 19 ms 27220 KB Output is correct
17 Correct 18 ms 27236 KB Output is correct
18 Correct 16 ms 27252 KB Output is correct
19 Correct 15 ms 27256 KB Output is correct
20 Correct 15 ms 27232 KB Output is correct
21 Correct 15 ms 27388 KB Output is correct
22 Correct 16 ms 27352 KB Output is correct
23 Correct 15 ms 27348 KB Output is correct
24 Correct 19 ms 27328 KB Output is correct
25 Correct 15 ms 27348 KB Output is correct
26 Correct 15 ms 27348 KB Output is correct
27 Correct 15 ms 27348 KB Output is correct
28 Correct 16 ms 27348 KB Output is correct
29 Correct 18 ms 27420 KB Output is correct
30 Correct 15 ms 27348 KB Output is correct
31 Correct 16 ms 27380 KB Output is correct
32 Correct 15 ms 27424 KB Output is correct
33 Correct 15 ms 27348 KB Output is correct
34 Correct 15 ms 27280 KB Output is correct
35 Correct 14 ms 27224 KB Output is correct
36 Correct 15 ms 27220 KB Output is correct
37 Correct 15 ms 27220 KB Output is correct
38 Correct 19 ms 27216 KB Output is correct
39 Correct 18 ms 27348 KB Output is correct
40 Correct 17 ms 27988 KB Output is correct
41 Correct 20 ms 28448 KB Output is correct
42 Correct 22 ms 30088 KB Output is correct
43 Correct 20 ms 30116 KB Output is correct
44 Correct 20 ms 30152 KB Output is correct
45 Correct 21 ms 30192 KB Output is correct
46 Correct 20 ms 30160 KB Output is correct
47 Correct 18 ms 28756 KB Output is correct
48 Correct 22 ms 29460 KB Output is correct
49 Correct 25 ms 29652 KB Output is correct
50 Correct 20 ms 29760 KB Output is correct
51 Correct 19 ms 29396 KB Output is correct
52 Correct 20 ms 29296 KB Output is correct
53 Correct 20 ms 30164 KB Output is correct
54 Correct 47 ms 39660 KB Output is correct
55 Correct 86 ms 41800 KB Output is correct
56 Correct 191 ms 85300 KB Output is correct
57 Correct 187 ms 85616 KB Output is correct
58 Correct 187 ms 85800 KB Output is correct
59 Correct 194 ms 85996 KB Output is correct
60 Correct 199 ms 85964 KB Output is correct
61 Correct 122 ms 59044 KB Output is correct
62 Correct 99 ms 42268 KB Output is correct
63 Correct 159 ms 74188 KB Output is correct
64 Correct 165 ms 74756 KB Output is correct
65 Correct 191 ms 62496 KB Output is correct
66 Correct 132 ms 62492 KB Output is correct
67 Correct 198 ms 86028 KB Output is correct

Subtask #6
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27220 KB Output is correct
2 Correct 15 ms 27196 KB Output is correct
3 Correct 15 ms 27220 KB Output is correct
4 Correct 16 ms 27348 KB Output is correct
5 Correct 16 ms 27220 KB Output is correct
6 Correct 15 ms 27188 KB Output is correct
7 Correct 15 ms 27220 KB Output is correct
8 Correct 14 ms 27228 KB Output is correct
9 Correct 14 ms 27220 KB Output is correct
10 Correct 14 ms 27276 KB Output is correct
11 Correct 14 ms 27348 KB Output is correct
12 Correct 14 ms 27184 KB Output is correct
13 Correct 314 ms 70024 KB Output is correct
14 Correct 392 ms 76380 KB Output is correct
15 Correct 428 ms 83056 KB Output is correct
16 Correct 499 ms 88816 KB Output is correct
17 Correct 660 ms 95172 KB Output is correct
18 Correct 632 ms 95312 KB Output is correct
19 Correct 605 ms 95292 KB Output is correct
20 Correct 14 ms 27252 KB Output is correct
21 Correct 16 ms 27192 KB Output is correct
22 Correct 15 ms 27236 KB Output is correct
23 Correct 14 ms 27288 KB Output is correct
24 Correct 17 ms 27272 KB Output is correct
25 Correct 16 ms 27220 KB Output is correct
26 Correct 15 ms 27380 KB Output is correct
27 Correct 14 ms 27220 KB Output is correct
28 Correct 16 ms 27348 KB Output is correct
29 Correct 14 ms 27356 KB Output is correct
30 Correct 17 ms 27328 KB Output is correct
31 Correct 14 ms 27220 KB Output is correct
32 Correct 16 ms 27340 KB Output is correct
33 Correct 19 ms 27220 KB Output is correct
34 Correct 18 ms 27236 KB Output is correct
35 Correct 16 ms 27252 KB Output is correct
36 Correct 15 ms 27256 KB Output is correct
37 Correct 15 ms 27232 KB Output is correct
38 Correct 15 ms 27388 KB Output is correct
39 Correct 16 ms 27352 KB Output is correct
40 Correct 15 ms 27348 KB Output is correct
41 Correct 19 ms 27328 KB Output is correct
42 Correct 15 ms 27348 KB Output is correct
43 Correct 15 ms 27348 KB Output is correct
44 Correct 15 ms 27348 KB Output is correct
45 Correct 16 ms 27348 KB Output is correct
46 Correct 18 ms 27420 KB Output is correct
47 Correct 15 ms 27348 KB Output is correct
48 Correct 16 ms 27380 KB Output is correct
49 Correct 15 ms 27424 KB Output is correct
50 Correct 15 ms 27348 KB Output is correct
51 Correct 15 ms 27280 KB Output is correct
52 Correct 14 ms 27224 KB Output is correct
53 Correct 15 ms 27220 KB Output is correct
54 Correct 15 ms 27220 KB Output is correct
55 Correct 19 ms 27216 KB Output is correct
56 Correct 18 ms 27348 KB Output is correct
57 Correct 17 ms 27988 KB Output is correct
58 Correct 20 ms 28448 KB Output is correct
59 Correct 22 ms 30088 KB Output is correct
60 Correct 20 ms 30116 KB Output is correct
61 Correct 20 ms 30152 KB Output is correct
62 Correct 21 ms 30192 KB Output is correct
63 Correct 20 ms 30160 KB Output is correct
64 Correct 18 ms 28756 KB Output is correct
65 Correct 22 ms 29460 KB Output is correct
66 Correct 25 ms 29652 KB Output is correct
67 Correct 20 ms 29760 KB Output is correct
68 Correct 19 ms 29396 KB Output is correct
69 Correct 20 ms 29296 KB Output is correct
70 Correct 20 ms 30164 KB Output is correct
71 Correct 47 ms 39660 KB Output is correct
72 Correct 86 ms 41800 KB Output is correct
73 Correct 191 ms 85300 KB Output is correct
74 Correct 187 ms 85616 KB Output is correct
75 Correct 187 ms 85800 KB Output is correct
76 Correct 194 ms 85996 KB Output is correct
77 Correct 199 ms 85964 KB Output is correct
78 Correct 122 ms 59044 KB Output is correct
79 Correct 99 ms 42268 KB Output is correct
80 Correct 159 ms 74188 KB Output is correct
81 Correct 165 ms 74756 KB Output is correct
82 Correct 191 ms 62496 KB Output is correct
83 Correct 132 ms 62492 KB Output is correct
84 Correct 198 ms 86028 KB Output is correct
85 Correct 545 ms 169232 KB Output is correct
86 Correct 1649 ms 369812 KB Output is correct
87 Correct 1615 ms 370668 KB Output is correct
88 Correct 1626 ms 371156 KB Output is correct
89 Correct 1603 ms 371656 KB Output is correct
90 Correct 1616 ms 371616 KB Output is correct
91 Correct 507 ms 108420 KB Output is correct
92 Correct 515 ms 98916 KB Output is correct
93 Correct 1154 ms 282252 KB Output is correct
94 Correct 1235 ms 301112 KB Output is correct
95 Correct 932 ms 223052 KB Output is correct
96 Correct 961 ms 223112 KB Output is correct
97 Correct 1568 ms 371516 KB Output is correct