oj.uz

Submission #972995

# Submission time Handle Problem Language Result Execution time Memory
972995 2024-05-01T11:47:08 Z idas Boarding Passes (BOI22_passes) C++11
0 / 100
 1863 ms 500 KB 
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define sz(x) int((x).size())
#define pb push_back
#define s second
#define f first

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tiii;
typedef long double ld;

const int INF=1e9;

const int N=1e5+10;
int n;
string s;

int main()
{
    FAST_IO;
    cin >> s; n=sz(s);

    set<char> dif;
    FOR(i, 0, n)
    {
        dif.insert(s[i]);
    }

    int m=sz(dif);

    vector<char> ar(dif.begin(), dif.end());
    ld ans=-1;
    do{
        FOR(i, -1, n)
        {
            ld now=0;
            set<char> v;
            FOR(k, 0, m)
            {
                int row=0, add=0;
                FOR(j, 0, n)
                {
                    if(j>i) break;
                    if(v.count(s[j])) add++;
                    else if(s[j]==ar[k]){
                        now+=add;
                        add=0;

                        row++;
                        now+=(row-1)/ld(2);
                    }
                }

                row=0; add=0;
                for(int j=n-1; j>=0; j--){
                    if(j==i) break;
                    if(v.count(s[j])) add++;
                    else if(s[j]==ar[k]){
                        now+=add;
                        add=0;

                        row++;
                        now+=(row-1)/ld(2);
                    }
                }

                v.insert(ar[k]);
            }
            if(ans==-1) ans=now;
            else ans=min(ans, now);
//            cout << now << endl;
        }
    }
    while(next_permutation(ar.begin(), ar.end()));

    cout << ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 348 KB 1st numbers differ - expected: '100800.5000000000', found: '100800.0000000000', error = '0.0000049603'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 500 KB found '1.0000000000', expected '1.0000000000', error '0.0000000000'
2 Correct 0 ms 348 KB found '1225.0000000000', expected '1225.0000000000', error '0.0000000000'
3 Incorrect 1863 ms 432 KB 1st numbers differ - expected: '1023.0000000000', found: '381.5000000000', error = '0.6270772239'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 500 KB found '1.0000000000', expected '1.0000000000', error '0.0000000000'
2 Correct 0 ms 348 KB found '1225.0000000000', expected '1225.0000000000', error '0.0000000000'
3 Incorrect 1863 ms 432 KB 1st numbers differ - expected: '1023.0000000000', found: '381.5000000000', error = '0.6270772239'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 348 KB 1st numbers differ - expected: '100800.5000000000', found: '100800.0000000000', error = '0.0000049603'
2 Halted 0 ms 0 KB -