oj.uz

Submission #1025902

# Submission time Handle Problem Language Result Execution time Memory
1025902 2024-07-17T11:06:32 Z vjudge1 Doktor (COCI17_doktor) C++17
70 / 100
 94 ms 11580 KB 
#include<bits/stdc++.h>

using namespace std;

int main()
{
  int n;
  cin >> n;
  int a[n], idx[1 + n];
  for(int i = 0; i < n; i ++) {
    cin >> a[i];
    idx[a[i]] = i;
  }

  int cnt[2 * n] = {};
  for(int i = 1; i <= n; i ++)
    cnt[idx[i] + i]++;

  int pref[n + 1];
  for(int i = 0; i < n; i ++) {
    pref[i + 1] = pref[i];
    if(i + 1 == a[i])
      pref[i + 1]++;
  }

  pair<int,int> ans = {1, 1};
  int mx = 0;
  for(int i = 1; i <= n; i ++)
    {
      int j = max(idx[i] + 1, i), k = min(idx[i] + 1, i);
      int profit = cnt[i + idx[i]];
      if(profit > mx)
	{
	  mx = profit;
	  ans = {a[k - 1], a[j - 1]};
	}
    }
  
  cout << ans.first << ' ' << ans.second << endl;
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 54 ms 7508 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 5972 KB Output is correct
2 Correct 86 ms 11580 KB Output is correct