제출 #213500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
213500		tatyam	Miners (IOI07_miners)	C++17	100 / 100	699 ms	512 KiB

miners

#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3fffffff;
#define all(a) begin(a), end(a)
#define each(i,a) for(auto&& i : a)
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for(int i = 0; i < (n); ++i)
#define rep2(i, n) for(int i = 0; i < (n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }

inline constexpr int kinds(int a, int b, int c){
    int ans = 0;
    rep(i, 1, 4) if(a == i || b == i || c == i) ans++;
    return ans;
}
int main(){
    string s;
    cin >> s >> s;
    each(i, s){
        if(i == 'B') i = 1;
        else if(i == 'F') i = 2;
        else i = 3;
    }
    int dp[2][4][4][4][4];
    memset(dp[0], 0x80, sizeof(dp[0]));
    dp[0][0][0][0][0] = 0;
    int from = 0, to = 1;
    each(c, s){
        memset(dp[to], 0x80, sizeof(dp[to]));
        rep(a1, 4) rep(a2, 4) rep(b1, 4) rep(b2, 4){
            chmax(dp[to][a2][c][b1][b2], dp[from][a1][a2][b1][b2] + kinds(a1, a2, c));
            chmax(dp[to][a1][a2][b2][c], dp[from][a1][a2][b1][b2] + kinds(b1, b2, c));
        }
        from ^= 1;
        to ^= 1;
    }
    cout << *max_element(dp[from][0][0][0], dp[from][4][0][0]) << endl;
}

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

miners.cpp: In function 'int main()':
miners.cpp:33:31: warning: array subscript has type 'char' [-Wchar-subscripts]
             chmax(dp[to][a2][c][b1][b2], dp[from][a1][a2][b1][b2] + kinds(a1, a2, c));
                               ^
miners.cpp:34:39: warning: array subscript has type 'char' [-Wchar-subscripts]
             chmax(dp[to][a1][a2][b2][c], dp[from][a1][a2][b1][b2] + kinds(b1, b2, c));
                                       ^

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