oj.uz

Submission #581135

# Submission time Handle Problem Language Result Execution time Memory
581135 2022-06-22T09:32:42 Z wdjpng Boarding Passes (BOI22_passes) C++17
60 / 100
 2000 ms 8524 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));
        }
        // rep(firstr,pos[i].size())
        // {
        //     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));
        // }
        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]);
      |                         ~~^~~~~~~~~~~~~~~~
passes.cpp: In function 'long double dfs(long long int)':
passes.cpp:5:33: 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]
    5 | #define rep(i,n) for(int i =0; i<n; i++)
......
   70 |         rep(j,pos[i].size())
      |             ~~~~~~~~~~~~~~~      
passes.cpp:70:9: note: in expansion of macro 'rep'
   70 |         rep(j,pos[i].size())
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 4 ms 1484 KB Output is correct
7 Correct 5 ms 1528 KB Output is correct
8 Correct 6 ms 1612 KB Output is correct
9 Correct 5 ms 1640 KB Output is correct

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 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 252 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 212 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
30.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 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 252 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 212 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 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 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 212 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 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 880 ms 968 KB Output is correct
38 Correct 300 ms 980 KB Output is correct
39 Correct 237 ms 940 KB Output is correct
40 Correct 620 ms 924 KB Output is correct
41 Correct 701 ms 960 KB Output is correct
42 Correct 680 ms 960 KB Output is correct
43 Correct 730 ms 1108 KB Output is correct
44 Correct 692 ms 908 KB Output is correct
45 Correct 698 ms 1028 KB Output is correct
46 Correct 694 ms 1000 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 4 ms 1484 KB Output is correct
7 Correct 5 ms 1528 KB Output is correct
8 Correct 6 ms 1612 KB Output is correct
9 Correct 5 ms 1640 KB Output is correct
10 Correct 0 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 212 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 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 252 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 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 212 KB Output is correct
28 Correct 0 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 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 880 ms 968 KB Output is correct
47 Correct 300 ms 980 KB Output is correct
48 Correct 237 ms 940 KB Output is correct
49 Correct 620 ms 924 KB Output is correct
50 Correct 701 ms 960 KB Output is correct
51 Correct 680 ms 960 KB Output is correct
52 Correct 730 ms 1108 KB Output is correct
53 Correct 692 ms 908 KB Output is correct
54 Correct 698 ms 1028 KB Output is correct
55 Correct 694 ms 1000 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 80 ms 808 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 5 ms 1484 KB Output is correct
64 Correct 5 ms 1612 KB Output is correct
65 Correct 6 ms 1612 KB Output is correct
66 Correct 5 ms 1612 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 1 ms 212 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 468 KB Output is correct
85 Correct 1 ms 468 KB Output is correct
86 Correct 908 ms 948 KB Output is correct
87 Correct 301 ms 932 KB Output is correct
88 Correct 231 ms 960 KB Output is correct
89 Correct 610 ms 924 KB Output is correct
90 Correct 735 ms 956 KB Output is correct
91 Correct 734 ms 976 KB Output is correct
92 Correct 742 ms 1028 KB Output is correct
93 Correct 738 ms 924 KB Output is correct
94 Correct 740 ms 956 KB Output is correct
95 Correct 786 ms 984 KB Output is correct
96 Execution timed out 2091 ms 8524 KB Time limit exceeded
97 Halted 0 ms 0 KB -