oj.uz

Submission #581156

# Submission time Handle Problem Language Result Execution time Memory
581156 2022-06-22T09:48:29 Z wdjpng Boarding Passes (BOI22_passes) C++17
25 / 100
 2000 ms 1484 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 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(i,n) if(((1<<(s[i]-'A'))&bor)==0) otherpos.push_back(i);
     
            rep(firstr,pos[i].size()+1)
            {
                double sum = f(pos[i].size()-firstr) + f(firstr);
                rep(j,firstr) sum+=upper_bound(all(otherpos),pos[i][j])-otherpos.begin();
                for(int j = firstr; j < pos[i].size(); j++) sum+=otherpos.end()-upper_bound(all(otherpos),pos[i][j]);
                sol=min(sol,sum+dfs(nbor));
            }
        }
        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:41:31: 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]
   41 |         for(int i = firstr; i < pos[gr].size(); i++) sum+=otherpos.end()-upper_bound(all(otherpos),pos[gr][i]);
      |                             ~~^~~~~~~~~~~~~~~~
passes.cpp: In function 'long double dfs(long long int)':
passes.cpp:7:37: 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]
    7 |     #define rep(i,n) for(int i =0; i<n; i++)
......
   72 |             rep(firstr,pos[i].size()+1)
      |                 ~~~~~~~~~~~~~~~~~~~~~~
passes.cpp:72:13: note: in expansion of macro 'rep'
   72 |             rep(firstr,pos[i].size()+1)
      |             ^~~
passes.cpp:76:39: 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]
   76 |                 for(int j = firstr; j < pos[i].size(); j++) sum+=otherpos.end()-upper_bound(all(otherpos),pos[i][j]);
      |                                     ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 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 0 ms 212 KB Output is correct
5 Correct 9 ms 212 KB Output is correct
6 Execution timed out 2052 ms 1484 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 6 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 792 ms 468 KB Output is correct
36 Correct 822 ms 468 KB Output is correct
37 Execution timed out 2053 ms 1060 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 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 0 ms 212 KB Output is correct
5 Correct 9 ms 212 KB Output is correct
6 Execution timed out 2052 ms 1484 KB Time limit exceeded
7 Halted 0 ms 0 KB -