oj.uz

Submission #56113

# Submission time Handle Problem Language Result Execution time Memory
56113 2018-07-10T04:31:49 Z okaybody10 Miners (IOI07_miners) C++
100 / 100
 146 ms 101276 KB 
#include <bits/stdc++.h>
using namespace std;
const int mn=-1e9;
int dp[100007][4][4][4][4],cost[4][4][4]; // cost[i][j][k] = 음식이 i,j,k 순으로 들어왔을 경우 광부들로부터 얻을 수 있는 석탄의 량
int change[100007],n;
char s[100008];
int main()
{
    scanf("%d %s",&n,s);
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<max(i+1,3);j++)
        {
            for(int k=0;k<3;k++)
            {
                if(i==3) // 비어있는 경우 : 3, M : 0, B : 1, F : 2
                {
                    if(j==3) cost[i][j][k]=1; // 두 개다 비어있으므로 k의 종류에 상관없이 무조건 1
                    else cost[i][j][k]=1+(j!=k ? 1 : 0); // 한 개는 비어있지 않으므로 j랑 k가 동일한 종류라면 1, 그 외엔 2
                }
                else
                {
                    if(i!=j && j!=k && i!=k) cost[i][j][k]=3;
                    else if(i==j && j==k) cost[i][j][k]=1;
                    else cost[i][j][k]=2;
                }
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        if(s[i]=='M') change[i]=0;
        else if(s[i]=='B') change[i]=1;
        else change[i]=2;
    }
    for(int i=0;i<4;i++) for(int j=0;j<4;j++) for(int k=0;k<4;k++) for(int l=0;l<4;l++) dp[0][i][j][k][l]=mn;
    dp[0][3][3][3][3]=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<4;j++) for(int k=0;k<4;k++) for(int l=0;l<4;l++) for(int v=0;v<4;v++) dp[i+1][j][k][l][v]=mn;
        for(int j=0;j<4;j++) for(int k=0;k<4;k++) for(int l=0;l<4;l++) for(int v=0;v<4;v++)
        {
            if(dp[i][j][k][l][v]>=0)
            {
                dp[i+1][j][k][v][change[i]]=max(dp[i+1][j][k][v][change[i]],dp[i][j][k][l][v]+cost[l][v][change[i]]);
                dp[i+1][k][change[i]][l][v]=max(dp[i+1][k][change[i]][l][v],dp[i][j][k][l][v]+cost[j][k][change[i]]);
            }
        }
    }
    int ans=mn;
    for(int i=0;i<4;i++) for(int j=0;j<4;j++) for(int k=0;k<4;k++) for(int l=0;l<4;l++) ans=max(ans,dp[n][i][j][k][l]);
    return !printf("%d",ans);
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s",&n,s);
     ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 488 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 488 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1592 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5564 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 10556 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 25784 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 76052 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 101276 KB Output is correct