oj.uz

답안 #944766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944766 2024-03-13T04:33:38 Z Baizho Bigger segments (IZhO19_segments) C++17
27 / 100
 36 ms 20312 KB 
    #include <bits/stdc++.h>
    using namespace std;
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
      
    #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
     
    // #pragma GCC optimize("Ofast,unroll-loops,fast-math")
    // #pragma GCC target("popcnt,sse3,avx")
     
     
    typedef long long ll;
    typedef unsigned long long ull;
    typedef long double ld;
    typedef pair<ll,ll> pll;
     
    #define sz size()
    #define ff first
    #define ss second
    #define all(a) a.begin(),a.end()
    #define pb push_back
     
    const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
    const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
    const int N = ll(5e5)+100;
    const int M = ll(2e5) + 100;
    const long long inf = 5e18;
    //const long double eps = 1e-15L;
     
    ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
     
    ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
     
    void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

    ll n, a[N], pr[N], dp[505][505];

    ll getsum(ll l, ll r) {
        return pr[r] - pr[l - 1];
    }

    void Baizho() {
        cin>>n;
        for(int i = 1; i <= n; i ++) {
            for(int j = 1; j <= n; j ++) dp[i][j] = -inf;
            cin>>a[i];
            pr[i] = pr[i - 1] + a[i];
            dp[i][i] = 1;
        }
        for(int i = 2; i <= n; i ++) {
            for(int j = 1; j < i; j ++) {
                // takes suffix i - j + 1 ... i
                int prev = i - j;
                for(int k = 1; k <= prev; k ++) {
                    if(getsum(prev - k + 1, prev) <= getsum(prev + 1, i)) dp[i][j] = max(dp[i][j], dp[prev][k] + 1);
                }
            }
        }
        ll ans = 0;
        for(int i = 1; i <= n; i ++) ans = max(ans, dp[n][i]);
        cout<<ans;
    }
     
    signed main() {     
    //  Freopen("nondec");
        ios_base::sync_with_stdio(false);   
        cin.tie(0);cout.tie(0); 
        // precalc();
        
        int ttt = 1;
       // cin>>ttt;
     
        for(int i=1; i<=ttt; i++) {Baizho(); }
    }

Compilation message

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

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 26 ms 4488 KB Output is correct
17 Correct 21 ms 4444 KB Output is correct
18 Correct 21 ms 4444 KB Output is correct
19 Correct 20 ms 4444 KB Output is correct
20 Correct 21 ms 4696 KB Output is correct
21 Correct 23 ms 4444 KB Output is correct
22 Correct 12 ms 4112 KB Output is correct
23 Correct 8 ms 3720 KB Output is correct
24 Correct 21 ms 4440 KB Output is correct
25 Correct 36 ms 4444 KB Output is correct
26 Correct 32 ms 4504 KB Output is correct
27 Correct 19 ms 4444 KB Output is correct
28 Correct 22 ms 4444 KB Output is correct
29 Correct 22 ms 4508 KB Output is correct
30 Correct 21 ms 4508 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 26 ms 4488 KB Output is correct
17 Correct 21 ms 4444 KB Output is correct
18 Correct 21 ms 4444 KB Output is correct
19 Correct 20 ms 4444 KB Output is correct
20 Correct 21 ms 4696 KB Output is correct
21 Correct 23 ms 4444 KB Output is correct
22 Correct 12 ms 4112 KB Output is correct
23 Correct 8 ms 3720 KB Output is correct
24 Correct 21 ms 4440 KB Output is correct
25 Correct 36 ms 4444 KB Output is correct
26 Correct 32 ms 4504 KB Output is correct
27 Correct 19 ms 4444 KB Output is correct
28 Correct 22 ms 4444 KB Output is correct
29 Correct 22 ms 4508 KB Output is correct
30 Correct 21 ms 4508 KB Output is correct
31 Runtime error 15 ms 20312 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 26 ms 4488 KB Output is correct
17 Correct 21 ms 4444 KB Output is correct
18 Correct 21 ms 4444 KB Output is correct
19 Correct 20 ms 4444 KB Output is correct
20 Correct 21 ms 4696 KB Output is correct
21 Correct 23 ms 4444 KB Output is correct
22 Correct 12 ms 4112 KB Output is correct
23 Correct 8 ms 3720 KB Output is correct
24 Correct 21 ms 4440 KB Output is correct
25 Correct 36 ms 4444 KB Output is correct
26 Correct 32 ms 4504 KB Output is correct
27 Correct 19 ms 4444 KB Output is correct
28 Correct 22 ms 4444 KB Output is correct
29 Correct 22 ms 4508 KB Output is correct
30 Correct 21 ms 4508 KB Output is correct
31 Runtime error 15 ms 20312 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2508 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 26 ms 4488 KB Output is correct
17 Correct 21 ms 4444 KB Output is correct
18 Correct 21 ms 4444 KB Output is correct
19 Correct 20 ms 4444 KB Output is correct
20 Correct 21 ms 4696 KB Output is correct
21 Correct 23 ms 4444 KB Output is correct
22 Correct 12 ms 4112 KB Output is correct
23 Correct 8 ms 3720 KB Output is correct
24 Correct 21 ms 4440 KB Output is correct
25 Correct 36 ms 4444 KB Output is correct
26 Correct 32 ms 4504 KB Output is correct
27 Correct 19 ms 4444 KB Output is correct
28 Correct 22 ms 4444 KB Output is correct
29 Correct 22 ms 4508 KB Output is correct
30 Correct 21 ms 4508 KB Output is correct
31 Runtime error 15 ms 20312 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -