답안 #290736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290736	2020-09-04T11:48:25 Z	Autoratch	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	384 KB

segments

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

const int N = 5e5 + 1;

long long n,s[N],dp[N],mn[N];
set<pair<long long,int> > res;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> n;
	for(int i = 1;i <= n;i++) cin >> s[i],s[i]+=s[i-1];
	for(int i = 1;i <= n;i++)
	{
	//	for(int j = 0;j+1 < res.size();j++) assert(res[j].first<=res[j+1].first);
		auto it = res.upper_bound(make_pair(s[i],INT_MAX));
		if(it==res.begin())
		{
			dp[i] = 1;
			mn[i] = s[i];
		}
		else
		{
			it--;
			int x = it->second;
			dp[i] = dp[x]+1;
			mn[i] = s[i]-s[x];
		}
		res.insert({mn[i]+s[i],i});
	}
	cout << dp[n];
}

Subtask #1

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Incorrect	0 ms	384 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #2

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Incorrect	0 ms	384 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Incorrect	0 ms	384 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Incorrect	0 ms	384 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #5

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Incorrect	0 ms	384 KB	Output isn't correct
11	Halted	0 ms	0 KB	-