제출 #413100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413100		usachevd0	모임들 (IOI18_meetings)	C++14	17 / 100	147 ms	9928 KiB

meetings

#include <bits/stdc++.h>
#ifndef LOCAL
    #include "meetings.h"
#endif

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define Time (clock() * 1.0 / CLOCKS_PER_SEC)
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
    return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
    return y > x ? (x = y, true) : false;
}
void debug_out() {
    cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
    cerr << ' ' << A;
    debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
#ifdef LOCAL
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
    for (auto& x : v)
        stream << x << ' ';
    return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
    return stream << p.first << ' ' << p.second;
}

const int maxN = 750005;
ll cost[maxN];
int a[maxN];

namespace sgt {
    const int logN = 17;
    const int N = 1 << logN;
    struct Node {
        int len, mx, pref, suff;
        
        Node() {
            len = mx = pref = suff = 0;
        }
        Node(int x) {
            len = 1;
            if (x == 2) {
                mx = pref = suff = 0;
            } else {
                mx = pref = suff = 1;
            }
        }
    } t[2 * N];
    Node operator * (const Node& lhs, const Node& rhs) {
        Node res;
        res.len = lhs.len + rhs.len;
        res.pref = lhs.pref;
        if (res.pref == lhs.len)
            res.pref += rhs.pref;
        res.suff = rhs.suff;
        if (res.suff == rhs.len)
            res.suff += lhs.suff;
        res.mx = max({lhs.mx, rhs.mx, lhs.suff + rhs.pref});
        return res;
    }
    
    void build(int v, int vl, int vr) {
        if (vl == vr) {
            t[v] = Node(a[vl]);
            return;
        }
        int vm = (vl + vr) >> 1;
        build(v << 1, vl, vm);
        build(v << 1 | 1, vm + 1, vr);
        t[v] = t[v << 1] * t[v << 1 | 1];
    }
    
    Node gt(int v, int vl, int vr, int l, int r) {
        if (l > r || vr < l || r < vl) return Node();
        if (l <= vl && vr <= r) return t[v];
        int vm = (vl + vr) >> 1;
        return gt(v << 1, vl, vm, l, r) * gt(v << 1 | 1, vm + 1, vr, l, r);
    }
}

vector<ll> minimum_costs(vector<int> _a, vector<int> ql, vector<int> qr) {
    int n = _a.size(), Q = ql.size();
    for (int i = 0; i < n; ++i)
        a[i] = _a[i];
    sgt::build(1, 0, n - 1);
    vector<ll> ans(Q);
    for (int j = 0; j < Q; ++j) {
        int l = ql[j], r = qr[j];
        /*fill(cost + l, cost + r + 1, 0);
        vector<int> stk = {l - 1};
        ll sum = 0;
        for (int i = l; i <= r; ++i) {
            while (stk.back() >= l && a[stk.back()] <= a[i]) {
                int sz = stk.size();
                sum -= a[stk.back()] * (ll)(stk[sz - 1] - stk[sz - 2]);
                stk.pop_back();
            }
            sum += a[i] * (ll)(i - stk.back());
            stk.push_back(i);
            cost[i] = sum;
        }
        stk = {r + 1};
        sum = 0;
        for (int i = r; i >= l; --i) {
            while (stk.back() <= r && a[stk.back()] <= a[i]) {
                int sz = stk.size();
                sum -= a[stk.back()] * (ll)(stk[sz - 2] - stk[sz - 1]);
                stk.pop_back();
            }
            sum += a[i] * (ll)(stk.back() - i);
            stk.push_back(i);
            cost[i] += sum - a[i];
        }
        ans[j] = *min_element(cost + l, cost + r + 1);*/
        
        auto N = sgt::gt(1, 0, n - 1, l, r);
        ans[j] = 2 * N.len - N.mx;
    }
    return ans;
}



#ifdef LOCAL

int read_int() {
  int x;
  if (scanf("%d", &x) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }
  return x;
}

int32_t main() {
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int N = read_int();
  int Q = read_int();
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    H[i] = read_int();
  }
  std::vector<int> L(Q), R(Q);
  for (int j = 0; j < Q; ++j) {
    L[j] = read_int();
    R[j] = read_int();
  }

  std::vector<long long> C = minimum_costs(H, L, R);
  for (size_t j = 0; j < C.size(); ++j) {
    printf("%lld\n", C[j]);
  }
  return 0;

    return 0;
}
#endif

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