oj.uz

Submission #520326

# Submission time Handle Problem Language Result Execution time Memory
520326 2022-01-29T13:13:12 Z MurotY Miners (IOI07_miners) C++14
36 / 100
 1500 ms 8300 KB 
#include <bits/stdc++.h>
#define ll long long
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
using namespace std;
const int N=1e6+7, M=1e9+7;
map <ll,ll> mp;	
int n;
string s;
ll ans=0;
void dfs(ll x, string a){
	mp[x]++;
	string b;
	for (int i=0;i<n;i++) if (mp[i] == 0) b=b+s[i];
	
	map <char,ll> mp1;
	ll res=0;
	//cout << a << "\n";
	for (int i=0;i<a.size();i++){
		if (i-1 >= 0) mp1[a[i-1]]=1;
		if (i-2 >= 0) mp1[a[i-2]]=1;
		mp1[a[i]]=1;
		res+=mp1['B']+mp1['F']+mp1['M'];
		mp1.clear();
	}
	mp1.clear();
	for (int i=0;i<b.size();i++){
		if (i-1 >= 0) mp1[b[i-1]]=1;
		if (i-2 >= 0) mp1[b[i-2]]=1;
		mp1[b[i]]=1;
		res+=mp1['B']+mp1['F']+mp1['M'];
		mp1.clear();
	}
	ans=max(ans, res);
	//if (res == 14) cout << a << " " << b <<"\n";
	for (int i=0;i<n;i++){
		if (i > x) dfs(i, a+s[i]);
	}
	mp[x]--;
	return ;
}
int main()
{
	cin >> n >> s;
	string q;
	q=q+s[0];
	dfs(0, q);
	cout << ans;
}

Compilation message

miners.cpp: In function 'void dfs(long long int, std::string)':
miners.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for (int i=0;i<a.size();i++){
      |               ~^~~~~~~~~
miners.cpp:28:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (int i=0;i<b.size();i++){
      |               ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 204 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 272 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 796 ms 268 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1577 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1594 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1587 ms 2624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1594 ms 8120 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1592 ms 6500 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1570 ms 5060 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1559 ms 8124 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1579 ms 8300 KB Time limit exceeded
2 Halted 0 ms 0 KB -