Codeforces Round 355 div2 （E abandoned）677ABCD

Codeforces Round 355 div2 （E abandoned）
通过数： 3
前三题比较正常，D用了很奇怪的算法强行符合的复杂度，E是十分恶心的模拟由于用了比较笨拙的办法，实在是不想改了……
关于D，赛中的时候考虑可能出现边过多的情况，这时候没法处理。所以，标程算法给出了这样的答案：边过多时，用bfs搜索全图；边少时，用两两之间求曼哈顿距离更新。可以证明这样的复杂度是O(n*m*sqrt(n*m))

A：
    #include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, h;
    while(scanf("%d%d", &n, &h) != EOF) {
        int res = n;
        for(int i = 0 ; i < n ; i++) {
            int u; scanf("%d", &u);
            if(u > h) res++;
        }
        printf("%d\n", res);
    }
    return 0;
}

B：

    #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main()
{
    int n, k, h;
    while(scanf("%d%d%d", &n, &h, &k) != EOF) {
        LL res = 0;
        LL carry = 0;
        for(int i = 1 ; i <= n ; i++) {
            int u; scanf("%d", &u);
            if(u + carry > h) {
                res++;
                carry = 0;
            }
            carry += u;
            res += carry / k;
            carry = carry % k;
        }
        if(carry) res++;
        printf("%I64d\n", res);
    }
    return 0;
}

C：

    #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MOD (1000000007)
const int MAXN = 64;
const int MAXM = 100000 + 5;
LL cnt[MAXN];
void init()
{
    for(int i = 0 ; i < MAXN ; i++) {
        cnt[i] = 0;
        for(int j = 0 ; j < MAXN ; j++) {
            for(int k = 0 ; k < MAXN ; k++) {
                if(i == (j & k)) cnt[i]++;
            }
        }
    }
}
int toI(char c)
{
    if(c >= '0' && c <= '9') return c - '0';
    if(c >= 'A' && c <= 'Z') return c - 'A' + 10;
    if(c >= 'a' && c <= 'z') return c - 'a' + 36;
    if(c == '-') return 62;
    if(c == '_') return 63;
}
char str[MAXM];
int main()
{
    init();
    while(scanf("%s", str) != EOF) {
        LL res = 1;
        for(int i = 0 ; i < (int)strlen(str) ; i++) {
            res = (res * cnt[toI(str[i])]) % MOD;
        }
        printf("%I64d\n", res);
    }
    return 0;
}

D：

    #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pii;
const int MAXN = 300 + 5;
int g[MAXN][MAXN], cnt[MAXN * MAXN], n, m, l;
int dis[MAXN][MAXN], vis[MAXN][MAXN];
vector<pii> e[MAXN * MAXN];
queue<pii> 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;}
void bfs(int u)
{
    for(int i = 1 ; i <= n ; i++) for(int j = 1 ; j <= m ; j++) if(g[i][j] != u) dis[i][j] = -1, vis[i][j] = 0;
    while(!que.empty()) que.pop();
    for(int i = 0 ; i < (int)e[u].size() ; i++) que.push(e[u][i]), vis[e[u][i].fi][e[u][i].se] = 1;
    while(!que.empty()) {
        pii p = que.front(); que.pop();
        vis[p.fi][p.se] = 0;
        for(int i = 0 ; i < 4 ; i++) {
            int tx = p.fi + dx[i];
            int ty = p.se + dy[i];
            if(validPos(tx, ty) && (dis[tx][ty] == -1 || dis[tx][ty] > dis[p.fi][p.se] + 1)) {
                dis[tx][ty] = dis[p.fi][p.se] + 1;
                if(vis[tx][ty] == 0) {
                    que.push(mp(tx, ty));
                    vis[tx][ty] = 1;
                }
            }
        }
    }
}
int caldis(pii p1, pii p2)
{
    int x1 = p1.fi, y1 = p1.se;
    int x2 = p2.fi, y2 = p2.se;
    return abs(x1 - x2) + abs(y1 - y2);
}
void solve(int u, int v)
{
    for(int i = 0 ; i < (int)e[u].size() ; i++) {
        pii p1 = e[u][i];
        for(int j = 0 ; j < (int)e[v].size() ; j++) {
            pii p2 = e[v][j];
            int Dis = caldis(p1, p2);
            if(dis[p2.fi][p2.se] == -1 || dis[p2.fi][p2.se] > dis[p1.fi][p1.se] + Dis)
                dis[p2.fi][p2.se] = dis[p1.fi][p1.se] + Dis;
        }
    }
}
void debug()
{
    printf("\n///***\n");
    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= m ; j++) printf("%d ", dis[i][j]);
        puts("");
    }
    printf("***///\n");
}
int main()
{
    while(scanf("%d%d%d", &n, &m, &l) != EOF) {
        for(int i = 1 ; i <= l ; i++)
            cnt[i] = 0,
            e[i].clear();
        for(int i = 1 ; i <= n ; i++) {
            for(int j = 1 ; j <= m ; j++) {
                scanf("%d", &g[i][j]);
                e[g[i][j]].pb(mp(i, j));
                cnt[g[i][j]]++;
                dis[i][j] = -1;
            }
        }

        for(int i = 0 ; i < (int)e[1].size() ; i++) {
            pii p = e[1][i];
            dis[p.fi][p.se] = caldis(mp(1, 1), e[1][i]);
        }
        for(int i = 2 ; i <= l ; i++) {
            if(cnt[i - 1] * cnt[i] >= n * m) {
                bfs(i - 1);
            }
            else {
                for(int j = 0 ; j < (int)e[i].size() ; j++)
                    dis[e[i][j].fi][e[i][j].se] = -1;
                solve(i - 1, i);
            }
//            debug();
        }

        printf("%d", dis[e[l][0].fi][e[l][0].se]);
    }
    return 0;
}