#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>

#include "input.h"

void parseIntegers(int n, int* a){
	char str[n*10];
	scanf("%s",str);
	for(int i=0;i<n;i++){
		char* num;
		if(i==0)
			num = strtok(str,",");
		else
			num = strtok(NULL,",");
		a[i] = atoi(num);
	}
	
}

void parseDoubles(int n, double* a){
	char str[n*10];
	scanf("%s",str);
	for(int i=0;i<n;i++){
		char* num;
		if(i==0)
			num = strtok(str,",");
		else
			num = strtok(NULL,",");
		a[i] = atof(num);
	}
	

}

bool isFeasible(Input* in){
	//Checks if a borrel length is smaller than
	//the amount of time slots
	for(int h=0;h<in->m;h++){
		if(in->b[h]>in->t)
			return false;
	}
	//Check if the amount of time an obligation takes
	//is longer than its interval.
	for(int i=0;i<in->n;i++){
		for(int j=0;j<in->nI[i];j++){
			if( in->I[i][j].p > in->I[i][j].d-in->I[i][j].r+1 )
				return false;
		}
	}
	return true;
}

Input parser(){
	Input r;
	scanf("%d",&(r.t));
	scanf("%d",&(r.m));

	r.b = malloc(sizeof(int)*r.m);
	parseIntegers(r.m, r.b);

	scanf("%d",&(r.n));
	r.nI = malloc(sizeof(int)*r.n);
	r.I = malloc(sizeof(Obligation*)*r.n);
	for(int i=0;i<r.n;i++){
		char str[300];
		scanf("%s",str);
		char* num = strtok(str,",");
		(r.nI)[i] = atoi(num);
		(r.I)[i] = malloc(sizeof(Obligation)*(r.nI[i]));

		for(int j=0;j<(r.nI)[i];j++){
			char* num;
			num = strtok(NULL,",");
			(r.I)[i][j].r = atoi(num)-1;
			num = strtok(NULL,",");
			(r.I)[i][j].d = atoi(num)-1;
			num = strtok(NULL,",");
			(r.I)[i][j].p = atoi(num);
		}

	}

	//For now the social matrix is equal to the identity
	r.socialMatrix = malloc(sizeof(double*)*r.n);
	for(int i=0;i<r.n;i++){
		r.socialMatrix[i] = malloc(sizeof(double)*r.n);
		parseDoubles(r.n,r.socialMatrix[i]);
	}

	return r;
}

void freeInput(Input* in){
	free(in->b);
	for(int i=0;i<in->n;i++){
		free(in->I[i]);
		free(in->socialMatrix[i]);
	}
	free(in->socialMatrix);
	free(in->I);
	free(in->nI);
}