Submission #1160506

---

Source Code Expand

/*****************************************************/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

#define   offcin        ios::sync_with_stdio(false)
#define   DEBUG         freopen("#.txt", "r", stdin)
#define   sigma_size    26
#define   lson          l,m,v<<1
#define   rson          m+1,r,v<<1|1
#define   slch          v<<1
#define   srch          v<<1|1
#define   ll            long long
#define   ull           unsigned long long
#define   lowbit(x)     (x&-x)

const int    INF    = 0x3f3f3f3f;
const ll     INFF   = 1e18;
const double pi     = acos(-1.0);
const double inf    = 1e18;
const double eps    = 1e-9;
const ll     mod    = 1e9+7;
const int    maxmat = 10;
const ull    BASE   = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
inline ll bits(ll x) {
      return !x ? x : bits(x - lowbit(x)) + 1;
}
/*****************************************************/

const int maxn = 1e6 + 5;
const char a[] = {'A', 'B'};

char s[maxn];

int main(int argc, char const *argv[]) {
    int N, K;
    cin>>N>>K;
    scanf("%s", s);

    int front = 0, last = N;
    bool flag = false;
    if (K <= 2 * N) {
        for (int i = 0; i < K; i ++) {
            if (s[front] == a[flag]) s[front] = a[flag ^ 1];
            else {
                front ++;
                flag ^= 1;
                s[last ++] = a[flag];
                s[last] = 0;
            }
        }
    }
    else {
        K -= 2 * N;
        K %= 2;
        for (int i = 0; i < 2 * N; i ++) {
            if (s[front] == a[flag]) s[front] = a[flag ^ 1];
            else {
                front ++;
                flag ^= 1;
                s[last ++] = a[flag];
                s[last] = 0;
            }
        }
        if (K) {
            if (s[front] == a[flag]) s[front] = a[flag ^ 1];
            else {
                front ++;
                flag ^= 1;
                s[last ++] = a[flag];
                s[last] = 0;
            }
        }
    }

    if (flag) {
        for (int i = front; i < last; i ++)
            s[i] = s[i] == 'A' ? 'B' : 'A';
    }

    printf("%s\n", s + front);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:59:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s);
                   ^

Judge Result