oj.uz

Submission #992499

# Submission time Handle Problem Language Result Execution time Memory
992499 2024-06-04T14:14:10 Z LOLOLO Doktor (COCI17_doktor) C++14
0 / 100
 127 ms 43096 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 = 0;
    for (int i = 1; i <= n; i++) {
        int l = min(i, a[i]), r = max(a[i], i), t = a[i] + i;
        int L = lower_bound(all(pos[t]), l) - pos[t].begin() + S[l - 1];
        int R = upper_bound(all(pos[t]), r) - pos[t].begin() + P[r + 1];
        if (ans < L + R) {
            ans = L + R;
            x = a[l], y = a[r];
        }
    }

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

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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