Submission #308076

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
308076	2020-09-30T02:49:27 Z	caoash	Lightning Conductor (POI11_pio)	C++14	45 / 100	1000 ms	43780 KB

#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 = 500005;
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

int n;

int st[MX + 1][20];
int lg[MX + 1];

void pre() {
    for (int i = 0; i < n; i++) {
        st[i][0] = a[i];
    }
    for (int j = 1; j <= 19; j++) {
        for (int i = 0; i + (1 << j) <= n; i++) {
            st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
        }
    }
    lg[1] = 0;
    for (int i = 2; i <= MX; i++) {
        lg[i] = lg[i / 2] + 1;
    }
}

int qmx(int l, int r) {
    int j = lg[r - l + 1];
    int ret = max(st[l][j], st[r - (1 << j) + 1][j]);
    return ret;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    pre();
    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.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2304 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2304 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2432 KB	Output is correct

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	244 ms	8060 KB	Output is correct
2	Correct	257 ms	8056 KB	Output is correct
3	Correct	275 ms	8568 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	784 ms	10872 KB	Output is correct
2	Correct	741 ms	11896 KB	Output is correct
3	Correct	733 ms	12024 KB	Output is correct

Subtask #8
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1041 ms	21568 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1088 ms	31736 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1053 ms	43780 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1097 ms	43768 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #308076

Compilation message