| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 473756 |
2021-09-16T08:17:06 Z |
dxz05 |
Miners (IOI07_miners) |
C++14 |
|
1500 ms |
588 KB |
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
#define MP make_pair
typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e5 + 3e2;
const int M = 522;
int f(char c){
return (c == 'M' ? 0 : c == 'F' ? 1 : 2);
}
void chmax(int &a, int b){
a = max(a, b);
}
int code(vector<int> v){
if (v.empty()) return 0;
if (v.size() == 1) return 1 + v[0];
if (v.size() == 2) return 4 + v[0] * 3 + v[1];
return 13 + v[0] * 9 + v[1] * 3 + v[2];
}
vector<int> decode(int x){
if (x == 0) return {};
x--;
if (x < 3) return {x};
x -= 3;
if (x < 9) return {x / 3, x % 3};
x -= 9;
return {x / 9, x / 3 % 3, x % 3};
}
int last, diff = 0;
void add(vector<int> &v, int x){
v.push_back(x);
if (v.size() > 3) v.erase(v.begin());
set<int> s;
for (int y : v) s.insert(y);
diff = s.size();
last = code(v);
}
int dp[2][40][40];
void solve(int TC) {
int n; string s;
cin >> n >> s;
for (int i = 0; i < 2; i++){
for (int j = 0; j < 40; j++){
for (int k = 0; k < 40; k++){
dp[i][j][k] = -INF;
}
}
}
int f0 = f(s[0]);
dp[0][f0 + 1][0] = dp[0][0][f0 + 1] = 1;
for (int i = 0; i < n - 1; i++){
int c = f(s[i + 1]);
int cur = 0;
for (int x = 0; x < 40; x++){
for (int y = 0; y < 40; y++){
cur = max(cur, dp[i % 2][x][y]);
vector<int> a = decode(x), b = decode(y);
add(a, c);
chmax(dp[1 - i % 2][last][y], dp[i % 2][x][y] + diff);
add(b, c);
chmax(dp[1 - i % 2][x][last], dp[i % 2][x][y] + diff);
}
}
debug(i, cur);
}
int ans = 0;
for (int i = 0; i < 40; i++){
for (int j = 0; j < 40; j++){
ans = max(ans, dp[(n - 1) % 2][i][j]);
}
}
cout << ans;
}
int main() {
startTime = clock();
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
// cin >> TC;
for (int test = 1; test <= TC; test++) {
debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
//cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
return 0;
}
Compilation message
miners.cpp: In function 'void solve(int)':
miners.cpp:19:20: warning: statement has no effect [-Wunused-value]
19 | #define debug(...) 42
| ^~
miners.cpp:112:9: note: in expansion of macro 'debug'
112 | debug(i, cur);
| ^~~~~
miners.cpp: In function 'int main()':
miners.cpp:19:20: warning: statement has no effect [-Wunused-value]
19 | #define debug(...) 42
| ^~
miners.cpp:141:9: note: in expansion of macro 'debug'
141 | debug(test);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
677 ms |
312 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1592 ms |
332 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1590 ms |
332 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1580 ms |
332 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1593 ms |
588 KB |
Time limit exceeded |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1598 ms |
588 KB |
Time limit exceeded |
