oj.uz

답안 #1058985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058985 2024-08-14T15:38:45 Z Boas Copy and Paste 3 (JOI22_copypaste3) C++17
20 / 100
 3000 ms 367976 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;

#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
#define int long long
#define INF ((int)(2e18 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define existsIn(x, l) (count(ALL(l), x) > 0)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define F first
#define S second
#define var const auto &
#define foreach(l) for (var e : l)

typedef int8_t in8;
typedef int16_t in16;
typedef int32_t in32;
typedef int64_t in64;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vi::iterator viit;
typedef si::iterator siit;

typedef tuple<int, int, int, int> iiii;
typedef tuple<int, int, int, int, int> iiiii;

int n, a, b, c;
string s;
// map<iiii, int> dp;
set<iiii> seen;
vi ixs;

void solve()
{
    ixs.clear();
    cin >> n >> s >> a >> b >> c;
    map<string, si> strIxs;
    si chars;
    loop(n, i)
    {
        if (!chars.count(s[i]))
        {
            chars.insert(s[i]);
            ixs.pb(i);
        }
    }
    if (chars.size() > 1)
        loop(n, l) for (int r = l; r < n; r++) strIxs[s.substr(l, r - l + 1)].insert(l);
    priority_queue<iiiii> q;
    q.push({0, 0, 0, 0, 0});
    while (!q.empty())
    {
        auto [cur, lX, sX, lY, sY] = q.top();
        q.pop();
        if (sX == n)
        {
            cout << -cur << endl;
            exit(0);
        }
        if (sX > n)
            continue;
        if (seen.count({lX, sX, lY, sY}))
            continue;
        seen.insert({lX, sX, lY, sY});
        if (sX == 0LL)
        {
            for (int i : ixs)
            {
                q.push({cur - a, i, 1LL, lY, sY});
            }
        }
        else
        {
            q.push({cur - a, lX, sX + 1LL, lY, sY});
        }
        if (sX)
        {
            q.push({cur - b, 0LL, 0LL, lX, sX});
        }
        if (sY && lX + sX + sY <= n)
        {
            if (chars.size() == 1)
            {
                q.push({cur - c, lX, sX + sY, lY, sY});
            }
            else
            {
                string x = s.substr(lX, sX);
                string y = s.substr(lY, sY);
                if (x.empty())
                {
                    q.push({cur - c, lY, sY, lY, sY});
                }
                else
                    for (int i : strIxs[x])
                    {
                        if (i + sX + sY <= n && strIxs[y].count(i + sX))
                            q.push({cur - c, i, sX + sY, lY, sY});
                    }
            }
        }
    }
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 918 ms 104736 KB Output is correct
4 Correct 501 ms 58316 KB Output is correct
5 Correct 2321 ms 247812 KB Output is correct
6 Correct 7 ms 2420 KB Output is correct
7 Correct 2724 ms 367976 KB Output is correct
8 Correct 11 ms 2420 KB Output is correct
9 Correct 1 ms 932 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 1116 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 6 ms 1536 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 452 KB Output is correct
28 Correct 22 ms 2892 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 22 ms 3440 KB Output is correct
33 Correct 113 ms 18904 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 1116 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 6 ms 1536 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 452 KB Output is correct
28 Correct 22 ms 2892 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 22 ms 3440 KB Output is correct
33 Correct 113 ms 18904 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 6 ms 1720 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Execution timed out 3101 ms 224896 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 1116 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 6 ms 1536 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 452 KB Output is correct
28 Correct 22 ms 2892 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 22 ms 3440 KB Output is correct
33 Correct 113 ms 18904 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 6 ms 1720 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Execution timed out 3101 ms 224896 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 918 ms 104736 KB Output is correct
14 Correct 501 ms 58316 KB Output is correct
15 Correct 2321 ms 247812 KB Output is correct
16 Correct 7 ms 2420 KB Output is correct
17 Correct 2724 ms 367976 KB Output is correct
18 Correct 11 ms 2420 KB Output is correct
19 Correct 1 ms 932 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 5 ms 1116 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 4 ms 1116 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 6 ms 1536 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 604 KB Output is correct
44 Correct 0 ms 452 KB Output is correct
45 Correct 22 ms 2892 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 22 ms 3440 KB Output is correct
50 Correct 113 ms 18904 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 604 KB Output is correct
57 Correct 6 ms 1720 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Execution timed out 3101 ms 224896 KB Time limit exceeded
60 Halted 0 ms 0 KB -