Pagini recente » Cod sursa (job #2347397) | Cod sursa (job #723420) | Cod sursa (job #824977) | Cod sursa (job #1359842) | Cod sursa (job #2338851)
#include <fstream>
using namespace std;
int main()
{
int n, b, k, s, p, i, sus, jos, bsus, bjos;
ifstream fin("clepsidru.in");
ofstream fout("clepsidru.out");
fin >> n >> b;
fin >> k;
bsus = bjos = 0;
sus = 1 - b;
jos = 0;
for(i = 1; i <= k; i++)
{
fin >> s >> p;
if(p == 1)
{
sus += s;
jos += s;
if(sus >= n)
{
sus = n;
jos = n + b - 1;
}
}
else
{
sus -= s;
jos -= s;
if(jos <= 0)
{
jos = 0;
sus = 1 - b;
}
}
}
if(sus <= 0)
bsus = 1 - sus;
if(jos >= n)
bjos = jos + 1 - n;
fout << n + b - 1 << '\n';
fout << bsus << " ";
for(i = 1; i < n; i++)
{
if(sus <= i && i <= jos)
{
if(p == 2)fout << "1" << '\n' << "0 ";
else fout << "0" << '\n' << "1 ";
}
else fout << "0" << '\n' << "0 ";
}
fout << bjos;
fin.close();
fout.close();
return 0;
}