제출 #893366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893366		vjudge1	Bigger segments (IZhO19_segments)	C++17	37 / 100	82 ms	186748 KiB

segments

#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 3e5+5;
ll a[N], dp[5005][5005], c[5005][5005];

void kigash() {
    ll n;
    cin>>n;
    for(ll i=1; i<=n; i++) cin>>a[i];
    dp[n][n] = c[n][n] = 1;
    for(ll i=n-1; i>=1; i--) {
        ll last = 0, k = i+1, sum = a[i+1];
        for(ll j=i; j<=n; j++) {
            if(j==n) {
                dp[i][j] = 1;
                break;
            }
            last += a[j];
            while(k<=n && sum<last) {
                k++;
                sum += a[k];
            }
            if(k<=n) dp[i][j] = c[j+1][k]+1;
            sum -= a[j+1];
            if(k==j+1) k++, sum += a[k];
            // ll mx = 0, cur = 0;
            // for(ll k=j+1; k<=n; k++) {
            //     cur += a[k];
            //     if(sum<=cur) mx = max(mx, dp[j+1][k]);
            // }
            // dp[i][j] = mx+1;
        }
        for(ll j=n; j>=i; j--) c[i][j] = max(c[i][j+1], dp[i][j]);
    }
    ll mx = 0;
    for(ll i=1; i<=n; i++) mx = max(mx, dp[1][i]);
    cout<<mx<<"\n";
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

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

segments.cpp: In function 'void freopen(std::string)':
segments.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27