Submission #308070

#	Time	Username	Problem	Language	Result	Execution time	Memory
308070		caoash	Lightning Conductor (POI11_pio)	C++14	27 / 100	1093 ms	4224 KiB

pio

#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

int a[MX];

namespace output {
  void pr(int x) {
    cout << x;
  }
  void pr(long x) {
    cout << x;
  }
  void pr(ll x) {
    cout << x;
  }
  void pr(unsigned x) {
    cout << x;
  }
  void pr(unsigned long x) {
    cout << x;
  }
  void pr(unsigned long long x) {
    cout << x;
  }
  void pr(float x) {
    cout << x;
  }
  void pr(double x) {
    cout << x;
  }
  void pr(long double x) {
    cout << x;
  }
  void pr(char x) {
    cout << x;
  }
  void pr(const char * x) {
    cout << x;
  }
  void pr(const string & x) {
    cout << x;
  }
  void pr(bool x) {
    pr(x ? "true" : "false");
  }

  template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
  template < class T > void pr(const T & x);

  template < class T, class...Ts > void pr(const T & t,
    const Ts & ...ts) {
    pr(t);
    pr(ts...);
  }
  template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
    pr("{", x.f, ", ", x.s, "}");
  }
  template < class T > void pr(const T & x) {
    pr("{"); // const iterator needed for vector<bool>
    bool fst = 1;
    for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
    pr("}");
  }

  void ps() {
    pr("\n");
  } // print w/ spaces
  template < class T, class...Ts > void ps(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(" ");
    ps(ts...);
  }

  void pc() {
    cout << "]" << endl;
  } // debug w/ commas
  template < class T, class...Ts > void pc(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(", ");
    pc(ts...);
  }
  #define dbg(x...) pr("[", #x, "] = ["), pc(x);
}

#ifdef LOCAL
using namespace output;
#endif

struct Node {
    int val;
};

template<int SZ> struct Seg {
    Node tree[4*SZ];

    Node merge(Node a, Node b){
        if (a.val >= b.val) return a;
        else return b;
    }
    
    void build(int v, int l, int r) {
        if (l == r) {
            tree[v].val = a[l];
        }
        else {
            int m = (l + r) / 2;
            build(2 * v + 1, l, m);
            build(2 * v + 2, m + 1, r);
            tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
        }
    }

    Node query(int v, int l, int r, int ql, int qr) {
        if (l > qr || r < ql) {
            Node init;
            init.val = 0;
            return init;
        } else if (l >= ql && r <= qr) {
            return tree[v];
        } else {
            int m = (l + r) / 2;
            Node a = query(2 * v + 1, l, m, ql, qr);
            Node b = query(2 * v + 2, m + 1, r, ql, qr);
            return merge(a, b);
        }
    }
};

int n; 
Seg<MX> tree;

int qmx(int l, int r) {
    return tree.query(0, 0, n - 1, l, r).val;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    tree.build(0, 0, n - 1);
    for (int i = 0; i < n; i++) {
        int prev = i;
        int ret = 0;
        int j, k, c;
        if (i != 0) {
            for (j = i - 1, k = 3, c = 1; j >= 0; j -= k, k += 2, c++) {
                int l = j, r = prev - 1;
                // dbg(j, k, l, r);
                ret = max(ret, qmx(l, r) + c);
                prev = j;
            }
            if (j < 0) {
                int l = 0, r = prev - 1;
                if (l <= r) ret = max(ret, qmx(l, r) + c);
            }
            prev = i;
        }
        if (i != n - 1) {
            for (j = i + 1, k = 3, c = 1; j < n; j += k, k += 2, c++) {
                int l = prev + 1, r = j;
                ret = max(ret, qmx(l, r) + c);
                prev = j;
            }
            if (j >= n) {
                int l = prev + 1, r = n - 1;
                if (l <= r) ret = max(ret, qmx(l, r) + c);
            }
        }
        // dbg(ret);
        cout << ret - a[i] << '\n';
    }
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10