Submission #473041

#	Time	Username	Problem	Language	Result	Execution time	Memory
473041		hidden1	Lightning Conductor (POI11_pio)	C++14	81 / 100	1068 ms	15644 KiB

pio

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define debug(...) cout << "Line: " << __LINE__ << endl; \
    printDebug(", "#__VA_ARGS__, __VA_ARGS__)
template <typename T>
void printDebug(const char* name, T&& arg1) { cout << (name + 2) << " = " << arg1 << endl; }
template <typename T, typename... T2>
void printDebug(const char* names, T&& arg1, T2&&... args) {
    const char* end = strchr(names + 1, ',');
    cout.write(names + 2, end - names - 2) << " = " << arg1 << endl;
    printDebug(end, args...);
}

const int MAX_N = 5e5 + 10;
int arr[MAX_N];
int sqr[MAX_N];
int n;
int lftans[MAX_N], rghtans[MAX_N];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cin >> n;
    for(int i = 0; i < n; i ++) {
        cin >> arr[i];
    }
    for(int i = 1; i < 1000; i ++) {
        for(int j = (i - 1) * (i - 1) + 1; j <= min(i * i, MAX_N - 1); j ++) {
            sqr[j] = i;
        }
    }
    for(int i = 0; i < n; i ++) {
        if(i != 0) {
            lftans[i] = lftans[i - 1];
        }
        for(int j = 0; j < 1000; j ++) {
            if(i - j * j - 1 < 0) {break;}
            chkmax(lftans[i], j + 1 + arr[i - j * j - 1]);
        }
    }
    for(int i = n - 1; i >= 0; i --) {
        if(i != n - 1) {
            rghtans[i] = rghtans[i + 1];
        }
        for(int j = 0; j < 1000; j ++) {
            if(i + j * j + 1 > n - 1) {break;}
            chkmax(rghtans[i], j + 1 + arr[i + j * j + 1]);
        }
    }
    for(int i = 0; i < n; i ++) {
        cout << max(0, max(lftans[i], rghtans[i]) - arr[i]) << endl;;
    }
    return 0;
}

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