oj.uz

답안 #711539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711539 2023-03-17T07:59:46 Z Pety Calvinball championship (CEOI15_teams) C++14
100 / 100
 563 ms 548 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,avx,mmx,popcnt,tune=native")

using namespace std;

const int mod = 1e6 + 7;

int n,  dp[2][10002][2], p[10002];

void add (int &a, int b) {
  a += b;
  if (a >= mod)
    a-= mod;
}

int main () 
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> p[i];
  dp[0][0][1] = 1;
  for (int i = 0; i < n; i++) {
    int k = (i & 1);
    for (int j = 0; j <= n; j++)
      dp[k ^ 1][j][0] = dp[k ^ 1][j][1] = 0;
    for (int j = 0; j <= i; j++) {
      ///1 lmao
      if (j > 0)
        add(dp[k ^ 1][j][1], dp[k][j][1] * (p[i + 1] <= j));
      if (j < n)
        add(dp[k ^ 1][j + 1][1], dp[k][j][1] * (j + 1 == p[i + 1]));
      ///0 lmao
      if (j > 0) {
        add(dp[k ^ 1][j][0], 1ll * dp[k][j][1] * min(j, p[i + 1] - 1) % mod);
        add(dp[k ^ 1][j][0], 1ll * dp[k][j][0] * j % mod);
      }
      if (j < n) {
        add(dp[k ^ 1][j + 1][0], dp[k][j][1] * (j + 1 < p[i + 1]));
        add(dp[k ^ 1][j + 1][0], dp[k][j][0]);
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    add(ans, dp[n & 1][i][0]);
    add(ans, dp[n & 1][i][1]);
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 538 ms 496 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 460 KB Output is correct
2 Correct 147 ms 408 KB Output is correct
3 Correct 136 ms 412 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 554 ms 500 KB Output is correct
2 Correct 563 ms 536 KB Output is correct
3 Correct 545 ms 548 KB Output is correct