Educational Codeforces Round 37 B. Tea Queue

题意：

一群人按给定顺序排队喝茶，只能在某个时间段喝茶；

思路：

有点笨的涂色的方法，每个人能在哪一点能喝到茶，之前的都做标记；

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1000 + 7, maxd = 1e5 + 7;
const int mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int T;
int n;

struct node {
    int l, r;
}a[maxn];

int vis[5*maxn];
int ans[maxn];

int main() {
    kuaidian;

    cin >> T;
    while(T--) {
        memset(vis, 0, sizeof vis);
        cin >> n;
        for(int i = 0; i < n; ++i) {
            cin >> a[i].l >> a[i].r;
        }

        ans[0] = a[0].l;
        for(int i = 0; i <= a[0].l; ++i) {
            vis[i] = 1;
        }
        for(int i = 1; i < n; ++i) {
            int f = 0;
            for(int j = a[i].l; j <= a[i].r; ++j) {
                if(vis[j] == 0) {
                    vis[j] = 1;
                    ans[i] = j;
                    f = 1;
                    break;
                }
            }
            if(f == 0) ans[i] = 0;
        }

        for(int i = 0; i < n; ++i) {
            cout << ans[i] << " ";
        }
        cout << endl;

    }

    return 0;
}