oj.uz

답안 #884248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884248 2023-12-07T03:24:17 Z pan Feast (NOI19_feast) C++17
12 / 100
 125 ms 12596 KB 
#include <bits/stdc++.h>


#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef long long ll;
struct node 
{
	ll prev, next, val;
};

struct compare
{
	bool operator() (pi const& a, pi const& b)
	{
		return a.first>b.first;
	}
};

int main()
{
	ll n,k,x;
	cin >> n >> k;
	vector<ll> food(1);
	cin >> food[0];
	for (ll i=1; i<n; ++i)
	{
		cin >> x;
      	if (x==0) continue;
		if ((x<0 && food.back()<0 ) || (x>0 && food.back()>0))
		{
			food[food.size()-1]+=x;
		}
		else
		{
			food.push_back(x);
		}
	}
	if (food[0]<0) food.erase(food.begin());
	if (food.back()<0) food.pop_back();
	
	//for (ll i=0; i<food.size(); ++i) cout << food[i] << endl;
	ll nowk = (food.size()+1)/2;
	priority_queue<pi, vector<pi>, compare> pq;
	vector<node> food2;
	for (ll i=0; i<food.size();i++)
	{
		node y;
		y.prev=i-1, y.next = i+1, y.val = food[i];
		food2.pb(y);
		pq.push(mp(abs(food[i]),i));
	}
	for (ll i=0; i<nowk-k; ++i)
	{
		//cout << "running " << i << endl;
		while (abs(food2[pq.top().second].val)!=abs(pq.top().first))
		{
			pq.pop();
		}
		ll ind=pq.top().second;
		pq.pop();
		node y= food2[ind];
		if (y.prev==-1)
		{
			ll n = y.next;
			food2[ind].val+=food2[n].val;
			food2[ind].prev = -1;
			food2[ind].next = food2[n].next;
			food2[n].val = -LLONG_MAX;
		}
		else if (y.next==food2.size())
		{
			ll p = y.prev;
			food2[ind].val+=food2[p].val;
			food2[ind].next = food2.size();
			food2[ind].prev = food2[p].next;
			food2[p].val = -LLONG_MAX;
		}
		else
		{
			ll p = y.prev, n = y.next;
			food2[ind].val+=food2[p].val+food2[n].val;
			food2[ind].prev = food2[p].prev;
			food2[ind].next = food2[n].next;
			food2[p].val = -LLONG_MAX;
			food2[n].val = -LLONG_MAX;
		}
		pq.push(mp(abs(food2[ind].val), ind));
	}
	ll ans=0;
	
	for (ll i=0; i<food2.size(); ++i) 
	{
		if (food2[i].val>0) ans+=food2[i].val;
	}
	cout << ans;

	return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:50:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for (ll i=0; i<food.size();i++)
      |               ~^~~~~~~~~~~~
feast.cpp:75:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   else if (y.next==food2.size())
      |            ~~~~~~^~~~~~~~~~~~~~
feast.cpp:96:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |  for (ll i=0; i<food2.size(); ++i)
      |               ~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 348 KB Output is correct
2 Correct 78 ms 348 KB Output is correct
3 Correct 80 ms 344 KB Output is correct
4 Correct 83 ms 348 KB Output is correct
5 Correct 79 ms 344 KB Output is correct
6 Correct 77 ms 348 KB Output is correct
7 Correct 78 ms 408 KB Output is correct
8 Correct 79 ms 344 KB Output is correct
9 Correct 78 ms 344 KB Output is correct
10 Correct 79 ms 344 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 344 KB Output is correct
2 Correct 42 ms 1432 KB Output is correct
3 Correct 41 ms 1520 KB Output is correct
4 Correct 42 ms 1360 KB Output is correct
5 Correct 79 ms 3224 KB Output is correct
6 Correct 45 ms 1780 KB Output is correct
7 Correct 43 ms 1432 KB Output is correct
8 Correct 81 ms 3152 KB Output is correct
9 Correct 81 ms 3156 KB Output is correct
10 Correct 42 ms 1304 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 125 ms 12596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 348 KB Output is correct
2 Correct 78 ms 348 KB Output is correct
3 Correct 80 ms 344 KB Output is correct
4 Correct 83 ms 348 KB Output is correct
5 Correct 79 ms 344 KB Output is correct
6 Correct 77 ms 348 KB Output is correct
7 Correct 78 ms 408 KB Output is correct
8 Correct 79 ms 344 KB Output is correct
9 Correct 78 ms 344 KB Output is correct
10 Correct 79 ms 344 KB Output is correct
11 Correct 41 ms 344 KB Output is correct
12 Correct 42 ms 1432 KB Output is correct
13 Correct 41 ms 1520 KB Output is correct
14 Correct 42 ms 1360 KB Output is correct
15 Correct 79 ms 3224 KB Output is correct
16 Correct 45 ms 1780 KB Output is correct
17 Correct 43 ms 1432 KB Output is correct
18 Correct 81 ms 3152 KB Output is correct
19 Correct 81 ms 3156 KB Output is correct
20 Correct 42 ms 1304 KB Output is correct
21 Incorrect 125 ms 12596 KB Output isn't correct
22 Halted 0 ms 0 KB -