oj.uz

Submission #167375

# Submission time Handle Problem Language Result Execution time Memory
167375 2019-12-07T18:44:16 Z L01 Miners (IOI07_miners) C++17
100 / 100
 276 ms 100960 KB 
#include <iostream>
using namespace std;
int tablapd[100005][4][4][4][4],tletras,letras[100005];
char letra;
int costo(int n1,int n2,int n3)
{
    if(n1==0 and n2==0)
        return 1;
    if(n1==0 and n2!=n3)
        return 2;
    if(n1==0 and n2==n3)
        return 1;
    if(n2==0 and n1!=n3)
        return 2;
    if(n2==0 and n1==n3)
        return 1;
    if(n1==n2 and n2==n3)
        return 1;
    if((n1==n2 and n1!=n3) or (n1==n3 and n1!=n2) or (n2==n3 and n1!=n2))
        return 2;
    if(n1!=n2 and n1!=n3 and n2!=n3)
        return 3;
}
int main()
{
    cin>>tletras;
    for(int i=1;i<=tletras;i++)
    {
        cin>>letra;
        if(letra=='M')
            letras[i]=1;
        if(letra=='B')
            letras[i]=2;
        if(letra=='F')
            letras[i]=3;
    }
    for(int i=tletras-1;i>=0;i--)
    {
        for(int a=0;a<=3;a++)
        {
            for(int b=0;b<=3;b++)
            {
                for(int c=0;c<=3;c++)
                {
                    for(int d=0;d<=3;d++)
                    {
                        int e=letras[i+1];
                        tablapd[i][a][b][c][d]=max(tablapd[i+1][b][e][c][d]+costo(a,b,e),tablapd[i+1][a][b][d][e]+costo(c,d,e));
                    }
                }
            }
        }
    }
    cout<<tablapd[0][0][0][0][0];
    return 0;
}

Compilation message

miners.cpp: In function 'int costo(int, int, int)':
miners.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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 376 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5388 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 10332 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 25536 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 75932 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 100960 KB Output is correct