제출 #101163

#제출 시각아이디문제언어결과실행 시간메모리
101163autumn_eelSkyscraper (JOI16_skyscraper)C++14
15 / 100
296 ms90972 KiB
#include <bits/stdc++.h> #define rep(i,n)for(int i=0;i<(n);i++) #define MOD 1000000007 #define INF 0x3f3f3f3f using namespace std; typedef long long ll; typedef pair<int,int>P; int dp[1<<14][14][101]; int a[14]; int main(){ int n,L;cin>>n>>L; if(n>14)abort(); rep(i,n)scanf("%d",&a[i]); rep(i,n)dp[1<<i][i][0]=1; rep(i,1<<n)rep(j,n){ if(!(i>>j&1))continue; rep(k,L+1){ if(dp[i][j][k]==0)continue; rep(t,n){ if(i>>t&1)continue; if(abs(a[t]-a[j])+k<=L){ (dp[i|1<<t][t][abs(a[t]-a[j])+k]+=dp[i][j][k])%=MOD; } } } } int ans=0; rep(i,n)rep(j,L+1)(ans+=dp[(1<<n)-1][i][j])%=MOD; cout<<ans<<endl; }

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:15:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i,n)scanf("%d",&a[i]);
          ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...