Codeforces Round #277 (Div. 2)

#include<cstdio>

#define INF INT_MAX

using namespace std;

int main(){
	ll n;
	while (scanf("%I64d",&n) != EOF){
		ll ans = n / 2;
		ll r = n % 2;
		if (!r){
			printf("%I64d\n",ans);
		}
		else{
			printf("%I64d\n",ans-n);
		}
	}
	return 0;
}

B  OR in Matrix

#include<cstdio>

using namespace std;

int a[MAX][MAX],b[MAX][MAX];

bool isf(int n, int m){
	for (int i = 0; i<n; i++)	
		for (int j = 0; j<m; j++){
				int t = 0;
				for (int k = 0; k<n; k++)
					t = t | a[k][j];
				for (int k = 0; k<m; k++)
					t = t | a[i][k];
				if (t != b[i][j]) return false;
		}
	return true;
}

int main(){
	int n,m;
	while (scanf("%d%d",&n,&m) != EOF){
		for (int i = 0; i<n; i++)
			for (int j = 0; j<m; j++)
				scanf("%d",&b[i][j]);
		
		memset(a,0,sizeof(a));	
		for (int i = 0; i<n; i++){
			for (int j = 0; j<m; j++)
				if (b[i][j] == 0){
					for (int k = 0; k<n; k++) a[k][j] = 1;
					for (int k = 0; k<m; k++) a[i][k] = 1;
				}
		}
		
		for (int i = 0; i<n; i++)
			for (int j = 0; j<m; j++) a[i][j] = !a[i][j];
		
		if (isf(n,m)){
			printf("YES\n");
			for (int i = 0; i<n; i++){
				printf("%d",a[i][0]);
				for (int j = 1; j<m; j++) printf(" %d",a[i][j]);
				printf("\n");
			}
		}
		else{
			printf("NO\n");
		}
	}
	return 0;
	
}

C  Palindrome Transformation

这个题目比赛的时候知道最后也没有，写出来。一直觉得是个大模拟，感觉所有的情况也都考虑到了，但就是过不了，第二天看别人的代码的时候发现是我当时考虑复杂了。只需要考虑p在前半部分还是后半部分就行。然后让p在自己的部分内到达所有需要改变的地方即可。（修改前半部分和修改后半部分是一样的，当p在前半部分时，就修改前半部分，当k在后半部分时就修改后半部分），然后根据p先往左走还是先往右走两种情况取最优即可。我当时想的右点多，导致代码写得有点乱，今天又重新按照网上的思路写了下。

#include<cstdio>
#include<cstring>

#define MAX100010

using namespace std;

int a[MAX];
char s[MAX];

int main(){
	int n,p;
	while (scanf("%d%d",&n,&p) != EOF){
		scanf("%s",s);
		p--;
		
		int len = n;
		int ans = 0;
		memset(a,0,sizeof(a));
		for (int i = 0,j=len-1; i<len/2; i++,j--){
			if (s[i] > s[j]){
				a[i] = min(s[i]-s[j],s[j]+26-s[i]);
			}
			else if (s[i] < s[j]){
				a[i] = min(s[j]-s[i],s[i]+26-s[j]);
			}
			a[j] = a[i];
			ans += a[i];
		}
		
		if (ans == 0){             //不需要改变的情况 
			printf("%d\n",0);
			continue;
		}
		
		int mid = len/2-1;
		
		if (p <= mid){           //p在前半部分
			int l, r, i=0;
			while (a[i] == 0) i++;
			l = i;
			i = mid;
			while (a[i] == 0) i--;
			r = i;
			if (p <= l) ans += (r - p);
			else if (p >= r) ans += (p-l);
			else {
				ans += min(r-p+r-l,p-l+r-l);
			}
		}
		else{                             //p在后半部分 
			int l, r, i = mid+1;
			while (a[i] == 0) i++;
			l = i;
			i  = len - 1;
			while (a[i] == 0) i--;
			r = i;
			if (p <= l){
				ans += (r-p);
			}
			else if (p >= r){
				ans += (p-l);
			}
			else{
				ans += min(p-l+r-l,r-p+r-l);
			}	
		}
		printf("%d\n",ans);
	}
	return 0;	
}