oj.uz

Submission #104838

# Submission time Handle Problem Language Result Execution time Memory
104838 2019-04-09T10:47:05 Z nikolapesic2802 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 345 ms 325752 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=61,oo=INT_MAX/10;
int n;
vector<int> val;
int dp[N][3][N][N][N];
#define dp dp[tr][color][p1][p2][p3]
int calc(int tr,int color,int p1,int p2,int p3)
{
    //printf("Calc %i %i %i %i %i\n",tr,color,p1,p2,p3);
    //cout << val;
    if(color==-1)
    {
        int best=oo;
        if(p1<(int)pos[0].size())
        {
            int where=val[pos[0][p1]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,0,p1+1,p2,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            best=min(best,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int where=val[pos[1][p2]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,1,p1,p2+1,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            best=min(best,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,2,p1,p2,p3+1)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            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 where=val[pos[1][p2]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,1,p1,p2+1,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,2,p1,p2,p3+1)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
    }
    if(color==1)
    {
        if(p1<(int)pos[0].size())
        {
            int where=val[pos[0][p1]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,0,p1+1,p2,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,2,p1,p2,p3+1)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
    }
    if(color==2)
    {
        if(p1<(int)pos[0].size())
        {
            int where=val[pos[0][p1]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,0,p1+1,p2,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int where=val[pos[1][p2]];
            assert(where>=tr);
            vector<int> inc;
            for(int i=0;i<n;i++)
                if(val[i]>=tr&&val[i]<where)
                    val[i]++,inc.pb(i);
            int sol=calc(tr+1,1,p1,p2+1,p3)+abs(where-tr);
            for(auto p:inc)
                val[p]--;
            dp=min(dp,sol);
        }
    }
    return dp;
}
#undef dp
int main()
{
    memset(dp,-1,sizeof dp);
	cin >> n;
	string s;
	cin >> s;
	val.resize(n);
	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);
        val[i]=i;
    }
    int ans=calc(0,-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, int)':
joi2019_ho_t3.cpp:83: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:83: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:83:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         assert(p1==pos[0].size()&&p2==pos[1].size()&&p3==pos[2].size());
                                                      ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 162872 KB Output is correct
2 Correct 158 ms 162936 KB Output is correct
3 Correct 149 ms 162932 KB Output is correct
4 Correct 141 ms 162936 KB Output is correct
5 Correct 150 ms 163068 KB Output is correct
6 Correct 139 ms 162908 KB Output is correct
7 Correct 175 ms 162992 KB Output is correct
8 Correct 154 ms 162924 KB Output is correct
9 Correct 157 ms 162872 KB Output is correct
10 Correct 147 ms 162864 KB Output is correct
11 Correct 139 ms 162936 KB Output is correct
12 Correct 146 ms 162956 KB Output is correct
13 Correct 151 ms 162940 KB Output is correct
14 Correct 140 ms 163008 KB Output is correct
15 Correct 143 ms 162928 KB Output is correct
16 Correct 140 ms 162908 KB Output is correct
17 Correct 135 ms 162860 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 162872 KB Output is correct
2 Correct 158 ms 162936 KB Output is correct
3 Correct 149 ms 162932 KB Output is correct
4 Correct 141 ms 162936 KB Output is correct
5 Correct 150 ms 163068 KB Output is correct
6 Correct 139 ms 162908 KB Output is correct
7 Correct 175 ms 162992 KB Output is correct
8 Correct 154 ms 162924 KB Output is correct
9 Correct 157 ms 162872 KB Output is correct
10 Correct 147 ms 162864 KB Output is correct
11 Correct 139 ms 162936 KB Output is correct
12 Correct 146 ms 162956 KB Output is correct
13 Correct 151 ms 162940 KB Output is correct
14 Correct 140 ms 163008 KB Output is correct
15 Correct 143 ms 162928 KB Output is correct
16 Correct 140 ms 162908 KB Output is correct
17 Correct 135 ms 162860 KB Output is correct
18 Correct 167 ms 162916 KB Output is correct
19 Correct 137 ms 162956 KB Output is correct
20 Correct 137 ms 162940 KB Output is correct
21 Correct 160 ms 162936 KB Output is correct
22 Correct 130 ms 162852 KB Output is correct
23 Correct 131 ms 162936 KB Output is correct
24 Correct 148 ms 162948 KB Output is correct
25 Correct 136 ms 162936 KB Output is correct
26 Correct 136 ms 162936 KB Output is correct
27 Correct 151 ms 162940 KB Output is correct
28 Correct 169 ms 162876 KB Output is correct
29 Correct 142 ms 163028 KB Output is correct
30 Correct 133 ms 162936 KB Output is correct
31 Correct 140 ms 162884 KB Output is correct
32 Correct 143 ms 162892 KB Output is correct
33 Correct 129 ms 162932 KB Output is correct
34 Correct 128 ms 162932 KB Output is correct
35 Correct 144 ms 162936 KB Output is correct
36 Correct 154 ms 162936 KB Output is correct
37 Correct 155 ms 162936 KB Output is correct
38 Correct 145 ms 162936 KB Output is correct
39 Correct 147 ms 162948 KB Output is correct
40 Correct 129 ms 162940 KB Output is correct
41 Correct 134 ms 162912 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 162936 KB Output is correct
2 Runtime error 345 ms 325752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 162872 KB Output is correct
2 Correct 158 ms 162936 KB Output is correct
3 Correct 149 ms 162932 KB Output is correct
4 Correct 141 ms 162936 KB Output is correct
5 Correct 150 ms 163068 KB Output is correct
6 Correct 139 ms 162908 KB Output is correct
7 Correct 175 ms 162992 KB Output is correct
8 Correct 154 ms 162924 KB Output is correct
9 Correct 157 ms 162872 KB Output is correct
10 Correct 147 ms 162864 KB Output is correct
11 Correct 139 ms 162936 KB Output is correct
12 Correct 146 ms 162956 KB Output is correct
13 Correct 151 ms 162940 KB Output is correct
14 Correct 140 ms 163008 KB Output is correct
15 Correct 143 ms 162928 KB Output is correct
16 Correct 140 ms 162908 KB Output is correct
17 Correct 135 ms 162860 KB Output is correct
18 Correct 167 ms 162916 KB Output is correct
19 Correct 137 ms 162956 KB Output is correct
20 Correct 137 ms 162940 KB Output is correct
21 Correct 160 ms 162936 KB Output is correct
22 Correct 130 ms 162852 KB Output is correct
23 Correct 131 ms 162936 KB Output is correct
24 Correct 148 ms 162948 KB Output is correct
25 Correct 136 ms 162936 KB Output is correct
26 Correct 136 ms 162936 KB Output is correct
27 Correct 151 ms 162940 KB Output is correct
28 Correct 169 ms 162876 KB Output is correct
29 Correct 142 ms 163028 KB Output is correct
30 Correct 133 ms 162936 KB Output is correct
31 Correct 140 ms 162884 KB Output is correct
32 Correct 143 ms 162892 KB Output is correct
33 Correct 129 ms 162932 KB Output is correct
34 Correct 128 ms 162932 KB Output is correct
35 Correct 144 ms 162936 KB Output is correct
36 Correct 154 ms 162936 KB Output is correct
37 Correct 155 ms 162936 KB Output is correct
38 Correct 145 ms 162936 KB Output is correct
39 Correct 147 ms 162948 KB Output is correct
40 Correct 129 ms 162940 KB Output is correct
41 Correct 134 ms 162912 KB Output is correct
42 Correct 140 ms 162936 KB Output is correct
43 Runtime error 345 ms 325752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Halted 0 ms 0 KB -