oj.uz

Submission #646028

# Submission time Handle Problem Language Result Execution time Memory
646028 2022-09-28T14:01:09 Z ghostwriter Miners (IOI07_miners) C++14
100 / 100
 199 ms 100556 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
#define getid(x) (x == 'M'? 0 : x == 'F'? 1 : x == 'B'? 2 : 3)
#define cost(a, b, c) ((a != 3 && a != b && a != c) + (b != 3 && b != c) + (c != 3))
const int N = 1e5 + 2;
int n, d[N][4][4][4][4];
char s[N];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n) cin >> s[i];
    FOS(i, n, 1)
    FOR(s1, 0, 3)
    FOR(s2, 0, 3)
    FOR(s3, 0, 3)
    FOR(s4, 0, 3) {
    	int &rs = d[i][s1][s2][s3][s4], id = getid(s[i]);
    	rs = max(rs, d[i + 1][id][s1][s3][s4] + cost(id, s1, s2));
    	rs = max(rs, d[i + 1][s1][s2][id][s3] + cost(id, s3, s4));
    }
    cout << d[1][3][3][3][3];
    return 0;
}
/*
6
MBMFFB
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:61:5: note: in expansion of macro 'FOR'
   61 |     FOR(i, 1, n) cin >> s[i];
      |     ^~~
miners.cpp:33:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   33 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
miners.cpp:62:5: note: in expansion of macro 'FOS'
   62 |     FOS(i, n, 1)
      |     ^~~
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 's1' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:63:5: note: in expansion of macro 'FOR'
   63 |     FOR(s1, 0, 3)
      |     ^~~
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 's2' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:64:5: note: in expansion of macro 'FOR'
   64 |     FOR(s2, 0, 3)
      |     ^~~
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 's3' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:65:5: note: in expansion of macro 'FOR'
   65 |     FOR(s3, 0, 3)
      |     ^~~
miners.cpp:32:31: warning: unnecessary parentheses in declaration of 's4' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
miners.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(s4, 0, 3) {
      |     ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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