Submission #944974

#	Time	Username	Problem	Language	Result	Execution time	Memory
944974		gelastropod	Meetings (IOI18_meetings)	C++14	0 / 100	12 ms	2008 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

vector<long long> minimum_costs(vector<signed> H, vector<signed> L,
                                vector<signed> R) {
    int N = H.size(), Q = L.size();
    stack<int> stk;
    vector<int> f2s(N, 0), b2s(N, 0);
    for (int i = 0; i < N; i++)
    {
        if (H[i] == 2)
        {
            f2s[i] = i;
            while (!stk.empty())
            {
                f2s[stk.top()] = i;
                stk.pop();
            }
        }
        else
        {
            stk.push(i);
        }
    }
    while (!stk.empty())
    {
        f2s[stk.top()] = -1;
        stk.pop();
    }
    for (int i = N - 1; i >= 0; i--)
    {
        if (H[i] == 2)
        {
            b2s[i] = i;
            while (!stk.empty())
            {
                b2s[stk.top()] = i;
                stk.pop();
            }
        }
        else
        {
            stk.push(i);
        }
    }
    while (!stk.empty())
    {
        b2s[stk.top()] = -1;
        stk.pop();
    }
    vector<int> ans;
    for (int i = 0; i < Q; i++)
    {
        if (f2s[L[i]] == -1 || f2s[L[i]] > R[i])
            ans.push_back(R[i] + 1 - L[i]);
        else
            ans.push_back((R[i] + 1 - L[i]) * 2 - max(f2s[L[i]] - L[i], R[i] - b2s[R[i]]));
    }
    return ans;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40