Submission #243392

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
243392	2020-07-01T02:03:22 Z	Fischer	Lightning Conductor (POI11_pio)	C++14	27 / 100	133 ms	13176 KB

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Miguel Mini
 */

#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <complex>
#include <climits>
#include <iomanip>
#define sz(x) (int)x.size()
#define trav(v, x) for (auto v : x)
#define re(x, y, z) for (int x=y; x<z; ++x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define set_to(x, v) fill(all(x), v)
#define eb emplace_back
#define lso(x) ((x)&-(x))
#define mset(m ,v) memset(m, v, sizeof(m))
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
const int mod = 1e9 + 7;

int add(int a, int b, int m=mod) {
    return a+b < mod? a+b : a+b-mod;
}

int mul(ll a, ll b, int m=mod) {
    return a*b%mod;
}

int ex(int a, int b, int m=mod) {
    int r=1;
    while (r > 0) {
        if (b&1) r = mul(r, a);
        a = mul(a, a);
        b >>= 1;
    }
    return r;
}

const int inf = 1.2e9;
const int maxn = 5e5 + 10;

struct Node {
    int x, y;
};
deque<Node> lower;
int pot[maxn * 3];

int eval(Node p, int x) {
  return p.y + pot[abs(p.x - x)];
}

bool is_left(Node o, Node a, Node b) {
  ll alpha_x = a.x - o.x;
  ll alpha_y = a.y - o.y;
  ll beta_x = b.x - o.x;
  ll beta_y = b.y - o.y;
  return (alpha_x + alpha_y) * (alpha_x + alpha_y) * beta_y >= (beta_x + beta_y) * (beta_x + beta_y) * alpha_y;
}

void add(Node p) {
  int n = lower.size();
  if (!lower.empty() && lower[n-1].y >= p.y) {
    return;
  }
  while ((n >= 1 && eval(lower[n-1], p.x) <= p.y) || (n >= 2 && is_left(lower[n-2], lower[n-1], p))) {
    lower.pop_back();
    n -= 1;
  }
  lower.push_back(p);
}

int get(int x) {
  while (sz(lower) >= 2 && eval(lower[0], x) <= eval(lower[1], x)) {
    lower.pop_front();
  }
  return eval(lower[0], x);
}

class POI_11_conductor {
public:
    void solveOne(istream& in, ostream& out) {
      int n;
      in >> n;
      vi h(n);
      re(i, 0, n) {
        in >> h[i];
      }
      re(i, 0, 1001) {
          re(j, i * i + 1, (i + 1) * (i + 1) + 1) {
            pot[j] = i + 1;
          }
      }
      vi ans = h;
      re(i, 0, n) {
        add({i, h[i]});
        ans[i] = max(ans[i], get(i));
      }
      reverse(all(ans));
      reverse(all(h));
      lower.clear();
      re(i, 0, n) {
        add({i, h[i]});
        ans[i] = max(ans[i], get(i));
      }
      reverse(all(ans));
      reverse(all(h));
      re(i, 0, n) {
        out << ans[i] - h[i] << '\n';
      }
    }

    void solve(istream& in, ostream& out) {
        out.precision(10);
        out << fixed;
        int testNumber = 1;
        //in >> testNumber;
        re(tc, 1, testNumber+1) {
            //out << "Case #" << tc << ": ";
            solveOne(in, out);
        }
    }
};


int main() {
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    POI_11_conductor solver;
    std::istream& in(std::cin);
    std::ostream& out(std::cout);
    solver.solve(in, out);
    return 0;
}

Subtask #1
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	7 ms	4352 KB	Output isn't correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4352 KB	Output is correct

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	8 ms	4224 KB	Output isn't correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	4864 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	5120 KB	Output is correct

Subtask #6
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	5120 KB	Output is correct
2	Correct	19 ms	5120 KB	Output is correct
3	Incorrect	20 ms	5752 KB	Output isn't correct

Subtask #7
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	32 ms	5496 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	66 ms	7160 KB	Output is correct
2	Correct	62 ms	8952 KB	Output is correct
3	Incorrect	60 ms	8952 KB	Output isn't correct

Subtask #9
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	102 ms	10540 KB	Output is correct
2	Correct	95 ms	8440 KB	Output is correct
3	Incorrect	87 ms	10616 KB	Output isn't correct

Subtask #10
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	132 ms	13176 KB	Output is correct
2	Correct	133 ms	10232 KB	Output is correct
3	Incorrect	129 ms	13176 KB	Output isn't correct

Subtask #11
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	131 ms	10708 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Submission #243392

Compilation message