Codeforces Round 354 div2
通过数: 4
A:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 5;
int a[MAXN], n;
int main()
{
while(scanf("%d", &n) != EOF) {
for(int i = 1 ; i <= n ; i++) {
int u; scanf("%d", &u);
a[u] = i;
}
if(a[1] > a[n]) swap(a[1], a[n]);
int ans1 = a[n] - 1;
int ans2 = n - a[1];
printf("%d\n", max(ans1, ans2));
}
return 0;
}
B:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 + 5;
double v[MAXN][MAXN];
int n;
int w;
int main()
{
while(scanf("%d%d", &n, &w) != EOF) {
v[1][1] = w;
int ans = 0;
for(int i = 1 ; i <= n ; i++) {
for(int j = 1 ; j <= i ; j++) {
if(v[i][j] >= 1) {
v[i + 1][j] += (v[i][j] - 1) / 2;
v[i + 1][j + 1] += (v[i][j] - 1) / 2;
ans++;
}
}
}
// for(int i = 1 ; i <= n ; i++) {
// for(int j = 1 ; j <= i ; j++) printf("%f ", v[i][j]);
// printf("\n");
// }
printf("%d\n", ans);
memset(v, 0, sizeof v);
}
return 0;
}
C:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 5;
char str[MAXN];
int n, k;
int solve(char c)
{
int head = 0;
int res = 0;
int cnt = 0;
for(int rear = 0 ; rear < n ; rear++) {
if(str[rear] == c) cnt++;
while(cnt > k) {
if(str[head] == c) cnt--;
head++;
}
res = max(res, rear - head + 1);
}
return res;
}
int main()
{
while(scanf("%d%d", &n, &k) != EOF) {
scanf("%s", str);
int ans1 = solve('a');
int ans2 = solve('b');
printf("%d\n", max(ans1, ans2));
}
return 0;
}
D:
简单BFS,处理转向的时候稍微麻烦一点
Dp[i][j][k]表示当前在(i,j)点,相对顺时针转了k次,其中k在[0,3]内
转向的时候处理办法是,对每种出口,存一个字符串,然后在里面下标转。判断两个已经转向的方块是否连通,采用四进制表示他们是否在他们相连方向上都有出口。
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
const int MAXN = 1000 + 4;
typedef pair<int,int> pii;
typedef pair<pii,int> pii3;
int dp[MAXN][MAXN][4];
int n, m;
char g[MAXN][MAXN];
queue<pii3> que;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
bool validPos(int x, int y){if(x >= 1 && x <= n && y >= 1 && y <= m) return true; else return false;}
int indexC(char c)
{
switch(c) {
case '+' : return 15;
case '-' : return 10;
case '|' : return 5;
case '^' : return 1;
case '>' : return 2;
case '<' : return 8;
case 'v' : return 4;
case 'L' : return 7;
case 'R' : return 13;
case 'U' : return 14;
case 'D' : return 11;
case '*' : return 0;
}
}
char cmps[5][5] = {"+","-|", "^>v<", "LURD", "*"};
int num[5] = {1, 2, 4, 4, 1};
char changeC(char c, int s)
{
for(int i = 0 ; i < 5 ; i++) {
int len = num[i];
for(int j = 0 ; j < len ; j++) {
if(cmps[i][j] == c) {
return cmps[i][(j + s) % len];
}
}
}
}
bool validMove(int x1, int y1, int x2, int y2, int s)
{
if(x1 > x2 || y1 > y2) swap(x1, x2), swap(y1, y2);
int d1 = indexC(changeC(g[x1][y1], s));
int d2 = indexC(changeC(g[x2][y2], s));
if(x1 == x2 - 1) {
if((4 & d1) && (1 & d2)) return true;
else return false;
}
else {
if((2 & d1) && (8 & d2)) return true;
else return false;
}
}
int main()
{
while(scanf("%d%d", &n, &m) != EOF) {
for(int i = 1 ; i <= n ; i++) scanf("%s", g[i] + 1);
int sx, sy;
int ex, ey;
scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
while(!que.empty()) que.pop();
que.push(mp(mp(sx, sy), 0));
memset(dp, -1, sizeof dp);
dp[sx][sy][0] = 0;
while(!que.empty()) {
pii3 p = que.front(); que.pop();
// printf("p = %d %d %d\n", p.)
for(int i = 0 ; i < 4 ; i++) {
int tx = dx[i] + p.fi.fi;
int ty = dy[i] + p.fi.se;
if(!validPos(tx, ty)) continue;
if(dp[tx][ty][p.se] == -1 && validMove(p.fi.fi, p.fi.se, tx, ty, p.se))
dp[tx][ty][p.se] = dp[p.fi.fi][p.fi.se][p.se] + 1, que.push(mp(mp(tx, ty), p.se));
}
int ts = (p.se + 1) % 4;
if(dp[p.fi.fi][p.fi.se][ts] == -1) {
dp[p.fi.fi][p.fi.se][ts] = dp[p.fi.fi][p.fi.se][p.se] + 1;
que.push(mp(p.fi, ts));
}
}
int res = -1;
for(int i = 0 ; i < 4 ; i++) {
if(dp[ex][ey][i] != -1 && (dp[ex][ey][i] < res || res == -1))
res = dp[ex][ey][i];
}
printf("%d\n", res);
}
return 0;
}
E:
/*
赛中WA在test20,原以为所有系数全确认时,数值范围过大导致出错
后来算了一下,发现long double也是不够用,上大数版也T了,强行判一个最大最小值也没有过此test
实际上,需要分k为0或者不为0
k为0时,若a[0]确定,则与a[0]是否是0有关;不确定,则与谁先走有关
k不为0,存在系数不确定,与谁先走有关;确定,按照提公因数的方法算一遍,注意超过某个区间就直接跳出避免数据范围过大出错
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 4;
int a[MAXN];
char s[20];
int main()
{
int n, k;
while(scanf("%d%d", &n, &k) != EOF) {
int cnt = 0;
int occur0 = 0;
for(int i = 0 ; i <= n ; i++) {
scanf("%s", s);
if(s[0] == '?') cnt++;
else {
if(i == 0) occur0 = 1;
a[i] = 0;
int flag = 1;
for(int j = 0 ; j < (int)strlen(s) ; j++) {
if(s[j] == '-') flag = -1;
else
a[i] = a[i] * 10 + s[j] - '0';
}
a[i] = a[i] * flag;
}
}
if(k) {
if(cnt) {
int t1 = n + 1 - cnt;
// printf("t1 = %d,cnt = %d\n", t1, cnt);
if(t1 % 2 == 1) {
if(cnt % 2 == 0) puts("No");
else puts("Yes");
}
else {
if(cnt % 2 == 0) puts("Yes");
else puts("No");
}
}
else {
long long sum = 0;
int ok = 1;
for(int i = n ; i >= 1 ; i--) {
sum += a[i];
sum = sum * k;
if(sum > 1e14 || sum < -1e14) {
ok = 0;
break;
}
// a[i - 1] += a[i] * k;
// cout << "sum = " << sum << " a[i - 1] = " << a[i - 1] << endl;
}
sum = sum + a[0];
// for(int i = 0 ; i <= n ; i++) printf("i = %d, a = %f\n", i, a[i]);
if(sum == 0 && ok) puts("Yes");
else puts("No");
}
}
else {
if(occur0){
if(a[0]) puts("No");
else puts("Yes");
}
else {
int t1 = n - cnt + 1;
if(t1 % 2 == 0) puts("No");
else puts("Yes");
}
}
}
return 0;
}