USACO月赛2020年02月铜组

T1 Bucket Brigade

#include <iostream>
#include <cmath>
using namespace std;

char a[10][10];
int bx, by;
int rx, ry;
int lx, ly;
int ans;

int main() {
	for (int i = 0; i < 10; i ++) {
		for (int j = 0; j < 10; j ++) {
			cin >> a[i][j];
			if (a[i][j] == 'B') {bx = i; by = j;}
			if (a[i][j] == 'R') {rx = i; ry = j;}
			if (a[i][j] == 'L') {lx = i; ly = j;}
		}
	}
	
	if (bx==rx && rx==lx) {
		if ( (ry-by)*(ry-ly) > 0 ) ans = abs(by-ly) - 1;
		else ans = abs(by-ly) + 1;
	}
	else if (by==ry && ry==ly) {
		if ( (rx-bx)*(rx-lx) > 0) ans = abs(bx-lx) - 1;
		else ans = abs(bx-lx) + 1;	
	}
	else ans = abs(bx-lx) + abs(by-ly) - 1;
	
	cout << ans;
		
	return 0;
} 

T2 Mad Scientist

#include <iostream>
using namespace std;

int main() {
	int n;
	string a, b;
	
	cin >> n >> a >> b;
	
	int ans = 0;
	for (int i = 0; i < n; i ++) {
		int j = i;
		while (j < n && a[j] != b[j]) j ++;
		
		if (j - i > 0) ans ++;
		
		i = j;
	}
	cout << ans;

	return 0;
}

T3 Swapity Swap

#include <iostream>
#include <algorithm>
using namespace std;

int n, k, c[105], cnt;
int a1, a2, b1, b2;

int main() {
	cin >> n >> k;
	cin >> a1 >> a2 >> b1 >> b2;
	
	for (int i = 1; i <= n; i ++) c[i] = i;
	
	while (true) {
		reverse(c+a1, c+1+a2);
		reverse(c+b1, c+1+b2);
		cnt ++;
		
		bool flag = true;
		for (int i = 1; i <= n; i ++) {
			if (c[i] != i) {
				flag = false;
				break;
			}
		}
		if (flag) break;
	}

	k %= cnt;
	for (int i = 1; i <= k; i ++) {
		reverse(c+a1, c+1+a2);
		reverse(c+b1, c+1+b2);		
	}
	
	for (int i = 1; i <= n; i ++) cout << c[i] << endl;

	return 0;
}