HDU 2474

    这题关键是数据量太大，如果用普通的银行家算法，最坏情况下时间复杂度为O(N*N*M)，显然会超时。正确的解法是对每种资源分别考虑，建立M个队列。进程对每种资源的需求数量从小到大存入队列，这样每次只需检查队列头部的进程即可。排序时间复杂度O(M*N*logN),每个进程至多出队M次，时间复杂度为O(N*M*M)。

    由于杭电的数据太弱，所以这个算法体现不出效果...

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <memory.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iostream>
#include <sstream>

using namespace std;

int allo[3][50005], reqs[3][50005], avai[3], indx[3];
pair<int, int> queu[3][50005];
bool flag[3][50005];
int n, m;

int main() {
    int i, j, k, cunt;
    bool sign;
    while (scanf("%d %d", &n, &m) != EOF) {
        for (i = 0; i < m; i++)
            for (j = 0; j < n; j++)
                scanf("%d", &allo[i][j]);
        for (i = 0; i < m; i++)
            for (j = 0; j < n; j++) {
                scanf("%d", &reqs[i][j]);
                queu[i][j].first = reqs[i][j];
                queu[i][j].second = j;
            }
        for (i = 0; i < m; i++)
            scanf("%d", &avai[i]);
        for (i = 0; i < m; i++)
            sort(queu[i], queu[i] + n);
        sign = true;
        cunt = 0;
        memset(indx, 0, sizeof(indx));
        memset(flag, 0, sizeof(flag));
        while (sign) {
            sign = false;
            for (i = 0; i < m; i++) {
                for (j = indx[i]; j < n; j++) {
                    if (queu[i][j].first > avai[i])
                        break;
                    flag[i][queu[i][j].second] = true;
                    for (k = 0; k < m; k++) {
                        if (!flag[k][queu[i][j].second])
                            break;
                    }
                    if (k == m) {
                        sign = true;
                        cunt++;
                        for (k = 0; k < m; k++) {
                            avai[k] += allo[k][queu[i][j].second];
                            if (avai[k] > 1000000000)
                                avai[k] = 1000000000;
                        }
                    }
                }
                indx[i] = j;
            }
        }
        if (cunt == n) puts("Yes");
        else puts("No");
    }
    return 0;
}