oj.uz

Submission #886873

# Submission time Handle Problem Language Result Execution time Memory
886873 2023-12-13T06:01:02 Z vjudge1 Doktor (COCI17_doktor) C++17
60 / 100
 126 ms 46088 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) (x).begin(), (x).end()

const int MAXN = 5E5 + 5;

vector <int> vall[2 * MAXN];

#define ONLINE_JUDGE
void solve() {
    int n;
    cin >> n;

    vector <int> v(n +1);
    for(int i = 1; i <= n; i++) {
        cin >> v[i];
    }

    vector <int> pref(n +2), suf(n +2);
    for(int i = 1; i <= n; i++) {
        pref[i] = pref[i -1] + (v[i] == i);
    }

    for(int i = n; i >= 1; i--) {
        suf[i] = suf[i +1] + (v[i] == i);
    }

    vector <int> c(n +1);
    for(int i = 1; i <= n; i++) {
        c[i] = v[i] + i;
        vall[c[i]].emplace_back(i);
        //cerr << c[i] << " \n"[i == n];
    }

    array <int, 3> ans = {-1, 0, 0};
    for(int i = 1; i <= n; i++) {
        int l = min(i, v[i]), r = max(i, v[i]);
        auto it1 = lower_bound(all(vall[i + v[i]]), l);
        auto it2 = lower_bound(all(vall[i + v[i]]), r);
        int calc = pref[l -1] + (it2 - it1) + suf[r +1];

        if(calc > ans[0]) {
            ans = {calc, v[l], v[r]};
        }
    }

    cout << ans[1] << " " << ans[2];

    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23900 KB Output is correct
2 Incorrect 5 ms 23916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23948 KB Output is correct
2 Incorrect 5 ms 24152 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24372 KB Output is correct
2 Correct 58 ms 32720 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 27728 KB Output is correct
2 Correct 22 ms 26844 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 46088 KB Output is correct
2 Correct 91 ms 37068 KB Output is correct

Subtask #10
0 / 10.0

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