제출 #109238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109238		amiratou	Miners (IOI07_miners)	C++14	68 / 100	1573 ms	92528 KiB

miners

#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)x.size()
#define ll long long
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 1000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
int code(char car){
	if(car=='M')return 0;
	if(car=='F')return 1;
	return 2;
}
int n,last1,last2;
string ph;
map<pair<pair<string,string>,int>,int> dp;
string change(string p){
	int idx;
	if(sz(p)<2)return p;
	return string (1,p[1]);
}
int solve(string mine1,string mine2,int idx){
	//debug(mine1);
	if(idx==n)return 0;
	if(dp.find({{mine1,mine2},idx})!=dp.end())
		return dp[{{mine1,mine2},idx}];
	set<char> myset;
	for (int i = 0; i < sz(mine1); ++i)
		myset.insert(mine1[i]);
	myset.insert(ph[idx]);
	int ans=sz(myset)+solve(change(mine1)+string(1,ph[idx]),mine2,idx+1);
	myset.clear();
	for (int i = 0; i < sz(mine2); ++i)
		myset.insert(mine2[i]);
	myset.insert(ph[idx]);
	ans=max(ans,sz(myset)+solve(mine1,change(mine2)+string(1,ph[idx]),idx+1));
	return dp[{{mine1,mine2},idx}]=ans;
}
int main(){
	boost;
	char car;
	cin>>n>>ph;
	cout<<solve("","",0);
	return 0;
}
//long long
//array bounds
//special cases
//binary search

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

miners.cpp: In function 'std::__cxx11::string change(std::__cxx11::string)':
miners.cpp:31:6: warning: unused variable 'idx' [-Wunused-variable]
  int idx;
      ^~~
miners.cpp: In function 'int main()':
miners.cpp:54:7: warning: unused variable 'car' [-Wunused-variable]
  char car;
       ^~~

• 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: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8