oj.uz

Submission #235153

# Submission time Handle Problem Language Result Execution time Memory
235153 2020-05-27T07:56:15 Z kartel Doktor (COCI17_doktor) C++14
60 / 100
 1000 ms 6264 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 ps[N], a[N], sf[N], kol, i, n, ans, le, ri;
 
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];
        ps[a[i]] = i;
    }
 
    for (i = n; i >= 1; i--) sf[i] = sf[i + 1] + (a[i] == i);
 
    for (i = 1; i <= n; i++)
    {
        int l = i, L = l;
        int r = ps[i];
        int len = r - l + 1;
        int kl = sf[r + 1];
 
        for (; l <= r; l++)
            if (a[l] == i + len - l + L - 1) kl++;
 
        kl += kol;
 
        if (kl > ans)
        {
            ans = kl;
            le = L;
 
            ri = r;
        }
 
        if (a[i] == i) kol++;
    }
    if (le > ri) swap(le, ri);
    cout << a[le] << " " << a[ri];
}
 
//110000
//110000
//001100
//001100
//000011

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 512 KB Output is correct
2 Execution timed out 1097 ms 3832 KB Time limit exceeded

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 1408 KB Output is correct
2 Correct 633 ms 1580 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 6264 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 1096 ms 3704 KB Time limit exceeded
2 Halted 0 ms 0 KB -