oj.uz

Submission #473040

# Submission time Handle Problem Language Result Execution time Memory
473040 2021-09-14T19:35:57 Z hidden1 Lightning Conductor (POI11_pio) C++14
63 / 100
 117 ms 4184 KB 
#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 = 2e5 + 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.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2636 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2684 KB Output is correct
2 Correct 48 ms 2208 KB Output is correct
3 Correct 51 ms 2704 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 3652 KB Output is correct
2 Correct 117 ms 3604 KB Output is correct
3 Correct 96 ms 3700 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 4112 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 4156 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 4184 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 30 ms 4108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -