답안 #224911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224911 2020-04-19T05:22:37 Z Nightlight Bali Sculptures (APIO15_sculpture) C++14
0 / 100
5 ms 384 KB
#include <bits/stdc++.h>
using namespace std;

int N, A, B;
long long pre[2005];
bool dp[2005][2005];
long long mask;
bitset<2005> valid[2005];

long long ans = (1LL << 42) - 1;

bool check(long long T) {
  return ((T | mask) ^ mask) == 0;
}

bool can(int X) {
  for(int i = 1; i < N; i++) {
    for(int j = i + 1; j <= N; j++) {
      valid[i][j] = check(pre[j] - pre[i]);
    }
  }
  //i adalah jumlah ambil
  //j lokasi sekarang
  bitset<2005> now[2];
  for(int j = 1; j <= N; j++) {
    if(check(pre[j])) {
      now[1] |= valid[j];
    }
  }
  int skrg, sblm;
  for(int i = 2; i <= B; i++) {
    skrg = i & 1, sblm = !skrg;
    now[skrg] = 0;
    for(int j = i; j <= N; j++) {
      if(now[sblm][j]) {
        now[skrg] |= valid[j];
      }
    }
    if(i >= A && now[sblm][N]) return 1;  
  }
  return 0;
}
/*
bool can(long long X) {
  memset(dp, 0, sizeof(dp));
  for(int i = 1; i <= N; i++) {
    dp[1][i] = check(pre[i]);
  }
  if(A == 1 && dp[1][N]) return 1;
  for(int i = 2; i <= B; i++) {
    for(int j = i; j <= N; j++) {
      for(int k = i - 1; k < j; k++) {
        if(check(pre[j] - pre[k])) {
          dp[i][j] = dp[i - 1][k];
          break;
        }
      }
    }
    if(i >= A && dp[i][N]) return 1;
  }
  return 0;
}*/

int main() {
//  freopen("inp", "r", stdin);
  scanf("%d %d %d", &N, &A, &B);
  for(int i = 1; i <= N; i++) {
    scanf("%lld", &pre[i]);
    pre[i] += pre[i - 1];
  }
  for(int i = 41; i >= 0; i--) {
    mask = ans - (1LL << i);
    if(can(i)) {
      ans -= (1LL << i);
    }
  }
  printf("%lld\n", ans);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &N, &A, &B);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &pre[i]);
     ~~~~~^~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -