Submission #91623

#	Time	Username	Problem	Language	Result	Execution time	Memory
91623		Alexa2001	Sparklers (JOI17_sparklers)	C++17	0 / 100	2 ms	376 KiB

sparklers

#include <bits/stdc++.h>

using namespace std;

const int lim = 1e9, Nmax = 1e5 + 5;
typedef long long ll;
const ll Target = 1e16;

int n, K, T;
int X[Nmax];

struct Pair
{
    mutable ll first, second;
    bool operator < (const Pair &other) const
    {
        if(first == other.first) return second < other.second;
        return first < other.first;
    }
};

void add(vector<Pair> &w, ll A, ll B)
{
    while(w.size())
    {
        if(B >= w.back().first)
            B += w.back().second - w.back().first;
        else if(A > B)
        {
            A += w.back().first - B;
            B = w.back().second;
        }
        else break;
        w.pop_back();
    }

  //  assert(A <= B);
  //  if(w.size()) assert(w.back().first >= B);
    w.push_back({A, B});
}

ll transformm(vector<int> &v, vector<Pair> &w)
{
    int i = 0;
    ll sum = 0, K, Q;

    while(i<v.size() && v[i] > 0) sum += v[i++];

    add(w, 0, Target);
    vector<Pair> to_add;

    for(; i<v.size(); )
    {
        K = 0;
        while(i < v.size() && v[i] <= 0) K += v[i++];
        Q = 0;
        while(i < v.size() && v[i] > 0) Q += v[i++];
        to_add.push_back({-K, Q});
    }

    reverse(to_add.begin(), to_add.end());
    for(auto it : to_add)
        add(w, it.first, it.second);
    reverse(w.begin(), w.end());
    return sum;
}

void Merge(vector<Pair> &a, vector<Pair> &b, multiset<Pair> &S)
{
    for(auto it : b) S.insert(it);

    for(auto it : a)
    {
        multiset<Pair> :: iterator t;

        t = S.insert(it);
        while(next(t) != S.end() && t->second > next(t)->first)
        {
            t->second += next(t)->second - next(t)->first;
            S.erase(next(t));
        }

        while(t != S.begin() && prev(t)->second > t->first)
        {
            t->second += prev(t)->second - t->first;
            t->first = prev(t)->first;
            S.erase(prev(t));
        }
    }
}

bool check(int S)
{
    if(2LL * S * T >= lim) return 1;

    vector<int> A, B;

    int i;
    for(i=1; i<K; ++i) A.push_back(2 * S * T - (X[i+1] - X[i])); reverse(A.begin(), A.end());
    for(i=K+1; i<=n; ++i) B.push_back(2 * S * T - (X[i] - X[i-1]));

    vector<Pair> a, b;
    multiset<Pair> c;

    ll sum = 0;
    sum = transformm(A, a) + transformm(B, b);
    Merge(a, b, c);

    for(auto it : c)
    {
        if(sum < it.first) break;
        sum -= it.first;
        sum += it.second;
    }
    return (sum >= 2 * Target);
}

int main()
{
  //  freopen("input", "r", stdin);
    cin.sync_with_stdio(false);

    int i;
    cin >> n >> K >> T;
    for(i=1; i<=n; ++i) cin >> X[i];

    int st = 0, dr = 1e9, mid;
    while(st <= dr)
    {
        mid = (st+dr) / 2;
        if(check(mid)) dr = mid-1;
            else st = mid+1;
    }

    cout << st << '\n';
    return 0;
}

Compilation message (stderr)

sparklers.cpp: In function 'll transformm(std::vector<int>&, std::vector<Pair>&)':
sparklers.cpp:47:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(i<v.size() && v[i] > 0) sum += v[i++];
           ~^~~~~~~~~
sparklers.cpp:52:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(; i<v.size(); )
           ~^~~~~~~~~
sparklers.cpp:55:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i < v.size() && v[i] <= 0) K += v[i++];
               ~~^~~~~~~~~~
sparklers.cpp:57:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i < v.size() && v[i] > 0) Q += v[i++];
               ~~^~~~~~~~~~
sparklers.cpp: In function 'bool check(int)':
sparklers.cpp:99:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1; i<K; ++i) A.push_back(2 * S * T - (X[i+1] - X[i])); reverse(A.begin(), A.end());
     ^~~
sparklers.cpp:99:66: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(i=1; i<K; ++i) A.push_back(2 * S * T - (X[i+1] - X[i])); reverse(A.begin(), A.end());
                                                                  ^~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 20
• Subtask 3: 0 / 50