Submission #701400

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
701400	2023-02-21T07:41:35 Z	Do_you_copy	Lightning Conductor (POI11_pio)	C++17	100 / 100	89 ms	11172 KB

pio

#include <bits/stdc++.h>
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back

using namespace std;
using ll = long long;
using pii = pair <int, int>;

const int maxN = 5e5 + 10;
const int inf = 0x3f3f3f3f;
//const int Mod =
int n;
int a[maxN];
int pre[maxN];
int suf[maxN];
void Init(){
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    int maxx = -1;
    for (int i = 1; i <= n; ++i){
        if (a[i] <= maxx) continue;
        maxx = a[i];
        for (int j = 1; i + (j - 1) * (j - 1) + 1 <= n; ++j){
            pre[i + (j - 1) * (j - 1) + 1] = max(pre[i + (j - 1) * (j - 1) + 1], a[i] + j);
        }
    }
    maxx = -1;
    for (int i = n; i >= 1; --i){
        if (a[i] <= maxx) continue;
        maxx = a[i];
        for (int j = 1; i - (j - 1) * (j - 1) - 1 > 0; ++j){
            suf[i - (j - 1) * (j - 1) - 1] = max(suf[i - (j - 1) * (j - 1) - 1], a[i] + j);
        }
    }

    for (int i = 1; i <= n; ++i){
        pre[i] = max(pre[i], pre[i - 1]);
    }
    for (int i = n; i >= 1; --i){
        suf[i] = max(suf[i], suf[i + 1]);
    }
    for (int i = 1; i <= n; ++i){
        cout << max({suf[i], pre[i], a[i]}) - a[i] << "\n";
    }
}

#define taskname "test"
signed main(){
    faster
    if (fopen(taskname ".inp", "r")){
        freopen(taskname ".inp", "r", stdin);
        freopen(taskname ".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
    }
}

Compilation message

pio.cpp: In function 'int main()':
pio.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         freopen(taskname ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pio.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen(taskname ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

9.0 / 9.0

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

Subtask #2

9.0 / 9.0

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

Subtask #3

9.0 / 9.0

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

Subtask #4

9.0 / 9.0

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

Subtask #5

9.0 / 9.0

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

Subtask #6

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	1364 KB	Output is correct
2	Correct	12 ms	1284 KB	Output is correct
3	Correct	13 ms	1912 KB	Output is correct

Subtask #7

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	1896 KB	Output is correct
2	Correct	22 ms	1884 KB	Output is correct
3	Correct	17 ms	2388 KB	Output is correct

Subtask #8

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	4100 KB	Output is correct
2	Correct	39 ms	3912 KB	Output is correct
3	Correct	35 ms	4556 KB	Output is correct

Subtask #9

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	7884 KB	Output is correct
2	Correct	58 ms	5852 KB	Output is correct
3	Correct	55 ms	7920 KB	Output is correct

Subtask #10

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	89 ms	11148 KB	Output is correct
2	Correct	82 ms	8152 KB	Output is correct
3	Correct	81 ms	11172 KB	Output is correct

Subtask #11

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	8680 KB	Output is correct
2	Correct	81 ms	8152 KB	Output is correct
3	Correct	85 ms	11068 KB	Output is correct