# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
743003 | vjudge1 | Lasers (NOI19_lasers) | C++17 | 1059 ms | 2388 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 <bits/stdc++.h>
using namespace std;
vector<int> wall;
const long long maxL = 1e6 + 1;
bool walloc[maxL] = {};
int main()
{
int l, r, amount, a, sum = 0;
cin >> l >> r;
for (int i = 0; i < r; ++i)
{
cin >> amount;
for (int j = 0; j < amount; ++j)
{
cin >> a;
wall.push_back(a);
}
if (wall.size() == 1)
{
if (wall[0] >= l / 2)
{
int left = l - wall[0];
for (int i = left + 1; i <= l - left; ++i)
{
if (walloc[i] == false)
{
walloc[i] = 1;
sum++;
}
}
}
}
else
{
for (int i = 0; i < wall.size(); ++i)
{
int otherl = 0, otherr = 0;
for (int j = i - 1; j >= 0; --j)
otherl += wall[j];
for (int j = i + 1; j < wall.size(); ++j)
otherr += wall[j];
int wallleft = l - otherl - otherr;
if (wall[i] >= wallleft / 2)
{
int coverage = wallleft - wall[i];
for (int j = otherl + 1 + coverage; j <= l - otherr - coverage; ++j)
{
if (walloc[j] == false)
{
walloc[j] = 1;
sum++;
}
}
}
}
}
wall.clear();
}
cout << sum;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |