10B - Cinema Cashier - CodeForces Solution

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;

int abs(int a) {
    if(a<0) return -a;
    return a;
}

void solve() {
    int n,k;
    cin >> n >> k;
    vector<vector<int> > hall(k+1,vector<int>(k+1,0));
    for(int i=0;i<n;i++) {
        int req;
        cin >> req;
        bool found=0;
        int x,l,r,score=1e9;
        for(int row=1;row<=k;row++) {
            for(int col=1;col<=k-req+1;col++) {
                int curr=req*abs(row-k/2-1);
                bool flag=0;
                for(int j=col;j<col+req;j++) {
                    if(hall[row][j]) {
                        flag=1;
                        break;
                    }
                    curr+=abs(j-k/2-1);
                }
                if(flag) continue;
                if(curr<score) {
                    found=1;
                    score=curr;
                    x=row;
                    l=col;
                    r=col+req-1;
                }
            }
        }
        if(found) {
            printf("%d %d %d\n", x,l,r);
            for(int i=l;i<=r;i++) hall[x][i]=1;
        } else {
            cout << -1 << endl;
        }
    }
}

int main() {
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
    int t=1;
    // cin >> t;
    while(t--) {
        solve();
    }
}