제출 #1089718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089718		JanPham	Cake 3 (JOI19_cake3)	C++17	0 / 100	13 ms	32604 KiB

cake3

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fi first
#define se second
#define TranLeThanhTam "TranLeThanhTam"
#define all(v) v.begin(),v.end()
#define reset(a,i) memset(a,i,sizeof(a))
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i,a,b) for (int i = (a), _b = (b); i >= _b; --i)
#define compact(v) sort(all(v)), v.erase(unique(all(v)), end(v))
#define sz(v) (int) v.size()
#define MASK(i) (1 << (i))

typedef long long ll;
typedef long double lb;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

const int Thanh_Tam = 2 * 1e3 + 17;
const int inf = 1e9 + 17;
const long long infll = 1e18 + 17;
const int MOD = 1e9 + 7;
const int Log = 17;
const int dx[4] = {-1, 0, 0, 1};
const int dy[4] = {0, -1, 1, 0};
const int max_block_size = 270;
const ll P = 311;
const int maxA = 1e2 + 17;
const int addi = 1e9;
const char dir[4] = {'W', 'S', 'N', 'E'};
const int Mod[3] = {998244353, MOD, 759186269};

ll mul(ll a, ll b, ll mod);
ll binpow(ll a, ll b, ll mod)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1) res = mul(res,a,mod);
        b >>= 1;
        a = mul(a,a,mod);
    }
    return res;
}
ll add(ll a, ll b, ll mod) { return (a + b) % mod;                 }
ll sub(ll a, ll b, ll mod) { return (a - b + mod) % mod;          }
ll mul(ll a, ll b, ll mod) { return ((a % mod) * (b % mod)) % mod; }
ll div(ll a, ll b, ll mod) { return mul(a, binpow(b, mod - 2, mod), mod); }

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand_range(ll l, ll r){return uniform_int_distribution<ll>(l, r)(rng);}

int n,m;
ll dp[Thanh_Tam][Thanh_Tam];
ll v[Thanh_Tam], c[Thanh_Tam];
ll first_element[Thanh_Tam][Thanh_Tam];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    if (fopen(TranLeThanhTam".inp","r"))
    {
        freopen(TranLeThanhTam".inp","r",stdin);
        freopen(TranLeThanhTam".out","w",stdout);
    }   

    cin >> n >> m;
    FOR(i,1,n) cin >> v[i] >> c[i];

    memset(dp, -0x3f, sizeof(dp));
    FOR(i,1,n)
    {
        first_element[i][1] = i;
        dp[i][1] = v[i];
    }

    FOR(j,2,m)
        FOR(i,1,n)
            FOR(k, j - 1, i - 1)
            {
                ll tmp = dp[k][j - 1];
                tmp += abs(c[k] - c[first_element[k][j - 1]]) + v[i];
                tmp -= abs(c[i] - c[k]);
                tmp -= abs(c[i] - c[first_element[k][j - 1]]);
                if (dp[i][j] < tmp)
                {
                    dp[i][j] = tmp;
                    first_element[i][j] = first_element[k][j - 1];
                }
            }

    ll ans = 0;
    FOR(i,1,n) ans = max(ans, dp[i][m] + (m == 2) * abs(c[i] - c[first_element[i][m]]));
    cout << ans;
    return 0;
}

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

cake3.cpp: In function 'int main()':
cake3.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen(TranLeThanhTam".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         freopen(TranLeThanhTam".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 19
• Subtask 3: 0 / 76