# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
429734 | schse | Handcrafted Gift (IOI20_gift) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gift.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
int construct(int n, int r, st#include "gift.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x)
{
int sb = 0;
for (int i : x)
sb |= i;
if (sb == 1)
{
std::string s(n, 'R');
craft(s);
return 1;
}
else if (sb == 2)
{
for (int i = 0; i < a.size(); i++)
if (a[i] == b[i])
return 0;
std::string s(n, 'R');
for (int i = 0; i < n; i++)
s[i] = i % 2 ? 'R' : 'B';
craft(s);
return 1;
}
else
{
vector<int> prefix(n);
iota(prefix.begin(), prefix.end(), 0);
for (int i = 0; i < a.size(); i++) //update single color
{
if (x[i] == 1)
{
for (int e = b[i] + 1; e < n; e++)
prefix[e] -= prefix[b[i]] - prefix[a[i]];
for (int e = a[i] + 1; e < b[i] + 1; e++)
prefix[e] = prefix[a[i]];
}
}
for (int i = 0; i < a.size(); i++) //check wetherpossible
{
if (x[i] == 2)
{
if (prefix[b[i]] - prefix[a[i]] < 1)
return 0;
}
}
std::string s(n, 'R');
for (int i = 0; i < n; i++)
s[i] = prefix[i] % 2 ? 'R' : 'B';
craft(s);
return 1;
}
}
d::vector<int> a, std::vector<int> b, std::vector<int> x)
{
int sb = 0;
for (int i : x)
sb |= i;
if (sb == 1)
{
std::string s(n, 'R');
craft(s);
return 1;
}
else if (sb == 2)
{
for (int i = 0; i < a.size(); i++)
if (a[i] == b[i])
return 0;
std::string s(n, 'R');
for (int i = 0; i < n; i++)
s[i] = i % 2 ? 'R' : 'B';
craft(s);
return 1;
}
else
{
vector<int> prefix(n);
iota(prefix.begin(), prefix.end(), 0);
for (int i = 0; i < a.size(); i++) //update single color
{
if (x[i] == 1)
{
for (int e = a[i] + 1; e < b[i]; e++)
prefix[e] = prefix[a[i]];
for (int e = b[i]; e < n; e++)
prefix[e] -= b[i] - a[i];
}
}
for (int i = 0; i < a.size(); i++) //check wetherpossible
{
if (x[i] == 2)
{
if (prefix[b[i]] - prefix[a[i]] < 1)
return 0;
}
}
std::string s(n, 'R');
for (int i = 0; i < n; i++)
s[i] = prefix[i] % 2 ? 'R' : 'B';
craft(s);
return 1;
}
}