oj.uz

Submission #230171

# Submission time Handle Problem Language Result Execution time Memory
230171 2020-05-08T21:00:32 Z CaroLinda Miners (IOI07_miners) C++14
100 / 100
 262 ms 100728 KB 
#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#define mkt make_tuple
#define debug printf
#define all(x) x.begin(),x.end()
#define lp(i,a,b) for(int i = a ; i< b ; i++)
#define ss second
#define ff first
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mk make_pair

const int MAXN = 1e5+10 ;

using namespace std ;

int N ;
bool freq[4] ;
int dp[MAXN][4][4][4][4] ;
char str[MAXN] ;

int get(char c)
{
    if( c == 'B' ) return 1 ;
    return c == 'F' ? 2 : 3 ;
}

int _count()
{
    int cnt = 0 ;
    lp(i,1,4) cnt += freq[i] ;
    return cnt ;
}

int main()
{
    scanf("%d %s", &N , str ) ;

    for(int i = N-1 ; i >= 0 ; i-- )
        for(int j1 = 0 ; j1 < 4 ; j1 ++ )
            for(int j2 = 0 ; j2 < 4 ; j2 ++ )
                for(int g1 = 0 ; g1 < 4 ; g1 ++ )
                    for(int g2 = 0 ; g2 < 4 ; g2 ++ )
                    {
                        int &ptr = dp[i][j1][j2][g1][g2] ;
                        int x = get(str[i]) ;

                        freq[x] = true ;

                        //Decidi dar pro primeiro
                        freq[j1] = freq[j2] = true ;
                        ptr = max(ptr, _count() + dp[i+1][j2][x][g1][g2] ) ;
                        freq[j1] = freq[j2] = false ;

                        freq[x] = true ;

                        //Decidi dar pro segundo
                        freq[g1] = freq[g2] = true ;
                        ptr = max(ptr, _count() + dp[i+1][j1][j2][g2][x]) ;
                        freq[g1] = freq[g2] = false ;

                        freq[x] = false ;

                    }

    printf("%d\n" , dp[0][0][0][0][0] ) ;

}

Compilation message

miners.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
miners.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
miners.cpp: In function 'int main()':
miners.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s", &N , str ) ;
     ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1272 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5376 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 10368 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 25464 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 75640 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 100728 KB Output is correct