USACO月赛2019年02月铜组

T1 Sleepy Cow Herding

#include <iostream>
using namespace std;

int main() {
	int a, b, c;
	cin >> a >> b >> c;
	
	if (a > b) swap(a, b);
	if (b > c) swap(b, c);
	if (a > b) swap(a, b);
	
	if (c==a+2) cout << 0 << endl;
	else if (b==a+2 || c==b+2) cout << 1 << endl;
	else cout << 2 << endl;
	
	int maxx = max(b-a, c-b) - 1;
	cout << maxx << endl;
	
	return 0;
}

T2 The Great Revegetation

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

const int N = 160;
int n, m, a[N], b[N], ans[N];

int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i ++) cin >> a[i] >> b[i];
	
	for (int i = 1; i <= n; i ++) {
		for (int j = 1; j <= 4; j ++) {
			//如果第i块草地是第j种颜色 
			ans[i] = j;			
			
			//第k头奶牛喜欢第a[k]和第b[k]草地，是否和第i块草地第j种颜色相互矛盾？ 
			bool flag = true;
			for (int k = 1; k <= m; k ++) {
				if (ans[a[k]]!=0 && ans[b[k]]!=0 && ans[a[k]]==ans[b[k]]) {
					flag = false;
					break;
				}
			}
			if (flag) break;
		}
	}

	for (int i = 1; i <= n; i ++) cout << ans[i];

	return 0;
}

T3 Measuring Traffic

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

const int N = 105; 
int n, s[N], x[N], maxx, minn;
string str[N];

int main() {
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> str[i] >> x[i] >> s[i];
	
	minn = 0, maxx = 1e5;
	for (int i = n; i >= 1; i --) {
		if (str[i] == "none") {
			maxx = min(maxx, s[i]);
			minn = max(minn, x[i]);
		}
		else if (str[i] == "off") {
			maxx = maxx + s[i];
			minn = minn + x[i];
		}
		else if (str[i] == "on") {
			maxx = maxx - x[i];
			minn = minn - s[i];
			if (minn < 0) minn = 0;
		}		
	}
	cout << minn << ' ' << maxx << endl;	
	
	minn = 0, maxx = 1e5;
	for (int i = 1; i <= n; i ++) {
		if (str[i] == "none") {
			maxx = min(maxx, s[i]);
			minn = max(minn, x[i]);
		}
		else if (str[i] == "on") {
			maxx = maxx + s[i];
			minn = minn + x[i];
		}
		else if (str[i] == "off") {
			maxx = maxx - x[i];
			minn = minn - s[i];
			if (minn < 0) minn = 0;
		}		
	}
	cout << minn << ' ' << maxx << endl;

	return 0;
}