# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520325 | 2022-01-29T13:06:55 Z | MurotY | Miners (IOI07_miners) | C++14 | 1500 ms | 11824 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(); 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']; } ans=max(ans, res); 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 61 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 270 ms | 276 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 560 ms | 272 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1584 ms | 256 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1588 ms | 2844 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1585 ms | 11824 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1584 ms | 7864 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1598 ms | 5532 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1585 ms | 7768 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1573 ms | 9784 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |