Submission #119697

#	Time	Username	Problem	Language	Result	Execution time	Memory
119697		eriksuenderhauf	Miners (IOI07_miners)	C++11	100 / 100	31 ms	768 KiB

miners

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
char str[MAXN];
int dp[2][20][20], a[MAXN], arr[300];

int main() {
	int n; ni(n);
	scanf("%s", str);
	for (int i = 0; i < n; i++) {
		if (str[i] == 'M')
			a[i+1] = 0;
		else if (str[i] == 'B')
			a[i+1] = 1;
		else
			a[i+1] = 2;
	}
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++)
			for (int k = 0; k < 3; k++) {
				set<int> tmp;
				tmp.insert(i); tmp.insert(j); tmp.insert(k);
				arr[9*i+3*j+k] = (int)tmp.size();
			}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 9; j++) {
			for (int k = 0; k < 9; k++) {
				dp[i&1][(3*j+a[i])%9][k] = max(dp[i&1][(3*j+a[i])%9][k], dp[(i&1)^1][j][k] + arr[3*j+a[i]]);
				dp[i&1][j][(3*k+a[i])%9] = max(dp[i&1][j][(3*k+a[i])%9], dp[(i&1)^1][j][k] + arr[3*k+a[i]]);
			}
		}
	}
	int ans = 0;
	for (int i = 0; i< 9; i++)
		for (int j = 0; j < 9; j++)
			ans = max(ans, dp[n&1][i][j]);
	pri(ans-6);
    return 0;
}

Compilation message (stderr)

miners.cpp: In function 'int main()':
miners.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
miners.cpp:41:9: note: in expansion of macro 'ni'
  int n; ni(n);
         ^~
miners.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", str);
  ~~~~~^~~~~~~~~~~

• 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