oj.uz

Submission #57762

# Submission time Handle Problem Language Result Execution time Memory
57762 2018-07-16T03:09:35 Z gnoor Miners (IOI07_miners) C++17
100 / 100
 416 ms 101376 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

typedef unsigned char int8;

int8 mask=0x0f;

int8 ma(int8 x) {
	return x>>4;
}

int8 mb(int8 x) {
	return x&mask;
}

int8 comb(int8 a,int8 b) {
	a&=mask;
	b&=mask;
	return (a<<4)^b;
}

int8 cnt(int8 x) {
	bool mrk[4]={0,0,0,0};
	while (x) {
		mrk[x&3]=true;
		x>>=2;
	}
	return mrk[1]+mrk[2]+mrk[3];
}

int8 append(int8 x,int8 y) {
	return (x<<2)^y;	
}

int dp[100100][256];
int mp[256];

int main () {
	mp['M']=1;
	mp['B']=2;
	mp['F']=3;
	int n;
	scanf("%d",&n);
	char x;
	
	for (int i=0;i<100100;i++) {
		for (int j=0;j<256;j++) {
			dp[i][j]=0xc0000000;
		}
	}
	dp[0][0]=0;

	int8 newa,newb;
	for (int i=1;i<=n;i++) {
		scanf(" %c",&x);
		for (int j=0;j<256;j++) {
			//add a
			newa=comb(append(ma(j),mp[x]),mb(j));
			dp[i][newa]=max(dp[i][newa],dp[i-1][j]+cnt(append(ma(j),mp[x])));
			//add b
			newb=comb(ma(j),append(mb(j),mp[x]));
			dp[i][newb]=max(dp[i][newb],dp[i-1][j]+cnt(append(mb(j),mp[x])));
		}
	}		
	int ans=0;
	for (int i=0;i<256;i++) {
		ans=max(ans,dp[n][i]);
	}
	printf("%d\n",ans);
	return 0;
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:60:31: warning: array subscript has type 'char' [-Wchar-subscripts]
    newa=comb(append(ma(j),mp[x]),mb(j));
                               ^
miners.cpp:61:64: warning: array subscript has type 'char' [-Wchar-subscripts]
    dp[i][newa]=max(dp[i][newa],dp[i-1][j]+cnt(append(ma(j),mp[x])));
                                                                ^
miners.cpp:63:37: warning: array subscript has type 'char' [-Wchar-subscripts]
    newb=comb(ma(j),append(mb(j),mp[x]));
                                     ^
miners.cpp:64:64: warning: array subscript has type 'char' [-Wchar-subscripts]
    dp[i][newb]=max(dp[i][newb],dp[i-1][j]+cnt(append(mb(j),mp[x])));
                                                                ^
miners.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
miners.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c",&x);
   ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 100600 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 100788 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 100924 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 100924 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 100976 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 100976 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 100980 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 101156 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 101160 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 101272 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 101376 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 101376 KB Output is correct