Submission #240612

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
240612	2020-06-20T09:17:25 Z	GREGOIRELC	Building 4 (JOI20_building4)	C++14	11 / 100	30 ms	16256 KB

building4

#include <iostream>
#include <vector>

using namespace std;

const int T_MAX = 2001;

int nbBatiment;
int luxury[2 * T_MAX][2];
bool dp[2 * T_MAX][T_MAX][2];

int main()
{
	ios::sync_with_stdio(false);

	cin >> nbBatiment;
	for(int iBat = 1; iBat <= 2 * nbBatiment; iBat++)
	{
		cin >> luxury[iBat][0];
	}
	for(int iBat = 1; iBat <= 2 * nbBatiment; iBat++)
	{
		cin >> luxury[iBat][1];
	}
	dp[0][0][0] = true;
	dp[0][0][1] = true;
	for(int iBat = 0; iBat < 2 * nbBatiment; iBat++)
	{
		for(int nbAVu = 0; nbAVu <= nbBatiment; nbAVu++)
		{
			for(int curPos = 0; curPos < 2; curPos++)
			{
				if(dp[iBat][nbAVu][curPos])
				{
					if(luxury[iBat + 1][curPos] >= luxury[iBat][curPos])
					{
						dp[iBat + 1][nbAVu + (curPos + 1) % 2][curPos] = true;
					}
					if(luxury[iBat + 1][(curPos + 1) % 2] >= luxury[iBat][curPos])
					{
						dp[iBat + 1][nbAVu + curPos][(curPos + 1) % 2] = true;
					}
				}
			}
		}
	}
	//cout << dp[1][1][0] << endl;
	if(!dp[2 * nbBatiment][nbBatiment][0] && !dp[2 * nbBatiment][nbBatiment][1])
	{
		cout << -1 << endl;
		return 0;
	}
	int iBat = 2 * nbBatiment, nbAVu = nbBatiment, curPos = 0;
	if(dp[2 * nbBatiment][nbBatiment][1])
	{
		curPos = 1;
	}
	vector<char> reponse;
	while(iBat > 0)
	{
		reponse.push_back(char(int('A') + curPos));
		//cout << iBat << " " << nbAVu << " " << curPos << endl;
		if(luxury[iBat - 1][curPos] <= luxury[iBat][curPos] && dp[iBat - 1][nbAVu - (curPos + 1) % 2][curPos])
		{
			iBat--;
			nbAVu -= (curPos + 1) % 2;
		}
		else
		{
			iBat--;
			nbAVu -= (curPos + 1) % 2;
			curPos++;
			curPos %= 2;
		}
	}
	for(int i = reponse.size() - 1; i > -1; i--)
	{
		cout << reponse[i];
	}
	cout << endl;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	17 ms	512 KB	Output is correct
6	Correct	21 ms	14592 KB	Output is correct
7	Correct	19 ms	12928 KB	Output is correct
8	Correct	23 ms	13944 KB	Output is correct
9	Correct	22 ms	14208 KB	Output is correct
10	Correct	20 ms	12800 KB	Output is correct
11	Correct	21 ms	15104 KB	Output is correct
12	Correct	26 ms	16120 KB	Output is correct
13	Correct	24 ms	16128 KB	Output is correct
14	Correct	30 ms	16120 KB	Output is correct
15	Correct	29 ms	16128 KB	Output is correct
16	Correct	25 ms	16124 KB	Output is correct
17	Correct	26 ms	16120 KB	Output is correct
18	Correct	23 ms	16256 KB	Output is correct
19	Correct	24 ms	16128 KB	Output is correct
20	Correct	23 ms	16128 KB	Output is correct
21	Correct	22 ms	16128 KB	Output is correct
22	Correct	29 ms	16120 KB	Output is correct
23	Correct	27 ms	16128 KB	Output is correct
24	Correct	29 ms	16120 KB	Output is correct
25	Correct	25 ms	16128 KB	Output is correct
26	Correct	29 ms	16120 KB	Output is correct
27	Correct	25 ms	16128 KB	Output is correct
28	Correct	21 ms	14464 KB	Output is correct
29	Correct	26 ms	16128 KB	Output is correct
30	Correct	23 ms	14456 KB	Output is correct
31	Correct	28 ms	16128 KB	Output is correct
32	Correct	21 ms	13568 KB	Output is correct
33	Correct	26 ms	16120 KB	Output is correct

Subtask #2

0 / 89.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	17 ms	512 KB	Output is correct
6	Correct	21 ms	14592 KB	Output is correct
7	Correct	19 ms	12928 KB	Output is correct
8	Correct	23 ms	13944 KB	Output is correct
9	Correct	22 ms	14208 KB	Output is correct
10	Correct	20 ms	12800 KB	Output is correct
11	Correct	21 ms	15104 KB	Output is correct
12	Correct	26 ms	16120 KB	Output is correct
13	Correct	24 ms	16128 KB	Output is correct
14	Correct	30 ms	16120 KB	Output is correct
15	Correct	29 ms	16128 KB	Output is correct
16	Correct	25 ms	16124 KB	Output is correct
17	Correct	26 ms	16120 KB	Output is correct
18	Correct	23 ms	16256 KB	Output is correct
19	Correct	24 ms	16128 KB	Output is correct
20	Correct	23 ms	16128 KB	Output is correct
21	Correct	22 ms	16128 KB	Output is correct
22	Correct	29 ms	16120 KB	Output is correct
23	Correct	27 ms	16128 KB	Output is correct
24	Correct	29 ms	16120 KB	Output is correct
25	Correct	25 ms	16128 KB	Output is correct
26	Correct	29 ms	16120 KB	Output is correct
27	Correct	25 ms	16128 KB	Output is correct
28	Correct	21 ms	14464 KB	Output is correct
29	Correct	26 ms	16128 KB	Output is correct
30	Correct	23 ms	14456 KB	Output is correct
31	Correct	28 ms	16128 KB	Output is correct
32	Correct	21 ms	13568 KB	Output is correct
33	Correct	26 ms	16120 KB	Output is correct
34	Runtime error	7 ms	768 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
35	Halted	0 ms	0 KB	-