oj.uz

Submission #54586

# Submission time Handle Problem Language Result Execution time Memory
54586 2018-07-04T07:07:49 Z khsoo01 Miners (IOI07_miners) C++11
100 / 100
 351 ms 700 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 100005, inf = 1e9;

int n, dt[2][4][4][4][4];
char a[N];

int val (int A, int B, int C) {
	return  ((A == 1) | (B == 1) | (C == 1)) +
			((A == 2) | (B == 2) | (C == 2)) +
			((A == 3) | (B == 3) | (C == 3));
}

int main()
{
	scanf("%d%s",&n,a+1);
	for(int j=0;j<256;j++) {
		int A = j/64, B = j/16%4, C = j/4%4, D = j%4;
		dt[0][A][B][C][D] = -inf;
	}
	dt[0][0][0][0][0] = 0;
	for(int i=1;i<=n;i++) {
		int E = (a[i] == 'M')*1 + (a[i] == 'B')*2 + (a[i] == 'F')*3;
		for(int j=0;j<256;j++) {
			int A = j/64, B = j/16%4, C = j/4%4, D = j%4;
			dt[i%2][A][B][C][D] = -inf;
		}
		for(int j=0;j<256;j++) {
			int A = j/64, B = j/16%4, C = j/4%4, D = j%4, P = dt[1-i%2][A][B][C][D];
			dt[i%2][B][E][C][D] = max(dt[i%2][B][E][C][D], P + val(A, B, E));
			dt[i%2][A][B][D][E] = max(dt[i%2][A][B][D][E], P + val(C, D, E));
		}
	}
	int ans = 0;
	for(int j=0;j<256;j++) {
		int A = j/64, B = j/16%4, C = j/4%4, D = j%4;
		ans = max(ans, dt[n%2][A][B][C][D]);
	}
	printf("%d\n",ans);
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 592 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 600 KB Output is correct

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 684 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 700 KB Output is correct