oj.uz

Submission #116903

# Submission time Handle Problem Language Result Execution time Memory
116903 2019-06-14T04:05:47 Z souhhcong Doktor (COCI17_doktor) C++14
90 / 100
 404 ms 41368 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define st first
#define nd second
const int N = 5e5+5;
int n, a[N];
int center[N];
int pref[N];
vector<pair<int,int>> seg[2*N];
int mx = 0;
pair<int,int> ans = {1,1};
int cnt = 0;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] == i)
        {
            cnt++;
        }
        pref[i] = cnt;
        center[i] = a[i]+i;
        if (a[i] < i)
            seg[center[i]].push_back({a[i],i});
        else
            seg[center[i]].push_back({i,a[i]});
    }
    for (int i = 1; i <= 2*n; i++)
    {
        if (seg[i].size() == 0) continue;
        int tmp = 1 - (pref[seg[i][0].nd] - pref[seg[i][0].st-1]);
        if (tmp > mx)
        {
            mx = tmp;
            ans = seg[i][0];
        }

        sort(seg[i].begin(),seg[i].end(), greater<pair<int,int> >() );
        for (int j = 1; j < seg[i].size(); j++)
        {
            int l = seg[i][j-1].st, r = seg[i][j-1].nd, L = seg[i][j].st, R = seg[i][j].nd;
            tmp++;
            tmp -= (pref[l-1] - pref[L-1] + pref[R] - pref[r]);
            if (tmp > mx)
            {
                mx = tmp;
                ans = seg[i][j];
            }
        }

    }
    cout << a[ans.st] << ' ' << a[ans.nd];

}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:45:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 1; j < seg[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23832 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 22 ms 23936 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 24184 KB Output is correct
2 Correct 155 ms 31144 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 26992 KB Output is correct
2 Correct 73 ms 25836 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 41368 KB Output is correct
2 Correct 238 ms 33756 KB Output is correct

Subtask #10
0 / 10.0

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