oj.uz

Submission #235191

# Submission time Handle Problem Language Result Execution time Memory
235191 2020-05-27T09:39:25 Z kartel Doktor (COCI17_doktor) C++14
100 / 100
 212 ms 42744 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 +1000500
#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;

vector <int> Le[N];
int pr[N], a[N], kol, i, mid, n, ans = -1, l, r;

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];
        pr[i] = pr[i - 1] + (a[i] == i);
    }
    for (i = 1; i <= n; i++) Le[a[i] + i].pb(abs(a[i] - i));

    for (mid = 2; mid <= n * 2; mid++)
    {
        sort(Le[mid].begin(), Le[mid].end());
        kol = 0;
        for (auto len : Le[mid])
        {
            kol++;
            int left = mid / 2 - len / 2;
            int right = mid / 2 + (len + 1) / 2;

            if (ans < kol - (pr[right] - pr[left]))
            {
                ans = kol - pr[right] + pr[left];
                l = left;
                r = right;
            }
        }
    }

    cout << a[l] << " " << a[r];
}

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

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23936 KB Output is correct
2 Correct 19 ms 24088 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23936 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24192 KB Output is correct
2 Correct 94 ms 28400 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 26616 KB Output is correct
2 Correct 40 ms 25336 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 39032 KB Output is correct
2 Correct 138 ms 29936 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 32888 KB Output is correct
2 Correct 106 ms 42744 KB Output is correct