# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
21957 | 2017-04-27T19:37:19 Z | mohammad_kilani | Bali Sculptures (APIO15_sculpture) | C++14 | 0 ms | 3236 KB |
#include<bits/stdc++.h> using namespace std; const int N = 111; int n , a , b , arr[N]; bool dp[N][N][50]; bool vis[N][N][50]; bool cantake[N][N]; vector<pair<int,int > > v; void printbinary(long long num){ for(int i=32;i>=0;i--){ cout << ((num>>i)&1); } cout << endl; } bool solve(int i,int j,int bit){ if(!cantake[i][j]) return false; if(j > b) return false; if(i == n){ if(j >= a) return true; return false; } if(vis[i][j][bit] == true) return dp[i][j][bit]; vis[i][j][bit] = true; long long sum = 0 ; bool can = false; for(int k = i;k<n;k++){ sum += (long long)arr[k]; long long num = (sum >> (long long)bit); if((num&1) == 1){ v.push_back(make_pair(k+1,j+1)); continue; } if(solve(k+1,j+1,bit) == true) can = true; else v.push_back(make_pair(k+1,j+1)); } if(can == false){ v.push_back(make_pair(i,j)); } return dp[i][j][bit] = can; } int main(){ //freopen("in.txt","r",stdin); memset(dp,-1,sizeof(dp)); memset(cantake,1,sizeof(cantake)); scanf("%d%d%d",&n,&a,&b); for(int i=0;i<n;i++){ scanf("%d",&arr[i]); } long long ans = 0 ; for(int i=46;i>=0;i--){ v.clear(); if(!solve(0,0,i)){ ans += ((long long)1 << (long long)i); } else{ for(int j=0;j<(int)v.size();j++){ cantake[v[j].first][v[j].second] = false; } } } cout << ans << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3236 KB | Output is correct |
2 | Incorrect | 0 ms | 3236 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3236 KB | Output is correct |
2 | Incorrect | 0 ms | 3236 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3236 KB | Output is correct |
2 | Incorrect | 0 ms | 3236 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3236 KB | Output is correct |
2 | Incorrect | 0 ms | 3236 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3236 KB | Output is correct |
2 | Incorrect | 0 ms | 3236 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |