oj.uz

Submission #57115

# Submission time Handle Problem Language Result Execution time Memory
57115 2018-07-14T04:36:07 Z PeppaPig Miners (IOI07_miners) C++14
100 / 100
 446 ms 1688 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int dp[2][4][4][4][4];
int n, arr[N];
string str;

int cnt(int x, int y, int z) {
	int ret = 0;
	for(int i = 1; i <= 3; i++) if(x == i || y == i || z == i) ret++;
	return ret;
}

int main() {
	scanf("%d", &n);
	cin >> str;
	for(int i = 0; i < n; i++) {
		if(str[i] == 'M') arr[i] = 1;
		else if(str[i] == 'F') arr[i] = 2;
		else arr[i] = 3;
	}

	int now = 0;

	for(int k = n - 1; k >= 0; k--) {
		for(int a = 0; a < 4; a++) for(int b = 0; b < 4; b++) for(int c = 0; c < 4; c++) for(int d = 0; d < 4; d++) 
			dp[now][a][b][c][d] = max(dp[1 - now][arr[k]][a][c][d] + cnt(arr[k], a, b), dp[1 - now][a][b][arr[k]][c] + cnt(arr[k], c, d));
		now = 1 - now;
	}	

	printf("%d", dp[1 - now][0][0][0][0]);

	return 0;
}

Compilation message

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.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 876 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 900 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 1108 KB Output is correct

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 1472 KB Output is correct

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 1688 KB Output is correct