Pagini recente » Cod sursa (job #2917352) | Cod sursa (job #577798) | Cod sursa (job #1503415) | Cod sursa (job #1079122) | Cod sursa (job #2962119)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("camion.in");
ofstream fout("camion.out");
struct query{ int x1, y1, x2, y2; };
const int N = 600, Q = 3e4;
int v[N + 1];
query q[Q + 1];
int main(){
int n, m, k, c;
fin >> n >> m >> k >> c;
for(int i = 1; i <= n; i++) v[i] = c;
for(int i = 1; i <= k; i++) fin >> q[i].x1 >> q[i].y1 >> q[i].x2 >> q[i].y2;
for(int i = k; i >= 1; i--)
for(int j = q[i].x1; j <= q[i].x2; j++)
if(q[i].y1 <= v[j]) v[j] += (q[i].y2 - q[i].y1 + 1);
for(int i = 1; i <= n; i++)
(v[i] <= m) ? fout << v[i] << '\n' : fout << 0 << '\n';
return 0;
}