| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 151629 | shdut | List of Unique Integers (FXCUP4_unique) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#include <assert.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define per(i, a, b) for(int i = b - 1; i >= a; i--)
#define ll long long
#define x first
#define y second
#define vi vector<int>
#define pii pair<int, int>
#define SZ(x) (int)(x.size())
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define inf 1000000007
#define DBG(x) cerr << (#x) << "=" << x << "\n";
#define N 100005
template<typename U, typename V> void Min(U &a, const V &b){if(a > b) a = b;}
template<typename U, typename V> void Max(U &a, const V &b){if(a < b) a = b;}
template<typename U, typename V> void add(U &a, const V &b){a = (a+b) % mod;}
ll a, b, c, d, mi, mx;
string ans;
void go(ll x, ll y, string s){
if(x == a && y == b){
ans = min(ans, s);
return;
}
if((x+y)%2 || min(x, y) > mi || max(x, y) < mx)return;
go(x, (x+y)/2, "A" + s);
go((x+y)/2, y, "B" + s);
}
int main(){
int T, n, K, m, k, j;
scanf("%d", &T);
string s;
while(T--){
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
ans = "C";
s = "";
mi = min(a, b);
mx = max(a, b);
go(c, d, s);
if(ans[0] != 'C'){
puts("Yes");
puts(ans.c_str());
}
else puts("No");
}
}