oj.uz

Submission #129235

# Submission time Handle Problem Language Result Execution time Memory
129235 2019-07-11T21:45:53 Z arthurconmy Rice Hub (IOI11_ricehub) C++14
49 / 100
 23 ms 1656 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
using namespace std;

#ifndef ARTHUR_LOCAL
	#include "ricehub.h"
#endif

#ifdef ARTHUR_LOCAL
	#define ARTHUR_MAIN main
#endif

using ll = long long;

#define REP(i,a,b) \
for(ll i=int(a); i<=ll(b); i++)

#define len(x) ll(x.size())

int besthub(int R, int L, int X[], long long B)
{
	ll cur_budget = B + ll(L)*0;
	ll maxx=0;
	
	deque<ll> ahead;

	REP(i,0,R-1) ahead.push_back(X[i]);

	deque<ll> cur_behind;
	deque<ll> cur_ahead;

	cur_behind.push_back(ll(X[0]));
	ahead.pop_front();

	while(cur_budget>0 && !ahead.empty()) // add as many rices as we can
	{
		if(cur_budget >= ahead.front()-ll(X[0]))
		{
			cur_budget -= ahead.front()-ll(X[0]);

			// cout << X[0] << " " << ahead.front() << endl;

			cur_ahead.push_back(ahead.front());
			ahead.pop_front();
		}

		else break;
	}

	maxx=len(cur_behind)+len(cur_ahead);

	// cout << cur_behind.size() << " " << cur_ahead.size() << endl;

	REP(i,1,R-1)
	{
		cur_budget -= (len(cur_behind)-len(cur_ahead))*ll(X[i]-X[i-1]);

		// cout << "THE CURRENT BUDGET IS " << cur_budget << " " << cur_behind.size() << endl;
		
		// move X[i] from cur_ahead to cur_behind

		if(!cur_ahead.empty()) cur_ahead.pop_front();
		else ahead.pop_front();
		cur_behind.push_back(ll(X[i])); 

		while(cur_budget < 0) 
		{
			cur_budget += X[i]-cur_behind.front();
			cur_behind.pop_front();

			// cout << "HERE" << endl;
		}

		// cout << cur_budget << endl;

		while(cur_budget>0 && !ahead.empty() && ahead.front()-ll(X[i]) <= cur_budget)
		{
			cur_budget -= ahead.front()-ll(X[i]);
			cur_ahead.push_back(ahead.front());
			ahead.pop_front();
		}

		// cout << cur_budget << endl;
		// cout << X[i] << " " << len(cur_behind) << " " << len(cur_ahead) << endl;
		// cout << ahead.size() << endl;

		while(!ahead.empty() && !cur_behind.empty() && ahead.front() - ll(X[i]) <= ll(X[i]) - cur_behind.front())
		{
			cur_budget += ll(X[i]) + ll(X[i]) - cur_behind.front() - ahead.front();
			cur_behind.pop_front();
			cur_ahead.push_back(ahead.front());
			ahead.pop_front();

			while(cur_budget > 0 && !ahead.empty() && ahead.front()-ll(X[i]) <= cur_budget)
			{
				cur_budget -= ahead.front()-ll(X[i]);
				cur_ahead.push_back(ahead.front());
				ahead.pop_front();
			} // yikes a lot of while loops
		}

		// cout << cur_budget << endl;

		maxx=max(maxx,len(cur_behind)+len(cur_ahead));

		// cout << X[i] << " " << len(cur_behind) << " " << len(cur_ahead) << endl;
		// cout << cur_budget << endl;

		// cur_behind.push_front()
	}

	return maxx;
}

// int X[5];

// int ARTHUR_MAIN()
// {
// 	X[0]=1;
// 	X[1]=2;
// 	X[2]=10;
// 	X[3]=12;
// 	X[4]=14;

// 	cout << besthub(5,20,X,6) << endl;

// 	return 0;
// }

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Incorrect 2 ms 376 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 20 ms 1580 KB Output is correct
4 Correct 20 ms 1528 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 9 ms 888 KB Output is correct
7 Correct 17 ms 1528 KB Output is correct
8 Correct 18 ms 1528 KB Output is correct
9 Correct 10 ms 1016 KB Output is correct
10 Correct 9 ms 860 KB Output is correct
11 Correct 22 ms 1628 KB Output is correct
12 Correct 23 ms 1656 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 892 KB Output is correct
15 Correct 17 ms 1272 KB Output is correct
16 Correct 17 ms 1272 KB Output is correct
17 Correct 19 ms 1400 KB Output is correct
18 Correct 20 ms 1528 KB Output is correct
19 Correct 20 ms 1528 KB Output is correct
20 Correct 21 ms 1528 KB Output is correct