Pagini recente » Cod sursa (job #710680) | Cod sursa (job #185372) | Cod sursa (job #527488) | Cod sursa (job #2750968) | Cod sursa (job #125025)
Cod sursa(job #125025)
#include <fstream.h>
#include <math.h>
ifstream f ("gardieni.in");
ofstream g ("gardieni.out");
long int a[50005][3],t;
long long int s;
unsigned int n;
void citire ()
{
f>>n>>t;
unsigned int i;
int j;
for(i=1;i<=n;i++)
for(j=1;j<=3;j++)
f>>a[i][j];
}
void procesare ()
{
long int i;
unsigned int j;
int b;
for(i=1;i<=t;i++){
long int min=pow(2,20);
int k;
b=0;
for(j=1;j<=n;j++)
if(a[j][1]<=i && a[j][2]>=i)
if(a[j][3]==1){
s=s+a[j][2]-a[j][i]+1;
i=a[j][2];
j=n+1;
}
else
if(min>a[j][3]){
b=1;
min=a[j][3];
k=j;
}
if(b==1)
s=s+a[k][3];
}
}
int main ()
{
citire ();
procesare ();
g<<s;
return 0;
}