oj.uz

답안 #699017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699017 2023-02-15T10:31:51 Z dattranxxx Fibonacci representations (CEOI18_fib) C++11
5 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
int a[N];
int n;

multiset<int> s;
void fix(int x) {
  int c = s.count(x);
  if (c == 1) {
    if (s.count(x - 1)) {
      s.erase(x - 1);
      s.erase(x);
      s.insert(x + 1);
      fix(x + 1);
      return;
    }

    if (s.count(x + 1)) {
      s.erase(x + 1);
      s.erase(x);
      s.insert(x + 2);
      fix(x + 2);
    }

    return;

  }
  // c == 2
  if (x == 1) {
    s.erase(x);
    s.insert(x + 1);
    fix(x + 1);
    return;
  }

  if (s.count(x + 1)) {
    s.erase(s.find(x));
    s.erase(x + 1);
    s.insert(x + 2);
    fix(x + 2);
    return;
  }

  if (s.count(x - 1)) {
    s.erase(s.find(x));
    s.erase(x - 1);
    s.insert(x + 1);
    fix(x + 1);
    return;
  }

  if (x == 2) {
    s.erase(x);
    s.insert(x - 1);
    s.insert(x + 1);
    fix(x - 1);
    fix(x + 1);
  } else {
    s.erase(x);
    s.insert(x - 2);
    s.insert(x + 1);
    fix(x - 2);
    fix(x + 1);
  }

}

int b[N], dp[N][2];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  // freopen("in", "r", stdin);

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

  for (int i = 1; i <= n; ++i) {
    s.insert(a[i]);
    fix(a[i]);

    int m = 0;
    for (int x : s) b[++m] = x;


//    for (int i = 1; i <= m; ++i) {
//      cerr << b[i] << " \n"[i == m];
//    }


    dp[1][0] = 1;
    dp[1][1] = (b[1] - 1) / 2;
    for (int i = 2; i <= m; ++i) {
      int len = b[i] - b[i - 1];
      if (len & 1) {
        dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]);
        dp[i][1] = (dp[i - 1][0] + dp[i - 1][1]) * (len / 2);
      } else {
        dp[i][0] = dp[i - 1][0] + dp[i - 1][1];
        dp[i][1] = dp[i - 1][0] * (len / 2 - 1) + dp[i - 1][1] * (len / 2);
      }
    }
    cout << (dp[m][0] + dp[m][1]) << '\n';

  }

  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 284 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 284 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 284 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -