oj.uz

Submission #968748

# Submission time Handle Problem Language Result Execution time Memory
968748 2024-04-24T02:20:00 Z youssef_3breheem Three Friends (BOI14_friends) C++14
100 / 100
 179 ms 86432 KB 
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef string str;
typedef vector<ll> vint;

const ll mod1 = 1999998893;
const ll mod2 = 2100003611;
const ll base = 29;
const char startingLetter = 'A'; // starting letter of the alphabet

ll hashChar(char c) {
    return c - startingLetter + 1;
}

pair<ll, ll> hashStr(pair<ll, ll> prevHash, char curChar) {
    return {((prevHash.first * base) % mod1 + hashChar(curChar)) % mod1,
            ((prevHash.second * base) % mod2 + hashChar(curChar)) % mod2};
}

void calculatePowers(ll powOfBase1[], ll powOfBase2[], int N) {
    powOfBase1[0] = 1;
    powOfBase2[0] = 1;
    for (int i = 1; i < N; i++) {
        powOfBase1[i] = (base * powOfBase1[i - 1]) % mod1;
        powOfBase2[i] = (base * powOfBase2[i - 1]) % mod2;
    }
}

str findUniqueString(int n, const str& u) {
    str left = "", right = "";
    for (int i = 0; i < n / 2 + 1; i++)
        left += u[i];
    for (int i = n / 2 + 1; i < n; i++)
        right += u[i];

    str ans = "";
    pair<ll, ll> ansHsh = {0, 0};

    ll powOfBase1[n], powOfBase2[n];
    calculatePowers(powOfBase1, powOfBase2, n);

    for (int z = 0; z < 2; z++) {
        vector<pair<ll, ll>> hshLeft, hshRight;
        hshLeft.push_back({hashChar(left[0]), hashChar(left[0])});
        for (int i = 1; i < left.size(); i++) {
            auto d = hshLeft.back();
            hshLeft.push_back(hashStr(d, left[i]));
        }

        hshRight.push_back({hashChar(right[0]), hashChar(right[0])});
        for (int i = 1; i < right.size(); i++) {
            auto d = hshRight.back();
            hshRight.push_back(hashStr(d, right[i]));
        }

        if (z) {
            for (int i = 1; i < right.size(); i++) {
                auto resultHash = hshRight.back();
                int offset = right.size() - (i + 1);
                resultHash.first = ((resultHash.first - (powOfBase1[offset] * hshRight[i].first) % mod1) % mod1 + mod1) % mod1;
                if (i)
                    resultHash.first = (resultHash.first + (powOfBase1[offset] * hshRight[i - 1].first) % mod1) % mod1;
                resultHash.second = ((resultHash.second - (powOfBase2[offset] * hshRight[i].second) % mod2) % mod2 + mod2) % mod2;
                if (i)
                    resultHash.second = (resultHash.second + (powOfBase2[offset] * hshRight[i - 1].second) % mod2) % mod2;
                if (resultHash == hshLeft.back()) {
                    if (ans == "") {
                        for (int j = 0; j < right.size(); j++)
                            if (i != j)
                                ans += right[j];
                        for (char j : ans)
                            ansHsh = hashStr(ansHsh, j);
                    } else {
                        if (resultHash != ansHsh)
                            return "NOT UNIQUE";
                    }
                }
            }
        } else {
            for (int i = 0; i < left.size(); i++) {
                auto resultHash = hshLeft.back();
                int offset = left.size() - (i + 1);
                resultHash.first = ((resultHash.first - (powOfBase1[offset] * hshLeft[i].first) % mod1) % mod1 + mod1) % mod1;
                if (i)
                    resultHash.first = (resultHash.first + (powOfBase1[offset] * hshLeft[i - 1].first) % mod1) % mod1;
                resultHash.second = ((resultHash.second - (powOfBase2[offset] * hshLeft[i].second) % mod2) % mod2 + mod2) % mod2;
                if (i)
                    resultHash.second = (resultHash.second + (powOfBase2[offset] * hshLeft[i - 1].second) % mod2) % mod2;
                if (resultHash == hshRight.back()) {
                    if (ans == "") {
                        for (int j = 0; j < left.size(); j++)
                            if (i != j)
                                ans += left[j];
                        for (char j : ans)
                            ansHsh = hashStr(ansHsh, j);
                    } else {
                        if (resultHash != ansHsh)
                            return "NOT UNIQUE";
                    }
                }
            }
        }
        if (z)
            break;
        right = left.back() + right;
        left.pop_back();
    }

    if (ans.empty())
        return "NOT POSSIBLE";
    else
        return ans;
}

int main() {
    srand(time(0));
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(15);

    int n;
    cin >> n;
    str u;
    cin >> u;

    str result = findUniqueString(n, u);
    cout << result;

    return 0;
}

Compilation message

friends.cpp: In function 'str findUniqueString(int, const str&)':
friends.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for (int i = 1; i < left.size(); i++) {
      |                         ~~^~~~~~~~~~~~~
friends.cpp:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 1; i < right.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
friends.cpp:64:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             for (int i = 1; i < right.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
friends.cpp:75:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                         for (int j = 0; j < right.size(); j++)
      |                                         ~~^~~~~~~~~~~~~~
friends.cpp:87:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |             for (int i = 0; i < left.size(); i++) {
      |                             ~~^~~~~~~~~~~~~
friends.cpp:98:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |                         for (int j = 0; j < left.size(); j++)
      |                                         ~~^~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 1 ms 348 KB Output is correct
25 Correct 1 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 0 ms 348 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 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 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 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 85748 KB Output is correct
2 Correct 160 ms 86240 KB Output is correct
3 Correct 154 ms 85416 KB Output is correct
4 Correct 153 ms 84640 KB Output is correct
5 Correct 154 ms 86148 KB Output is correct
6 Correct 143 ms 83264 KB Output is correct
7 Correct 179 ms 86432 KB Output is correct
8 Correct 140 ms 80444 KB Output is correct
9 Correct 138 ms 78628 KB Output is correct
10 Correct 136 ms 78836 KB Output is correct
11 Correct 120 ms 76504 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 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 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 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 600 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct