Submission #3430184


Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "vector"
#include "string"
#include "map"
#include "algorithm"
#include "functional"
#include "set"
#include "numeric"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;

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

	cin >> K;
	vector<string>ans;
	for (int loop = K; loop > 0; loop--) {
		cin >> N >> M >> L >> R;
		K = max(N, M) / (min(N, M)+1) + !!(max(N, M) % (min(N, M)+1));
		long long int l = 0;
		long long int r = min(M + 1, N / K + 1);
		while (r - l > 1) {
	//		cout << l << " " << r << endl;
			long long int mid = (r + l + 1) / 2;
			long long int n = N - mid * K;
			long long int m = M - (mid - 1);
			long long int box = min(m / K, n + 1);
			long long int nn = n - (box - 1);
			long long int mm = m - box * K;
	//		cout << "! " << n << " " << m << " " << nn << " " << mm << endl;
			if (!nn && !mm)l = mid;
			else if (!nn || !mm)r = mid;
			else if (mm > K)r = mid;
			else l = mid;
		}
		long long int n = N - l * K;
		long long int m = M - (l - 1);
		long long int box = min(m / K, n + 1);
		long long int nn = n - (box - 1);
		long long int mm = m - box * K;
		string ret;
	//	cout << K << " " << l << " " << box << endl;
		for (long long int i = L; i <= min(R,(K + 1)*l - 1); i++) {
			if (i % (K + 1))ret.push_back('A');
			else ret.push_back('B');
		}
		for (long long int i = max((K + 1)*l, L); i <= min(R, (K + 1)*l - 1 + mm); i++) {
			ret.push_back('B');
		}
		for (long long int i = max(L, (K + 1)*l + mm); i <= min(R, (K + 1)*l - 1 + mm + nn); i++) {
			ret.push_back('A');
		}
	//	cout << "hoge " << (K + 1)*l + mm + nn << endl;
		for (long long int i = max(L, (K + 1)*l + mm + nn); i <= R; i++) {
			if ((i - ((K + 1)*l + mm + nn)) % (K + 1) == K)ret.push_back('A');
			else ret.push_back('B');
		}
		ans.push_back(ret);
	}
	for (auto i : ans)cout << i << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Min Max Repetition
User olphe
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2016 Byte
Status WA
Exec Time 6 ms
Memory 512 KB

Judge Result

Set Name Sample Partial All
Score / Max Score 0 / 0 0 / 500 0 / 600
Status
AC × 1
AC × 6
WA × 9
AC × 13
WA × 18
Set Name Test Cases
Sample sample_01.txt
Partial sample_01.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt
All sample_01.txt, sample_01.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_2_01.txt, subtask_2_02.txt, subtask_2_03.txt, subtask_2_04.txt, subtask_2_05.txt, subtask_2_06.txt, subtask_2_07.txt, subtask_2_08.txt, subtask_2_09.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
subtask_1_01.txt WA 4 ms 384 KB
subtask_1_02.txt WA 4 ms 384 KB
subtask_1_03.txt AC 4 ms 384 KB
subtask_1_04.txt AC 5 ms 512 KB
subtask_1_05.txt AC 5 ms 512 KB
subtask_1_06.txt WA 4 ms 384 KB
subtask_1_07.txt WA 5 ms 512 KB
subtask_1_08.txt WA 5 ms 512 KB
subtask_1_09.txt WA 5 ms 512 KB
subtask_1_10.txt WA 5 ms 512 KB
subtask_1_11.txt WA 5 ms 512 KB
subtask_1_12.txt WA 5 ms 512 KB
subtask_1_13.txt AC 5 ms 512 KB
subtask_1_14.txt AC 5 ms 512 KB
subtask_2_01.txt AC 5 ms 384 KB
subtask_2_02.txt AC 5 ms 512 KB
subtask_2_03.txt WA 5 ms 384 KB
subtask_2_04.txt WA 5 ms 512 KB
subtask_2_05.txt WA 6 ms 512 KB
subtask_2_06.txt WA 6 ms 512 KB
subtask_2_07.txt WA 6 ms 512 KB
subtask_2_08.txt WA 5 ms 512 KB
subtask_2_09.txt WA 5 ms 512 KB
subtask_2_10.txt WA 5 ms 512 KB
subtask_2_11.txt WA 5 ms 512 KB
subtask_2_12.txt AC 5 ms 512 KB
subtask_2_13.txt AC 5 ms 512 KB
subtask_2_14.txt AC 5 ms 512 KB
subtask_2_15.txt AC 5 ms 512 KB