oj.uz

Submission #992517

# Submission time Handle Problem Language Result Execution time Memory
992517 2024-06-04T14:25:07 Z LOLOLO Doktor (COCI17_doktor) C++14
100 / 100
 104 ms 46724 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 1e6 + 100;
const int M = 5e5 + 10;
int a[N], S[N], P[N];
vector <int> pos[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pos[a[i] + i].pb(i);
    }

    for (int i = 1; i <= n; i++) {
        if (i == a[i]) 
            S[i]++;

        S[i] += S[i - 1];
    }

    for (int i = n; i >= 1; i--) {
        if (i == a[i])
            P[i]++;

        P[i] += P[i + 1];
    }

    int x = 1, y = 1, ans = S[n];
    for (int i = 1; i <= n; i++) {
        int l = min(i, a[i]), r = max(a[i], i), t = a[i] + i, add = P[r + 1] + S[l - 1];
        int R = lower_bound(all(pos[t]), l) - pos[t].begin();
        int L = upper_bound(all(pos[t]), r) - pos[t].begin();
        if (ans < L - R + add) {
            ans = L - R + add;
            x = a[l], y = a[r];
        }
    }

    cout << x << " " << y << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27228 KB Output is correct
2 Correct 4 ms 27260 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27480 KB Output is correct
2 Correct 50 ms 29544 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29532 KB Output is correct
2 Correct 17 ms 28140 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 43140 KB Output is correct
2 Correct 82 ms 34048 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 34988 KB Output is correct
2 Correct 75 ms 46724 KB Output is correct