Pagini recente » Cod sursa (job #2623090) | Cod sursa (job #2637211) | Cod sursa (job #1928827) | Cod sursa (job #2947650) | Cod sursa (job #3191129)
#include <fstream>
#include <set>
#define DIM 1000005
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
struct op {
int a;
int b;
int c;
};
int color[DIM];
set<pair<int, int>> multimi;
op operatii[DIM];
int n, a, b, c;
int main()
{
fin >> n;
fin >> a >> b >> c;
for (int i = 1; i < n; i++) {
operatii[i].a = min(a, b);
operatii[i].b = min(a, b);
operatii[i].c = c;
a = (1ll * a * (i + 1)) % n;
b = (1ll * b * (i + 1)) % n;
c = (1ll * c * (i + 1)) % n;
}
for (int j = n - 1; j > 0; j--) {
a = operatii[j].a;
b = operatii[j].b;
c = operatii[j].c;
pair<int, int> multime = make_pair(a, b);
for (set<pair<int, int>> :: iterator it = multimi.begin(); it != multimi.end(); it++) {
pair<int, int> current = *it;
if (current.first > a) {
if (b < current.first) {
for (int i = a; i <= b; i++) {
color[i] = c;
}
multimi.insert(multime);
break;
}
else {
for (int i = a; i < current.first; i++) {
color[i] = c;
}
multime.second = current.second;
multimi.erase(current);
multimi.insert(multime);
multime.first = multime.second + 1;
multime.second = b;
}
}
else if (current.second >= a) {
multime.first = current.first;
a = current.second + 1;
if (a <= b) {
multimi.erase(current);
}
else break;
}
}
if (a <= b) {
for (int i = a; i <= b; i++) {
color[i] = c;
}
multimi.insert(make_pair(a, b));
}
}
for (int i = 1; i < n; i++) {
fout << color[i] << "\n";
}
}