oj.uz

Submission #104844

# Submission time Handle Problem Language Result Execution time Memory
104844 2019-04-09T11:04:07 Z nikolapesic2802 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 40696 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;
vector<int> val;
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;
    //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);
            for(int i=0;i<pos[0][p1];i++)
                val[i]++;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            for(int i=0;i<pos[0][p1];i++)
                val[i]--;
            best=min(best,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int where=val[pos[1][p2]];
            assert(where>=tr);
            for(int i=0;i<pos[1][p2];i++)
                val[i]++;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            for(int i=0;i<pos[1][p2];i++)
                val[i]--;
            best=min(best,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]++;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]--;
            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);
            for(int i=0;i<pos[1][p2];i++)
                val[i]++;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            for(int i=0;i<pos[1][p2];i++)
                val[i]--;
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]++;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]--;
            dp=min(dp,sol);
        }
    }
    if(color==1)
    {
        if(p1<(int)pos[0].size())
        {
            int where=val[pos[0][p1]];
            assert(where>=tr);
            for(int i=0;i<pos[0][p1];i++)
                val[i]++;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            for(int i=0;i<pos[0][p1];i++)
                val[i]--;
            dp=min(dp,sol);
        }
        if(p3<(int)pos[2].size())
        {
            int where=val[pos[2][p3]];
            assert(where>=tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]++;
            int sol=calc(2,p1,p2,p3+1)+abs(where-tr);
            for(int i=0;i<pos[2][p3];i++)
                val[i]--;
            dp=min(dp,sol);
        }
    }
    if(color==2)
    {
        if(p1<(int)pos[0].size())
        {
            int where=val[pos[0][p1]];
            assert(where>=tr);
            for(int i=0;i<pos[0][p1];i++)
                val[i]++;
            int sol=calc(0,p1+1,p2,p3)+abs(where-tr);
            for(int i=0;i<pos[0][p1];i++)
                val[i]--;
            dp=min(dp,sol);
        }
        if(p2<(int)pos[1].size())
        {
            int where=val[pos[1][p2]];
            assert(where>=tr);
            for(int i=0;i<pos[1][p2];i++)
                val[i]++;
            int sol=calc(1,p1,p2+1,p3)+abs(where-tr);
            for(int i=0;i<pos[1][p2];i++)
                val[i]--;
            dp=min(dp,sol);
        }
    }
    return dp;
}
#undef dp
int main()
{
	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;
    }
    assert(3*(pos[0].size()+1)*(pos[1].size()+1)*(pos[2].size()+1)<(int)1e7);
    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:78: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:78: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:78: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 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 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 3 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 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 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 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 3 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 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 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 4 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 4 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 4 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 512 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 19 ms 9216 KB Output is correct
3 Correct 24 ms 9216 KB Output is correct
4 Correct 18 ms 9216 KB Output is correct
5 Correct 23 ms 9344 KB Output is correct
6 Correct 18 ms 9236 KB Output is correct
7 Correct 20 ms 9216 KB Output is correct
8 Correct 17 ms 9264 KB Output is correct
9 Correct 18 ms 9216 KB Output is correct
10 Correct 17 ms 9216 KB Output is correct
11 Correct 17 ms 9216 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 9 ms 4608 KB Output is correct
14 Correct 15 ms 6400 KB Output is correct
15 Correct 24 ms 9216 KB Output is correct
16 Correct 18 ms 9216 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 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 3 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 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 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 4 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 4 ms 512 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 4 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 19 ms 9216 KB Output is correct
44 Correct 24 ms 9216 KB Output is correct
45 Correct 18 ms 9216 KB Output is correct
46 Correct 23 ms 9344 KB Output is correct
47 Correct 18 ms 9236 KB Output is correct
48 Correct 20 ms 9216 KB Output is correct
49 Correct 17 ms 9264 KB Output is correct
50 Correct 18 ms 9216 KB Output is correct
51 Correct 17 ms 9216 KB Output is correct
52 Correct 17 ms 9216 KB Output is correct
53 Correct 6 ms 2688 KB Output is correct
54 Correct 9 ms 4608 KB Output is correct
55 Correct 15 ms 6400 KB Output is correct
56 Correct 24 ms 9216 KB Output is correct
57 Correct 18 ms 9216 KB Output is correct
58 Execution timed out 1081 ms 40696 KB Time limit exceeded
59 Halted 0 ms 0 KB -