Submission #53416845
Source Code Expand
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pa first
#define pb second
#define endl '\n'
#define vint vector<int>
#define vlong vector<ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define per(i, a, b) for (int i = int(b - 1); i >= int(a); i--)
#define gnr(i, a, b) for (int i = int(b); i >= int(a); i--)
using namespace std;
#define ATC
#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif
#ifdef MT
void solve()
{
}
#endif
int main(void)
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string str;
cin >> str;
string seq;
bool state = false;
per(i, 0, n)
{
bool s = str[i] - '0';
if (s != state) {
rng(j, 0, i)
{
seq.push_back(state ? 'B' : 'A');
}
state = !state;
}
}
cout << seq.length() << endl;
cout << seq << endl;
#ifdef MT
int t;
cin >> t;
for (int i = 0; i < t; i++)
solve();
#endif
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Puzzle of Lamps |
| User | L1bra |
| Language | C++ 20 (gcc 12.2) |
| Score | 400 |
| Code Size | 1204 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3632 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 400 / 400 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample-01.txt |
| All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, sample-01.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| in01.txt | AC | 1 ms | 3500 KiB |
| in02.txt | AC | 1 ms | 3420 KiB |
| in03.txt | AC | 1 ms | 3444 KiB |
| in04.txt | AC | 1 ms | 3500 KiB |
| in05.txt | AC | 1 ms | 3548 KiB |
| in06.txt | AC | 1 ms | 3632 KiB |
| in07.txt | AC | 1 ms | 3508 KiB |
| in08.txt | AC | 1 ms | 3412 KiB |
| in09.txt | AC | 1 ms | 3444 KiB |
| sample-01.txt | AC | 1 ms | 3496 KiB |