oj.uz

답안 #927143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927143 2024-02-14T10:05:39 Z Whisper Maja (COCI18_maja) C++17
110 / 110
 471 ms 852 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e2  + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nRow, nCol, stX, stY, nStep;
int a[MAX][MAX];
int dp[MAX][MAX][2];

const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};

void Whisper(){
    cin >> nRow >> nCol >> stX >> stY >> nStep;
    nStep >>= 1;
    FOR(i, 1, nRow) FOR(j, 1, nCol) cin >> a[i][j];
    memset(dp, -0x3f, sizeof dp);
    dp[stX][stY][0] = 0;
    int step = min(nStep, nRow * nCol);
    for (int t = 0; t < step; ++t){
        int pre = (t & 1);
        int cur = !pre;
        FOR(x, 1, nRow) FOR(y, 1, nCol){
            for (int dir = 0; dir < 4; ++dir){
                int nx = x + dx[dir];
                int ny = y + dy[dir];
                if (nx < 1 || nx > nRow || ny < 1 || ny > nCol || dp[x][y][pre] < 0) continue;
                maximize(dp[nx][ny][cur], dp[x][y][pre] + a[nx][ny]);
            }
        }
        FOR(x, 1, nRow) FOR(y, 1, nCol) dp[x][y][pre] = -0x3f;
    }
    int res = 0;
    FOR(x, 1, nRow) FOR(y, 1, nCol){
        int rem = nStep - step;
        for (int dir = 0; dir < 4; ++dir){
            int nx = x + dx[dir];
            int ny = y + dy[dir];
            if (nx < 1 || nx > nRow || ny < 1 || ny > nCol || dp[x][y][step & 1] < 0) continue;
            maximize(res, 2ll * dp[x][y][step & 1] + rem * (a[nx][ny] + a[x][y]) - a[x][y]);
        }
    }
    cout << res;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 396 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 604 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 469 ms 852 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 604 KB Output is correct
2 Correct 350 ms 680 KB Output is correct
3 Correct 467 ms 744 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 301 ms 600 KB Output is correct
2 Correct 471 ms 752 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 640 KB Output is correct
2 Correct 33 ms 688 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 624 KB Output is correct
2 Correct 1 ms 604 KB Output is correct