oj.uz

답안 #129234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129234 2019-07-11T21:37:26 Z arthurconmy 쌀 창고 (IOI11_ricehub) C++14
49 / 100
 21 ms 2168 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(int i=int(a); i<=int(b); i++)

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

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

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

	deque<int> cur_behind;
	deque<int> cur_ahead;

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

	while(cur_budget>0 && !ahead.empty())
	{
		if(cur_budget >= ll(ahead.front()-X[0]))
		{
			cur_budget -= ll(ahead.front()-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 -= ll(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(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()-X[i] <= cur_budget)
		{
			cur_budget -= ahead.front()-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() - X[i] <= X[i] - cur_behind.front())
		{
			cur_budget += X[i] + 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()-X[i] <= cur_budget)
			{
				cur_budget -= ahead.front()-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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 Incorrect 2 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 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 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 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 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 636 KB Output is correct
3 Correct 20 ms 1400 KB Output is correct
4 Correct 20 ms 1400 KB Output is correct
5 Correct 10 ms 988 KB Output is correct
6 Correct 12 ms 1016 KB Output is correct
7 Correct 16 ms 1232 KB Output is correct
8 Correct 17 ms 1400 KB Output is correct
9 Correct 9 ms 1016 KB Output is correct
10 Correct 9 ms 1016 KB Output is correct
11 Correct 21 ms 1400 KB Output is correct
12 Correct 21 ms 1400 KB Output is correct
13 Correct 11 ms 1016 KB Output is correct
14 Correct 10 ms 1144 KB Output is correct
15 Correct 16 ms 1784 KB Output is correct
16 Correct 17 ms 1656 KB Output is correct
17 Correct 19 ms 1976 KB Output is correct
18 Correct 19 ms 2040 KB Output is correct
19 Correct 20 ms 2168 KB Output is correct
20 Correct 20 ms 2040 KB Output is correct