Submission #1160865


Source Code Expand

#include <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <cstring>
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <list>  
#include <cassert>
#include <ctime>
#include <climits>
using namespace std;  

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }

const int MAXN=200000;

int n,times;
char s[MAXN+1];
char ret[MAXN+1];

void run() {
	scanf("%d%d",&n,&times); scanf("%s",s);
	int at=0; bool inv=false;
	while(at!=n&&times>0) {
		char c=s[at]; if(inv) c='A'+(1-(c-'A'));
		--times; if(c=='A') s[at]='A'+(1-(s[at]-'A')); else ++at,inv=!inv;
	}
	int period=n%2==0?n:2*n;
	times%=period;
	if(times>0) {
		at=0;
		while(at!=n&&times>0) {
			char c=s[at]; if(inv) c='A'+(1-(c-'A'));
			--times; if(c=='A') s[at]='A'+(1-(s[at]-'A')); else ++at,inv=!inv;
		}
		assert(at<n);
	}
	REP(i,n) {
		int pos=(at+i)%n;
		char c=s[pos]; if(inv) c='A'+(1-(c-'A'));
		ret[i]=c;
	}
	ret[n]='\0'; printf("%s\n",ret);
}

int main() {
	run();
	return 0;
}

Submission Info

Submission Time
Task D - Half Reflector
User krijgertje
Language C++14 (GCC 5.4.1)
Score 900
Code Size 1516 Byte
Status AC
Exec Time 4 ms
Memory 768 KB

Compile Error

./Main.cpp: In function ‘void run()’:
./Main.cpp:40:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&times); scanf("%s",s);
                         ^
./Main.cpp:40:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&times); scanf("%s",s);
                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 50
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in5.txt, in543.txt, in557.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 1 ms 256 KB
in10.txt AC 3 ms 768 KB
in11.txt AC 4 ms 768 KB
in12.txt AC 3 ms 768 KB
in13.txt AC 3 ms 768 KB
in14.txt AC 4 ms 768 KB
in15.txt AC 3 ms 768 KB
in16.txt AC 3 ms 768 KB
in17.txt AC 3 ms 768 KB
in18.txt AC 3 ms 768 KB
in19.txt AC 3 ms 768 KB
in2.txt AC 2 ms 512 KB
in20.txt AC 3 ms 768 KB
in21.txt AC 3 ms 768 KB
in22.txt AC 4 ms 768 KB
in23.txt AC 4 ms 768 KB
in24.txt AC 4 ms 768 KB
in25.txt AC 4 ms 768 KB
in26.txt AC 4 ms 768 KB
in27.txt AC 4 ms 768 KB
in28.txt AC 3 ms 768 KB
in29.txt AC 3 ms 768 KB
in3.txt AC 3 ms 768 KB
in30.txt AC 3 ms 768 KB
in31.txt AC 3 ms 768 KB
in32.txt AC 3 ms 768 KB
in33.txt AC 3 ms 768 KB
in34.txt AC 4 ms 768 KB
in35.txt AC 4 ms 768 KB
in36.txt AC 4 ms 768 KB
in37.txt AC 4 ms 768 KB
in38.txt AC 4 ms 768 KB
in39.txt AC 3 ms 768 KB
in4.txt AC 4 ms 768 KB
in40.txt AC 3 ms 768 KB
in41.txt AC 3 ms 768 KB
in42.txt AC 3 ms 768 KB
in5.txt AC 4 ms 768 KB
in543.txt AC 3 ms 768 KB
in557.txt AC 3 ms 768 KB
in6.txt AC 1 ms 256 KB
in7.txt AC 3 ms 768 KB
in8.txt AC 4 ms 768 KB
in9.txt AC 3 ms 768 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB