제출 #207976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207976		DodgeBallMan	Miners (IOI07_miners)	C++14	100 / 100	251 ms	1144 KiB

miners

#include <bits/stdc++.h>

using namespace std; 

int dp[2][4][4][4][4], a[101000];
int n, ans;
string s;
int cal( int a, int b, int c )
{
	int ret = 0;
	if(a == 1 || b == 1 || c == 1) ret++;
	if(a == 2 || b == 2 || c == 2) ret++;
	if(a == 3 || b == 3 || c == 3) ret++;
	return ret;
}
int main()
{
	scanf("%d",&n);
	cin >> s;
	for( int i = 1 ; i <= n ; i++ ){
		if( s[i-1] == 'M' )a[i] = 1;
		else if( s[i-1] == 'F' )a[i] = 2;
		else a[i] = 3;
	}
	for( int i = 0 ; i < 2 ; i++ )for( int j = 0 ; j < 4 ; j++ )for( int k = 0 ; k < 4 ; k++ )for( int l = 0 ; l < 4 ; l++ )for( int m = 0 ; m < 4 ; m++ )dp[i][j][k][l][m] = -999999999;
	dp[1][0][a[1]][0][0] = dp[1][0][0][0][a[1]] = 1;
	for( int i = 2 ; 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 m = 0 ; m < 4 ; m++ ){
			dp[i%2][l][a[i]][j][k] = max( dp[(i+1)%2][m][l][j][k] + cal( m, l, a[i] ), dp[i%2][l][a[i]][j][k] );
		}
		for( int j = 0 ; j < 4 ; j++ )for( int k = 0 ; k < 4 ; k++ )for( int l = 0 ; l < 4 ; l++ )for( int m = 0 ; m < 4 ; m++ ){
			dp[i%2][j][k][l][a[i]] = max( dp[(i+1)%2][j][k][m][l] + cal( m, l, a[i] ), dp[i%2][j][k][l][a[i]] );
		}
	}
	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%2][i][j][k][l] );
		}
	printf("%d",ans);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 7 / 7
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 8 / 8
• Subtask 12: 8 / 8