oj.uz

답안 #948986

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948986 2024-03-18T18:09:39 Z Zena_Hossam Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 500 ms 1048576 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
using namespace std;
namespace __gnu_pbds
{
typedef tree<ll,
        null_type,
        less_equal<ll>,
        rb_tree_tag,
        tree_order_statistics_node_update> ordered_set;
}
using namespace __gnu_pbds;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double

#define ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    //cin>>T;ll oo=0;

    ll n;
    cin>>n;
    string s;
    cin>>s;
    map<ll,ll>m;
    map<ll,map<ll,ll>>d;
    ll arr[n];
    ll o[3][n];
    o[0][0]=0;
    o[1][0]=0;
    o[2][0]=0;
    for(ll i=0; i<n; i++)
    {
        ll a=0;
        if(s[i]=='R')a=0;
        else if(s[i]=='G')a=1;
        else a=2;
        m[a]++;
        d[a][m[a]]=i;

        if(i)
        {
            o[0][i]=o[0][i-1];
            o[1][i]=o[1][i-1];
            o[2][i]=o[2][i-1];
        }
        o[a][i]+=1;
    }
    ll dp[n+5][m[0]+5][m[1]+5][m[2]+5][5];
    for(ll a=0; a<=m[0]+4; a++)
    {
        for(ll b=0; b<=m[1]+4; b++)
        {
            for(ll c=0; c<=m[2]+4; c++)
            {
                for(ll i=0; i<=n+4; i++)
                {
                    for(ll j=0; j<=4; j++)
                        dp[i][a][b][c][j]=1e18;
                }
            }
        }
    }
    dp[0][0][0][0][1]=0;
    dp[0][0][0][0][0]=0;
    dp[0][0][0][0][2]=0;
    for(ll i=0; i<n; i++)
    {
        for(ll a=0; a<=m[0]; a++)
        {
            for(ll b=0; b<=m[1]; b++)
            {
                ll c=i-a-b;
                if(c<=m[2]&&c>=0)
                {
                    ll xx=0,yy=0,zz=0;
                    ll mx;
                    mx=(d[2][c+1]);
                    xx=max(0ll,c-o[2][mx]);
                    yy=max(0ll,b-o[1][mx]);
                    zz=max(0ll,a-o[0][mx]);

                    dp[i+1][a][b][c+1][2]=min(dp[i+1][a][b][c+1][2],dp[i][a][b][c][0]+abs(d[2][c+1]+xx+yy+zz-i));
                    dp[i+1][a][b][c+1][2]=min(dp[i+1][a][b][c+1][2],dp[i][a][b][c][1]+abs(d[2][c+1]+xx+yy+zz-i));

                    mx=(d[1][b+1]);
                    xx=max(0ll,c-o[2][mx]);
                    yy=max(0ll,b-o[1][mx]);
                    zz=max(0ll,a-o[0][mx]);

                    dp[i+1][a][b+1][c][1]=min(dp[i+1][a][b+1][c][1],dp[i][a][b][c][0]+abs(d[1][b+1]+xx+yy+zz-i));
                    dp[i+1][a][b+1][c][1]=min(dp[i+1][a][b+1][c][1],dp[i][a][b][c][2]+abs(d[1][b+1]+xx+yy+zz-i));
                    mx=(d[0][a+1]);
                    xx=max(0ll,c-o[2][mx]);
                    yy=max(0ll,b-o[1][mx]);
                    zz=max(0ll,a-o[0][mx]);

                    dp[i+1][a+1][b][c][0]=min(dp[i+1][a+1][b][c][0],dp[i][a][b][c][2]+abs(d[0][a+1]+xx+yy+zz-i));
                    dp[i+1][a+1][b][c][0]=min(dp[i+1][a+1][b][c][0],dp[i][a][b][c][1]+abs(d[0][a+1]+xx+yy+zz-i));
                    //}
                }
            }
        }
    }
    for(ll i=0; i<=n; i++)
    {
        for(ll a=0; a<=m[0]; a++)
        {
            for(ll b=0; b<=m[1]; b++)
            {
                ll c=i-a-b;
               // if(c<=m[2])cout<<dp[n][m[0]][m[1]][m[2]][0]<<" "<<dp[n][m[0]][m[1]][m[2]][1]<<" "<<dp[n][m[0]][m[1]][m[2]][2]<<"\n";
            }
        }
    }
    if(min({dp[n][m[0]][m[1]][m[2]][0],dp[n][m[0]][m[1]][m[2]][1],dp[n][m[0]][m[1]][m[2]][2]})==1e18)cout<<-1;
    else
        cout<<min({dp[n][m[0]][m[1]][m[2]][0],dp[n][m[0]][m[1]][m[2]][1],dp[n][m[0]][m[1]][m[2]][2]});
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:119:20: warning: unused variable 'c' [-Wunused-variable]
  119 |                 ll c=i-a-b;
      |                    ^
joi2019_ho_t3.cpp:35:8: warning: unused variable 'arr' [-Wunused-variable]
   35 |     ll arr[n];
      |        ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 944 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 604 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 944 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 25 ms 39516 KB Output is correct
19 Correct 25 ms 39272 KB Output is correct
20 Correct 28 ms 38748 KB Output is correct
21 Correct 25 ms 39932 KB Output is correct
22 Correct 24 ms 35676 KB Output is correct
23 Correct 30 ms 39516 KB Output is correct
24 Correct 22 ms 34648 KB Output is correct
25 Correct 14 ms 17752 KB Output is correct
26 Correct 12 ms 18524 KB Output is correct
27 Correct 25 ms 35416 KB Output is correct
28 Correct 30 ms 40028 KB Output is correct
29 Correct 26 ms 39772 KB Output is correct
30 Correct 25 ms 39260 KB Output is correct
31 Correct 25 ms 38748 KB Output is correct
32 Correct 27 ms 39260 KB Output is correct
33 Correct 16 ms 19836 KB Output is correct
34 Correct 19 ms 23384 KB Output is correct
35 Correct 21 ms 33884 KB Output is correct
36 Correct 31 ms 37212 KB Output is correct
37 Correct 21 ms 32344 KB Output is correct
38 Correct 24 ms 37348 KB Output is correct
39 Correct 29 ms 39772 KB Output is correct
40 Correct 10 ms 14184 KB Output is correct
41 Correct 14 ms 19804 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 693 ms 1048576 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 944 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 25 ms 39516 KB Output is correct
19 Correct 25 ms 39272 KB Output is correct
20 Correct 28 ms 38748 KB Output is correct
21 Correct 25 ms 39932 KB Output is correct
22 Correct 24 ms 35676 KB Output is correct
23 Correct 30 ms 39516 KB Output is correct
24 Correct 22 ms 34648 KB Output is correct
25 Correct 14 ms 17752 KB Output is correct
26 Correct 12 ms 18524 KB Output is correct
27 Correct 25 ms 35416 KB Output is correct
28 Correct 30 ms 40028 KB Output is correct
29 Correct 26 ms 39772 KB Output is correct
30 Correct 25 ms 39260 KB Output is correct
31 Correct 25 ms 38748 KB Output is correct
32 Correct 27 ms 39260 KB Output is correct
33 Correct 16 ms 19836 KB Output is correct
34 Correct 19 ms 23384 KB Output is correct
35 Correct 21 ms 33884 KB Output is correct
36 Correct 31 ms 37212 KB Output is correct
37 Correct 21 ms 32344 KB Output is correct
38 Correct 24 ms 37348 KB Output is correct
39 Correct 29 ms 39772 KB Output is correct
40 Correct 10 ms 14184 KB Output is correct
41 Correct 14 ms 19804 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Execution timed out 693 ms 1048576 KB Time limit exceeded
44 Halted 0 ms 0 KB -