답안 #863125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863125	2023-10-19T16:19:00 Z	Nikhil2946	Bigger segments (IZhO19_segments)	C++14	13 / 100	1 ms	500 KB

segments

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

#define ll long long int
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl

const ll N=5005;
const ll mod=1e9+7;

void upd(pair<int, int> &a, pair<int, int> b)
{
    if (a.first < b.first)
        a = b;
    if (a.first == b.first)
        a = min(a, b);
}

void solve()
{

     int n;
    cin>>n;
    vector<int>a(n),prf(n+1);
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        prf[i+1]=a[i]+prf[i];
    }
    vector<pair<int,int>>dp(n+1,{-1e9,0});
    dp[0]={0,0};
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            int vl = prf[j] - prf[i];
            if(dp[i].second<=vl)
            {
                pair<ll,ll> opt1=dp[j];
                pair<ll,ll> opt2={dp[i].first+1,vl};
                
                dp[j].first=max(opt1.first,opt2.first);

               // if opt1.first==opt2.first  then min value segment is preferable

                if(dp[j].first==opt2.first)  
                {
                    dp[j].second=opt2.second;
                }
                else
                {
                    dp[j].second=opt1.second;
                }
            }
        }
    }
    cout<<dp[n].first<<endl;

}

int main() {


    IOS;
    ll T;
    T=1;
    // cin >> T;
    while(T--){
    
    solve();
    }

    return 0;
}

Subtask #1

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct

Subtask #2

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	468 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	468 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	468 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	452 KB	Output is correct
5	Correct	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	460 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	452 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	468 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-