oj.uz

답안 #643512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
643512 2022-09-22T08:23:21 Z BackNoob Retro (COCI17_retro) C++14
58 / 100
 377 ms 21364 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 1e6 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

int n;
int m;
char a[307][307];
int dp[2][307][157];
string trace[2][307][157];

void upd(string &a, string &b, char c = ' ')
{
    int cnt = 0;
    if(c != ' ') cnt = 1;
    else cnt = 0;
    if(sz(a) > sz(b) + cnt) return;
    if(sz(a) < sz(b) + cnt) {
        a = b;
        if(cnt > 0) a += c;
    }
    else {
        for(int i = 0; i < sz(a) - cnt; i++) {
            if(a[i] == b[i]) continue;
            if(a[i] > b[i]) {
                a = b;
                if(cnt > 0) a += c;
            }
            return;
        }
        if(cnt == 1) {
            if(a[sz(a) - 1] == c) return;
            if(a[sz(a) - 1] > c) {
                a = b;
                a += c;
            }
        }
    }
}

void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= m; j++) cin >> a[i][j];

    pair<int, int> pos;
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= m; j++) if(a[i][j] == 'M') pos = make_pair(i, j);

    memset(dp, -0x3f, sizeof(dp));
    int tmp = dp[0][0][0];

    int res = 0;
    string ans = "";
    dp[n & 1][pos.se][0] = 0;
    for(int i = n; i > 1; i--) {
        int cur = (i & 1);
        int nxt = ((i - 1) & 1);
        for(int j = 1; j <= m; j++) {
            for(int k = 0; k <= n / 2; k++) {
                if(dp[cur][j][k] == tmp) continue;
                for(int d = -1; d <= 1; d++) {
                    if(j + d >= 1 && j + d <= m) {
                        if(a[i - 1][j + d] == '*') {
                            if(k == 0) {
                                if(maximize(res, dp[cur][j][k]) == true || res == dp[cur][j][k]) {
                                    upd(ans, trace[cur][j][k]);
                                }
                            }
                            continue;
                        }
                        if(a[i - 1][j + d] == '(') {
                            if(maximize(dp[nxt][j + d][k + 1], dp[cur][j][k] + 1) == true || dp[nxt][j + d][k + 1] == dp[cur][j][k] + 1) {
                                upd(trace[nxt][j + d][k + 1], trace[cur][j][k], '(');
                            }
                        }
                        if(a[i - 1][j + d] == ')') {
                            if(k > 0) {
                                if(maximize(dp[nxt][j + d][k - 1], dp[cur][j][k] + 1) == true || dp[nxt][j + d][k - 1] == dp[cur][j][k] + 1)
                                    upd(trace[nxt][j + d][k - 1], trace[cur][j][k], ')');
                            }
                        }
                        if(a[i - 1][j + d] == '.') {
                            if(maximize(dp[nxt][j + d][k], dp[cur][j][k]) == true && dp[nxt][j + d][k] == dp[cur][j][k])
                                upd(trace[nxt][j + d][k], trace[cur][j][k]);
                        }
                    }
                }
                dp[cur][j][k] = tmp;
                trace[cur][j][k].clear();
            }
        }
    }

    int id = -1;
    for(int j = 1; j <= m; j++) {
        if(maximize(res, dp[1][j][0]) == true || res == dp[1][j][0]) {
            upd(ans, trace[1][j][0]);
        }
    }

    cout << res << endl;
    cout << ans;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("task.inp", "r", stdin);
    //freopen("graph.out", "w", stdout);


    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}

Compilation message

retro.cpp: In function 'void solve()':
retro.cpp:120:9: warning: unused variable 'id' [-Wunused-variable]
  120 |     int id = -1;
      |         ^~

Subtask #1
58.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3668 KB Output is correct
2 Correct 2 ms 3668 KB Output is correct
3 Partially correct 2 ms 3668 KB Partially correct
4 Correct 2 ms 3624 KB Output is correct
5 Correct 2 ms 3668 KB Output is correct
6 Correct 5 ms 3924 KB Output is correct
7 Partially correct 5 ms 4052 KB Partially correct
8 Partially correct 4 ms 3924 KB Partially correct
9 Partially correct 7 ms 4136 KB Partially correct
10 Correct 9 ms 4180 KB Output is correct
11 Partially correct 267 ms 16540 KB Partially correct
12 Partially correct 185 ms 15128 KB Partially correct
13 Partially correct 87 ms 9164 KB Partially correct
14 Partially correct 73 ms 8792 KB Partially correct
15 Partially correct 377 ms 20664 KB Partially correct
16 Partially correct 277 ms 18004 KB Partially correct
17 Partially correct 260 ms 16600 KB Partially correct
18 Partially correct 202 ms 14412 KB Partially correct
19 Partially correct 364 ms 21364 KB Partially correct
20 Partially correct 299 ms 17980 KB Partially correct