Submission #926438

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926438	2024-02-13T02:26:53 Z	Whisper	Go (COCI18_go)	C++17	100 / 100	167 ms	320852 KB

go

#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 = 2e3 + 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 nHouse, nPokemon, stPoint;
struct Data{
    int a, b, t;
    bool operator < (const Data& oth) const{
        return t < oth.t;
    }
    friend istream& operator >> (istream& cin, Data& a){
        cin >> a.a >> a.b >> a.t;
        return cin;
    }
} a[MAX];

int dp[101][101][MAX][2];

int go(int l, int r, int time, bool left){
    if (l < 1 || r > nPokemon) return 0;
    time = min(time, 2000ll);
    int &res = dp[l][r][time][left];
    if (~res) return res;
    res = 0;
    if (left){
        maximize(res, go(l - 1, r, time + abs(a[l].a - a[l - 1].a), left) + (a[l].t > time) * a[l].b);
        maximize(res, go(l, r + 1, time + abs(a[l].a - a[r + 1].a), !left) + (a[l].t > time) * a[l].b);
    }
    else{
        maximize(res, go(l, r + 1, time + abs(a[r].a - a[r + 1].a), left) + (a[r].t > time) * a[r].b);
        maximize(res, go(l - 1, r, time + abs(a[r].a - a[l - 1].a), !left) + (a[r].t > time) * a[r].b);
    }
    return res;
}
void Whisper(){
    cin >> nHouse >> stPoint >> nPokemon;
    for (int i = 1; i <= nPokemon; ++i) cin >> a[i];
    int ans = 0;
    memset(dp, -1, sizeof dp);
    for (int i = 1; i <= nPokemon; ++i){
        maximize(ans, go(i, i, abs(stPoint - a[i].a), 0));
        maximize(ans, go(i, i, abs(stPoint - a[i].a), 1));
    }
    cout << ans;
}


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

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	320596 KB	Output is correct
2	Correct	35 ms	320600 KB	Output is correct
3	Correct	35 ms	320596 KB	Output is correct
4	Correct	37 ms	320592 KB	Output is correct
5	Correct	60 ms	320592 KB	Output is correct
6	Correct	57 ms	320460 KB	Output is correct
7	Correct	94 ms	320604 KB	Output is correct
8	Correct	127 ms	320596 KB	Output is correct
9	Correct	159 ms	320852 KB	Output is correct
10	Correct	167 ms	320592 KB	Output is correct