oj.uz

Submission #692905

# Submission time Handle Problem Language Result Execution time Memory
692905 2023-02-02T07:09:17 Z zeroesandones Miners (IOI07_miners) C++17
45 / 100
 1500 ms 832 KB 
// https://oj.uz/problem/view/IOI07_miners
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

void solve()
{
    ll n;
    cin >> n;

    string s;
    cin >> s;

    ll ans = 0;
    FOR(i, 0, (1<<n)) {
        vector<char> m1, m2;
        FOR(j, 0, n) {
            if(i & (1<<j)) {
                m1.pb(s[j]);
            } else {
                m2.pb(s[j]);
            }
        }

        ll curr = 0;
        for(int j = 0; j < (int) m1.size(); ++j) {
            set<char> diff;
            diff.insert(m1[j]);
            if(j - 1 >= 0)
                diff.insert(m1[j - 1]);
            if(j - 2 >= 0)
                diff.insert(m1[j - 2]);
            curr += diff.size();
        }

        for(int j = 0; j < (int) m2.size(); ++j) {
            set<char> diff;
            diff.insert(m2[j]);
            if(j - 1 >= 0)
                diff.insert(m2[j - 1]);
            if(j - 2 >= 0)
                diff.insert(m2[j - 2]);
            curr += diff.size();
        }

        ans = max(ans, curr);
    }

    cout << ans << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 300 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 859 ms 300 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1370 ms 312 KB Output is correct

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1576 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1582 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 519 ms 428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1571 ms 832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -