oj.uz

Submission #104845

# Submission time Handle Problem Language Result Execution time Memory
104845 2019-04-09T11:16:26 Z nikolapesic2802 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 289 ms 42816 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

vector<vector<int> > pos(3);
const int N=401,oo=INT_MAX/10;
int n;
int vecih[3][3][N][N];
vector<vector<vector<vector<int> > > > dp;
#define dp dp[color][p1][p2][p3]
int calc(int color,int p1,int p2,int p3)
{
    int tr=p1+p2+p3;
    if(color==-1)
    {
        int best=oo;
        if(p1<(int)pos[0].size())
        {
            int veci=0;
            if(p2)
                veci+=vecih[0][1][p1][p2-1];
            if(p3)
                veci+=vecih[0][2][p1][p3-1];
            int where=pos[0][p1]+veci;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            best=min(best,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[1][0][p2][p1-1];
            if(p3)
                veci+=vecih[1][2][p2][p3-1];
            int where=pos[1][p2]+veci;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            best=min(best,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[2][0][p3][p1-1];
            if(p2)
                veci+=vecih[2][1][p3][p2-1];
            int where=pos[2][p3]+veci;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            best=min(best,sol);
        }
        return best;
    }
    if(tr==n)
    {
        assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
        return 0;
    }
    if(dp!=-1)
        return dp;
    dp=oo;
    if(color==0)
    {
        if(p2<(int)pos[1].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[1][0][p2][p1-1];
            if(p3)
                veci+=vecih[1][2][p2][p3-1];
            int where=pos[1][p2]+veci;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[2][0][p3][p1-1];
            if(p2)
                veci+=vecih[2][1][p3][p2-1];
            int where=pos[2][p3]+veci;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            dp=min(dp,sol);
        }
    }
    if(color==1)
    {
        if(p1<(int)pos[0].size())
        {
            int veci=0;
            if(p2)
                veci+=vecih[0][1][p1][p2-1];
            if(p3)
                veci+=vecih[0][2][p1][p3-1];
            int where=pos[0][p1]+veci;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[2][0][p3][p1-1];
            if(p2)
                veci+=vecih[2][1][p3][p2-1];
            int where=pos[2][p3]+veci;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            dp=min(dp,sol);
        }
    }
    if(color==2)
    {
        if(p1<(int)pos[0].size())
        {
            int veci=0;
            if(p2)
                veci+=vecih[0][1][p1][p2-1];
            if(p3)
                veci+=vecih[0][2][p1][p3-1];
            int where=pos[0][p1]+veci;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            dp=min(dp,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int veci=0;
            if(p1)
                veci+=vecih[1][0][p2][p1-1];
            if(p3)
                veci+=vecih[1][2][p2][p3-1];
            int where=pos[1][p2]+veci;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            dp=min(dp,sol);
        }
    }
    return dp;
}
#undef dp
int main()
{
	cin >> n;
	string s;
	cin >> s;
	for(int i=0;i<n;i++)
    {
        if(s[i]=='R')
            pos[0].pb(i);
        if(s[i]=='G')
            pos[1].pb(i);
        if(s[i]=='Y')
            pos[2].pb(i);
    }
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
        {
            if(i==j)
                continue;
            for(int k=0;k<pos[i].size();k++)
            {
                for(int l=0;l<pos[j].size();l++)
                {
                    vecih[i][j][k][l]=pos[j][l]>pos[i][k];
                    if(l)
                        vecih[i][j][k][l]+=vecih[i][j][k][l-1];
                }
            }
        }
    dp.resize(3,vector<vector<vector<int> > >(pos[0].size()+1,vector<vector<int> >(pos[1].size()+1,vector<int>(pos[2].size()+1,-1))));
    int ans=calc(-1,0,0,0);
    if(ans>=oo)
        ans=-1;
    printf("%i\n",ans);
    return 0;
}

Compilation message

In file included from /usr/include/c++/7/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45:0,
                 from /usr/include/c++/7/ext/pb_ds/detail/container_base_dispatch.hpp:90,
                 from /usr/include/c++/7/ext/pb_ds/assoc_container.hpp:48,
                 from joi2019_ho_t3.cpp:2:
joi2019_ho_t3.cpp: In function 'int calc(int, int, int, int)':
joi2019_ho_t3.cpp:76:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
                ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:76:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
                                   ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:76:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
                                                      ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:179:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<pos[i].size();k++)
                         ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:181:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int l=0;l<pos[j].size();l++)
                             ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 0 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 3 ms 768 KB Output is correct
28 Correct 4 ms 768 KB Output is correct
29 Correct 4 ms 768 KB Output is correct
30 Correct 4 ms 768 KB Output is correct
31 Correct 4 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 3 ms 768 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 3 ms 768 KB Output is correct
36 Correct 4 ms 768 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 4 ms 768 KB Output is correct
39 Correct 3 ms 768 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 3 ms 612 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 20 ms 9860 KB Output is correct
3 Correct 17 ms 9856 KB Output is correct
4 Correct 20 ms 9856 KB Output is correct
5 Correct 23 ms 9984 KB Output is correct
6 Correct 18 ms 9896 KB Output is correct
7 Correct 21 ms 9856 KB Output is correct
8 Correct 18 ms 9856 KB Output is correct
9 Correct 20 ms 9856 KB Output is correct
10 Correct 21 ms 9856 KB Output is correct
11 Correct 19 ms 9856 KB Output is correct
12 Correct 7 ms 3072 KB Output is correct
13 Correct 10 ms 4992 KB Output is correct
14 Correct 15 ms 7040 KB Output is correct
15 Correct 22 ms 9976 KB Output is correct
16 Correct 22 ms 9984 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 896 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 0 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 2 ms 768 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 3 ms 768 KB Output is correct
28 Correct 4 ms 768 KB Output is correct
29 Correct 4 ms 768 KB Output is correct
30 Correct 4 ms 768 KB Output is correct
31 Correct 4 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 3 ms 768 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 3 ms 768 KB Output is correct
36 Correct 4 ms 768 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 4 ms 768 KB Output is correct
39 Correct 3 ms 768 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 3 ms 612 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 20 ms 9860 KB Output is correct
44 Correct 17 ms 9856 KB Output is correct
45 Correct 20 ms 9856 KB Output is correct
46 Correct 23 ms 9984 KB Output is correct
47 Correct 18 ms 9896 KB Output is correct
48 Correct 21 ms 9856 KB Output is correct
49 Correct 18 ms 9856 KB Output is correct
50 Correct 20 ms 9856 KB Output is correct
51 Correct 21 ms 9856 KB Output is correct
52 Correct 19 ms 9856 KB Output is correct
53 Correct 7 ms 3072 KB Output is correct
54 Correct 10 ms 4992 KB Output is correct
55 Correct 15 ms 7040 KB Output is correct
56 Correct 22 ms 9976 KB Output is correct
57 Correct 22 ms 9984 KB Output is correct
58 Correct 229 ms 42132 KB Output is correct
59 Correct 248 ms 42816 KB Output is correct
60 Correct 270 ms 41464 KB Output is correct
61 Correct 286 ms 42232 KB Output is correct
62 Correct 24 ms 10240 KB Output is correct
63 Correct 26 ms 12672 KB Output is correct
64 Correct 70 ms 26104 KB Output is correct
65 Correct 105 ms 32248 KB Output is correct
66 Correct 251 ms 41592 KB Output is correct
67 Correct 247 ms 41336 KB Output is correct
68 Correct 242 ms 41720 KB Output is correct
69 Correct 289 ms 42620 KB Output is correct
70 Correct 224 ms 42360 KB Output is correct
71 Correct 248 ms 41720 KB Output is correct
72 Correct 26 ms 12544 KB Output is correct
73 Correct 7 ms 4224 KB Output is correct