oj.uz

Submission #581153

# Submission time Handle Problem Language Result Execution time Memory
581153 2022-06-22T09:44:50 Z wdjpng Boarding Passes (BOI22_passes) C++17
5 / 100
 41 ms 1612 KB 
#include <bits/stdc++.h>

#define int long long
#define double long double
#define rep(i,n) for(int i =0; i<n; i++)
#define all(a) a.begin(),a.end()

using namespace std;


string s;
int n;
double f(int n)
{
    return ((double)  n)*((double) (n-1))/4.0;
}

string ord;
vector<double>mem;
vector<vector<int>>pos;
int g;
// cost to add the group gr with all members of that group with and index <= to maxi boarding on the left
double cost(int bor, int gr, int maxi)
{
    double sum = 0;
    int firstr = maxi+1;

    sum+=f(pos[gr].size()-firstr) + f(firstr);


    vector<int>otherpos;
    rep(i,n) if(((1<<(s[i]-'A'))&bor)==0) otherpos.push_back(i);

    rep(i,firstr)
    {
        sum+=upper_bound(all(otherpos),pos[gr][i])-otherpos.begin();
    }

    for(int i = firstr; i < pos[gr].size(); i++) sum+=otherpos.end()-upper_bound(all(otherpos),pos[gr][i]);

    return sum;
}

vector<int>lookup;
double dfs(int bor)
{
    if(mem[bor]>-0.9) return mem[bor];


    double sol = 1e18;
    rep(i,g)
    {
        if(!((1<<i)&bor)) continue;
        int nbor = bor^(1<<i);
        if(!pos[i].size()) return mem[bor]=dfs(nbor);
        int start = -1, end = pos[i].size()-1;
        while(end-start>1)
        {
            int c = (start+end)/2;
            double l =cost(bor,i,c), r=cost(bor,i,c+1);
    
            if(r>=l) end=c;
            else start=c;
        };
        
        sol=min(sol, cost(bor,i,end)+dfs(nbor));

        // vector<int>otherpos;
        // rep(j,n) if(((1<<(s[j]-'A'))&bor)==0) otherpos.push_back(j);
        // double sum = dfs(nbor);
        // rep(j,pos[i].size())
        // {
        //     sum+=min(0.5*((double) j)+(lower_bound(all(otherpos),pos[i][j])-otherpos.begin()),
        //     (otherpos.end()-upper_bound(all(otherpos),pos[i][j])) + 0.5*((double)pos[i].size()-j-1));
        // }

        // double sol1=1e18;
        // rep(firstr,pos[i].size()+1)
        // {
        //     double sum2 = f(pos[i].size()-firstr) + f(firstr);
        //     rep(j,firstr) sum2+=upper_bound(all(otherpos),pos[i][j])-otherpos.begin();
        //     for(int j = firstr; j < pos[i].size(); j++) sum2+=otherpos.end()-upper_bound(all(otherpos),pos[i][j]);
        //     sol1=min(sol1,sum2+dfs(nbor));
        // }
        // assert(sum==sol1);
        // sol=min(sum,sol);
    }
    return mem[bor] = sol;
}


signed main()
{
    cin>>s;
    s.size();
    n=s.size();

    cout.precision(300);
    
    char maxx=0;
    rep(i,n) maxx=max(maxx, s[i]);
    g=maxx-'A'+1;

    pos.resize(g);
   

    rep(i,n) pos[(s[i]-'A')].push_back(i);
    lookup.assign(g,0);
    rep(i,g) lookup[i]=i;
    mem.assign(1<<g,-1.0);
    mem[0]=0;
    cout<<dfs((1<<g)-1)<<'\n';
}

Compilation message

passes.cpp: In function 'long double cost(long long int, long long int, long long int)':
passes.cpp:39:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = firstr; i < pos[gr].size(); i++) sum+=otherpos.end()-upper_bound(all(otherpos),pos[gr][i]);
      |                         ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 32 ms 1484 KB Output is correct
7 Correct 38 ms 1612 KB Output is correct
8 Correct 41 ms 1612 KB Output is correct
9 Correct 39 ms 1612 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 308 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 308 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 32 ms 1484 KB Output is correct
7 Correct 38 ms 1612 KB Output is correct
8 Correct 41 ms 1612 KB Output is correct
9 Correct 39 ms 1612 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 4 ms 308 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -