Submission #3020423


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
inline int gi() {
    int x=0,o=1;
    char ch=getchar();
    while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
    if(ch=='-') o=-1,ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*o;
}
int main() {
    int Q;
    cin>>Q;
    while(Q--) {
	int A=gi(),B=gi(),C=gi(),D=gi(),k=(max(A,B)-1)/(min(A,B)+1)+1;
	int l=0,r=A+B,a,b;
	while(l<=r) {
	    int mid=(l+r)>>1;
	    a=A-mid/(k+1)*k-mid%(k+1),b=B-mid/(k+1);
	    if(1LL*a*k>=b) l=mid+1;
	    else r=mid-1;
	}
	a=A-r/(k+1)*k-r%(k+1),b=B-r/(k+1),r+=b-1LL*a*k+1;
	for(int i=C;i<=min(r,D);i++) putchar(i%(k+1)?'A':'B');
	for(int i=max(C,r+1);i<=D;i++) putchar((i-r)%(k+1)?'B':'A');
	puts("");
    }
    return 0;
}

Submission Info

Submission Time
Task D - Min Max Repetition
User Anson
Language C++14 (GCC 5.4.1)
Score 0
Code Size 839 Byte
Status WA
Exec Time 3 ms
Memory 384 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 × 14
WA × 17
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 1 ms 256 KB
subtask_1_02.txt WA 2 ms 256 KB
subtask_1_03.txt AC 2 ms 256 KB
subtask_1_04.txt AC 2 ms 384 KB
subtask_1_05.txt AC 3 ms 384 KB
subtask_1_06.txt WA 2 ms 256 KB
subtask_1_07.txt WA 2 ms 256 KB
subtask_1_08.txt WA 3 ms 384 KB
subtask_1_09.txt WA 3 ms 384 KB
subtask_1_10.txt WA 2 ms 384 KB
subtask_1_11.txt WA 2 ms 384 KB
subtask_1_12.txt WA 2 ms 384 KB
subtask_1_13.txt AC 2 ms 384 KB
subtask_1_14.txt AC 2 ms 384 KB
subtask_2_01.txt AC 2 ms 256 KB
subtask_2_02.txt AC 3 ms 384 KB
subtask_2_03.txt AC 2 ms 256 KB
subtask_2_04.txt WA 3 ms 256 KB
subtask_2_05.txt WA 3 ms 384 KB
subtask_2_06.txt WA 3 ms 384 KB
subtask_2_07.txt WA 3 ms 384 KB
subtask_2_08.txt WA 3 ms 384 KB
subtask_2_09.txt WA 3 ms 384 KB
subtask_2_10.txt WA 3 ms 384 KB
subtask_2_11.txt WA 3 ms 384 KB
subtask_2_12.txt AC 3 ms 384 KB
subtask_2_13.txt AC 3 ms 384 KB
subtask_2_14.txt AC 3 ms 384 KB
subtask_2_15.txt AC 3 ms 384 KB