oj.uz

Submission #200929

# Submission time Handle Problem Language Result Execution time Memory
200929 2020-02-08T15:41:50 Z SamAnd Doktor (COCI17_doktor) C++17
80 / 100
 268 ms 39544 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
const int N = 500005;

int n;
int a[N];

int p[N];

vector<pair<int, int> > v[N + N];

int ans;
int ansl, ansr;

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i)
    {
        p[i] = p[i - 1];
        if (a[i] == i)
            ++p[i];
        v[i + a[i]].push_back(m_p(min(i, a[i]), max(i, a[i])));
    }
    ans = p[n];
    ansl = ansr = 1;
    for (int i = 0; i <= n + n; ++i)
    {
        sort(v[i].begin(), v[i].end());
        reverse(v[i].begin(), v[i].end());
        for (int j = 0; j < v[i].size(); ++j)
        {
            int l = v[i][j].first, r = v[i][j].second;
            if ((j + 1) + p[l - 1] + p[n] - p[r] - (p[r] - p[l - 1]) > ans)
            {
                ans = (j + 1) + p[l - 1] + p[n] - p[r] - (p[r] - p[l - 1]);
                ansl = l;
                ansr = r;
            }
        }
    }
    printf("%d %d\n", a[ansl], a[ansr]);
    return 0;
}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:34:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < v[i].size(); ++j)
                         ~~^~~~~~~~~~~~~
doktor.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
doktor.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23924 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 26744 KB Output is correct
2 Correct 46 ms 25712 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 39544 KB Output is correct
2 Correct 161 ms 31708 KB Output is correct

Subtask #10
0 / 10.0

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