Submission #742960

#	Time	Username	Problem	Language	Result	Execution time	Memory
742960		vjudge1	Lasers (NOI19_lasers)	C++17	24 / 100	308 ms	8036 KiB

lasers

#include <bits/stdc++.h>
using namespace std;
vector<int> wall;
const long long maxL = 1e9 + 1;
bool wallocc[maxL];

int main()
{
    int l, r, amount, a;
    cin >> l >> r;
    for (int i = 0; i < r; ++i)
    {
        cin >> amount;
        for (int j = 0; j < amount; ++j)
        {
            cin >> a;
            if (a >= l / 2)
                wall.push_back(a);
        }
    }
    if (!wall.empty())
    {
        sort(wall.begin(), wall.end(), greater<int>());
        cout << max(0, (wall[0] * 2) - l);
    }
    else
    {
        cout << 0;
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 14 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 22
• Subtask 6: 0 / 13