oj.uz

Submission #235141

# Submission time Handle Problem Language Result Execution time Memory
235141 2020-05-27T07:30:09 Z kartel Doktor (COCI17_doktor) C++14
10 / 100
 1000 ms 6136 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +500500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int a[N], pr[N], sf[N], i, mid, len, cur, ans, le, ri, n;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i];

    for (i = 1; i <= n; i++) pr[i] = pr[i - 1] + (a[i] == i);
    for (i = n; i >= 1; i--) sf[i] = sf[i + 1] + (a[i] == i);

    for (mid = 1; mid <= n; mid++)
    {
        cur = (a[mid] == mid);
        if (ans < cur + pr[mid - 1] + sf[mid + 1])
        {
            ans = cur + pr[mid - 1] + sf[mid + 1];
            le = mid;
            ri = mid;
        }

        for (len = 1; len <= n && mid - len >= 1 && mid + len <= n; len++)
        {
            if (a[mid - len] - mid == len) cur++;
            if (mid - a[mid + len] == len) cur++;

            if (ans < cur + pr[mid - len] + sf[mid + len])
            {
                ans = cur + pr[mid - len] + sf[mid + len];
                le = mid - len;
                ri = mid + len;
            }
        }
        cur = 0;

        for (len = 1; len <= n && mid - len + 1 >= 1 && mid + len - 1 <= n; len++)
        {
            if (a[mid - len] - mid == len - 1) cur++;
            if (mid - a[mid + len - 1] == len) cur++;

            if (ans < cur + pr[mid - len] + sf[mid + len])
            {
                ans = cur + pr[mid - len] + sf[mid + len];
                le = mid - len;
                ri = mid + len - 1;
            }
        }
    }
    cout << ri << " " << le;
}

//110000
//110000
//001100
//001100
//000011

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Failed 5 ms 384 KB Checker failed - contact admins or jury

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 1408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 6136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 3704 KB Time limit exceeded
2 Halted 0 ms 0 KB -