oj.uz

Submission #942444

# Submission time Handle Problem Language Result Execution time Memory
942444 2024-03-10T16:17:55 Z Cadoc Bigger segments (IZhO19_segments) C++14
37 / 100
 13 ms 5720 KB 
/*
    Author: Cadocx
    Codeforces: https://codeforces.com/profile/Kadoc
    VNOJ: oj.vnoi.info/user/Cadoc
*/

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

// input/output
#define fastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define el cout << '\n'
#define execute cerr << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << "s"
// #pragma GCC optimize("O2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
//data type
#define ll long long
#define ull unsigned long long
#define pii pair<int, ll>
#define pll pair<ll, ll>
#define piv pair<int, vector<int>>
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
//STL
#define sz(x) (int)(x).size()
#define for1(i,l,r) for(auto i = l; i <= r; i++)
#define for2(i,r,l) for(auto i = r; i >= l; i--)
#define forin(i,a) for(auto i : a)
#define pb push_back
#define eb emplace_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
//bitmask
#define bitcnt(n) __builtin_popcount(n)
#define mask(i) (1 << (i))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_on(n, i) ((n) | mask(i))
#define set_off(n, i) ((n) & ~mask(i))
//constant
#define N 100005
#define MOD 1000230007
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define base 31
#define Kadoc 0

bool maximize(int &a, int b){
    if(a < b) return a = b, 1;
    return 0;
}

int n, a[N];
ll s[N];

void Init(){
    cin >> n;
    for(int i=1; i<=n; ++i) cin >> a[i];
}

bool checkSubtask(){
    return n <= 10000;
}

namespace subtask{
    pii f[N];

    void solve(){
        for(int i=1; i<=n; ++i) s[i] = s[i-1] + a[i];

        for(int i=1; i<=n; ++i){
            for(int j=0; j<i; ++j){
                if(s[i] >= s[j] + f[j].se){
                    if(maximize(f[i].fi, f[j].fi + 1)) f[i].se = s[i] - s[j];
                    else if(f[i].fi == f[j].fi + 1) f[i].se = min(f[i].se, s[i] - s[j]);
                }
            }
        }

        cout << f[n].fi; el;
    }
}

namespace AC{
    pii f[N];

    int find(int l, int r){
        int id = l-1;
        int ans = -1;
        while(l <= r){
            int m = (l+r) >> 1;
            if(s[m] - s[id] >= f[id].se) ans = m, r = m-1;
            else l = m+1;
        }
        return ans;
    }

    void solve(){
        for(int i=1; i<=n; ++i) s[i] = s[i-1] + a[i];

        for(int i=1; i<=n; ++i) f[i] = pii(1, s[i]);

        for(int i=1; i<n; ++i){
            if(maximize(f[i+1].fi, f[i].fi)) f[i+1].se = f[i].se + a[i+1];
            else if(f[i+1].fi == f[i].fi + 1) f[i+1].se = min(f[i+1].se, f[i].se + a[i+1]);

            int x = find(i+1, n);
            if(maximize(f[x].fi, f[i].fi + 1)) f[x].se = s[x] - s[i];
            else if(f[x].fi == f[i].fi + 1) f[x].se = min(f[x].se, s[x] - s[i]);
        }

        cout << f[n].fi; el;
    }
}

void Solve(){
    if(checkSubtask()) return subtask::solve();
    AC::solve();
}

int main(){
    #define NAME "TASK"
    if(fopen(NAME".inp", "r")){
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }

    fastIO;
    
    if(Kadoc){
        int tc; cin >> tc;
        while(tc--){
            Init();
            Solve();
        }
    } else{
        Init();
        Solve();
    }
}

Compilation message

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 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 2396 KB Output is correct
12 Correct 1 ms 2396 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 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 2396 KB Output is correct
12 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2516 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2516 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2512 KB Output is correct
30 Correct 1 ms 2420 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 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 2396 KB Output is correct
12 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2516 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2516 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2512 KB Output is correct
30 Correct 1 ms 2420 KB Output is correct
31 Correct 3 ms 2396 KB Output is correct
32 Correct 6 ms 2396 KB Output is correct
33 Correct 7 ms 2396 KB Output is correct
34 Correct 5 ms 2580 KB Output is correct
35 Correct 5 ms 2548 KB Output is correct
36 Correct 8 ms 2524 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 3 ms 2396 KB Output is correct
39 Correct 7 ms 2396 KB Output is correct
40 Correct 7 ms 2532 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 5 ms 2396 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 5 ms 2392 KB Output is correct
45 Correct 5 ms 2392 KB Output is correct

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 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 2396 KB Output is correct
12 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2516 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2516 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2512 KB Output is correct
30 Correct 1 ms 2420 KB Output is correct
31 Correct 3 ms 2396 KB Output is correct
32 Correct 6 ms 2396 KB Output is correct
33 Correct 7 ms 2396 KB Output is correct
34 Correct 5 ms 2580 KB Output is correct
35 Correct 5 ms 2548 KB Output is correct
36 Correct 8 ms 2524 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 3 ms 2396 KB Output is correct
39 Correct 7 ms 2396 KB Output is correct
40 Correct 7 ms 2532 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 5 ms 2396 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 5 ms 2392 KB Output is correct
45 Correct 5 ms 2392 KB Output is correct
46 Correct 9 ms 4952 KB Output is correct
47 Correct 11 ms 5212 KB Output is correct
48 Correct 13 ms 5472 KB Output is correct
49 Correct 13 ms 5468 KB Output is correct
50 Correct 11 ms 5696 KB Output is correct
51 Incorrect 12 ms 5720 KB Output isn't correct
52 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 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 2396 KB Output is correct
12 Correct 1 ms 2396 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 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2516 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2516 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2512 KB Output is correct
30 Correct 1 ms 2420 KB Output is correct
31 Correct 3 ms 2396 KB Output is correct
32 Correct 6 ms 2396 KB Output is correct
33 Correct 7 ms 2396 KB Output is correct
34 Correct 5 ms 2580 KB Output is correct
35 Correct 5 ms 2548 KB Output is correct
36 Correct 8 ms 2524 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 3 ms 2396 KB Output is correct
39 Correct 7 ms 2396 KB Output is correct
40 Correct 7 ms 2532 KB Output is correct
41 Correct 5 ms 2396 KB Output is correct
42 Correct 5 ms 2396 KB Output is correct
43 Correct 6 ms 2396 KB Output is correct
44 Correct 5 ms 2392 KB Output is correct
45 Correct 5 ms 2392 KB Output is correct
46 Correct 9 ms 4952 KB Output is correct
47 Correct 11 ms 5212 KB Output is correct
48 Correct 13 ms 5472 KB Output is correct
49 Correct 13 ms 5468 KB Output is correct
50 Correct 11 ms 5696 KB Output is correct
51 Incorrect 12 ms 5720 KB Output isn't correct
52 Halted 0 ms 0 KB -