oj.uz

Submission #425595

# Submission time Handle Problem Language Result Execution time Memory
425595 2021-06-13T08:20:25 Z MilosMilutinovic Exam (eJOI20_exam) C++14
12 / 100
 1000 ms 1112 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long unsigned long ull;
typedef double long ld;

int n, a[100050], b[100050];

void solve2() {
  for (int i = 1; i <= n; i++) {
    if (a[i] == b[i]) {
      for (int j = i + 1; j <= n; j++) {
        if (a[j] >= a[i]) {
          break;
        }
        a[j] = a[i];
      }
      for (int j = i - 1; j >= 1; j--) {
        if (a[j] >= a[i]) {
          break;
        }
        a[j] = a[i];
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += (a[i] == b[i] ? 1 : 0);
  }
  cout << ans << '\n';
}

int main() {
  ios::sync_with_stdio(!cin.tie(0));

  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    cin >> b[i];
  }
  if (*max_element(b + 1, b + n + 1) == *min_element(b + 1, b + n + 1)) {
    solve2();
    return 0;
  }
  bool sub3 = true;
  for (int i = 2; i <= n; i++) {
    if (a[i] <= a[i - 1]) {
      sub3 = false;
    }
  }
  if (sub3) {
    map<int, int> mp;
    for (int i = 1; i <= n; i++) {
      mp[a[i]] = i;
    }
    for (int i = 1; i <= n; i++) {
      b[i] = mp[b[i]];
    }
    vector<int> dp(n + 1);
    for (int i = 1; i <= n; i++) {
      dp[i] = 1;
      for (int j = 1; j < i; j++) {
        if (b[j] > 0 && b[i] >= b[j]) {
          dp[i] = max(dp[i], dp[j] + 1);
        }
      }
    }
    cout << *max_element(dp.begin(), dp.end()) << '\n';
    return 0;
  }
  if (n <= 10) {
    auto c = a;
    int ans = 0;
    function<void(int*)> Brut = [&](int* niz) {
      int cnt = 0;
      for (int i = 1; i <= n; i++) {
        cnt += niz[i] == b[i];
      }
      ans = max(ans, cnt);
      for (int i = 1; i <= n; i++) {
        int mx = 0;
        int novi[n + 1];
        for (int j = 1; j <= n; j++) {
          novi[j] = niz[j];
        }
        for (int j = i; j <= n; j++) {
          mx = max(mx, niz[j]);
          bool ok = false;
          for (int l = i; l <= j; l++) {
            if (niz[l] != mx) {
              ok = true;
            }
            novi[l] = mx;
          }
          if (ok) {
            Brut(novi);
          }
        }
      }
    };
    Brut(c);
    cout << ans << '\n';
  }
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 31 ms 204 KB Output is correct
4 Correct 42 ms 304 KB Output is correct
5 Execution timed out 1088 ms 204 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 18 ms 1100 KB Output is correct
4 Correct 15 ms 1100 KB Output is correct
5 Correct 28 ms 992 KB Output is correct
6 Correct 16 ms 1112 KB Output is correct
7 Correct 21 ms 964 KB Output is correct
8 Correct 26 ms 1100 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 31 ms 204 KB Output is correct
4 Correct 42 ms 304 KB Output is correct
5 Execution timed out 1088 ms 204 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 31 ms 204 KB Output is correct
4 Correct 42 ms 304 KB Output is correct
5 Execution timed out 1088 ms 204 KB Time limit exceeded
6 Halted 0 ms 0 KB -