Checker informatics №934

/*
checker
*/
vector<int> right_ans;

void rand_gen() {
    n = rand() % 5 + 1;
    H = rand() % 10 + 1;
    W = rand() % 10 + 1;

    right_ans = vector<int> ();
    my_ans = vector<int> ();

    lines = vector<line>();

    cur_h = 1;
    sz = 0;
    fill(tree, tree+TREE_SZ, INF);
    queries = vector<int> (n);

    for(int i = 0; i < n; i++)
        queries[i] = rand() % 10 + 1;
}

void solve() {
    vector<int> sheet(H, W);
    for(int i = 0; i < n; i++) {
        int cur_w = queries[i];

        int ans = -1;
        for(int j = 0; j < H; j++) {
            if(sheet[j] >= cur_w) {
                sheet[j] -= cur_w;
                ans = j+1;
                break;
            }
        }

        right_ans.push_back(ans);
    }
}

void print_cond () {
    cout << H << ' ' << W << ' ' << n << '\n';
    for(int x: queries)
        cout << x << '\n';
}

int main()
{
    int k = 1000;
    srand(time(0));
    while(k--) {
        rand_gen();
        solve();
        gen();

        //print_cond();
        if(k % 100 == 0)
            cout << '-';
        if(my_ans != right_ans) {
            cout << "\nBAD\n";
            print_cond();
            exit(0);
        }
    }
    //input();
    //gen();
}