제출 #1086343

#제출 시각아이디문제언어결과실행 시간메모리
1086343RaidenSkyscraper (JOI16_skyscraper)C++14
컴파일 에러
0 ms0 KiB
#include<bits/stdc++.h> using namespace std;const int MOD = 1e9 + 7;const int MAX = 105;int dp[3][MAX][MAX][MAX * 10], n;int arr[MAX];int f(int alive_ends, int i,int components, int sm){ if(alive_ends < 0) return 0; if(sm < 0) return 0; if(i == n) return alive_ends == 0 && components == 1; int &ret = dp[alive_ends][i][components][sm]; if(~ret) return ret; ret = 0; sm -= (2 * components - 2 + alive_ends) * (arr[i] - arr[i - 1]); ret = (ret + 1LL * (2 * components - 2 + alive_ends) * f(alive_ends, i + 1, components, sm)) % MOD; if(components) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components, sm)) % MOD; ret = (ret + 1LL * (components - 1 + alive_ends) * f(alive_ends, i + 1, components + 1, sm)) % MOD; if(alive_ends) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components + 1, sm)) % MOD; if(components) ret = (ret + 1LL * (components - 1) * f(alive_ends, i + 1, components - 1, sm)) % MOD; return ret;}void solve(){ int k; cin >> n >> k; memset(dp, -1, sizeof dp); for(int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); if(n == 1){ cout << 1 << '\n'; return ; } cout << (f(2, 0, 0, k)) % MOD << '\n'; } int32_t main(){ ios_base::sync_with_stdio(0), cin.tie(0); int t = 1; // cin >> t; while(t--) solve();}

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

skyscraper.cpp: In function 'int32_t main()':
skyscraper.cpp:2:1191: warning: unused variable 't' [-Wunused-variable]
    2 | using namespace std;const int MOD = 1e9 + 7;const int MAX = 105;int dp[3][MAX][MAX][MAX * 10], n;int arr[MAX];int f(int alive_ends, int i,int components, int sm){ if(alive_ends < 0) return 0; if(sm < 0) return 0; if(i == n) return alive_ends == 0 && components == 1; int &ret = dp[alive_ends][i][components][sm]; if(~ret) return ret; ret = 0; sm -= (2 * components - 2 + alive_ends) * (arr[i] - arr[i - 1]); ret = (ret + 1LL * (2 * components - 2 + alive_ends) * f(alive_ends, i + 1, components, sm)) % MOD; if(components) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components, sm)) % MOD; ret = (ret + 1LL * (components - 1 + alive_ends) * f(alive_ends, i + 1, components + 1, sm)) % MOD; if(alive_ends) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components + 1, sm)) % MOD; if(components) ret = (ret + 1LL * (components - 1) * f(alive_ends, i + 1, components - 1, sm)) % MOD; return ret;}void solve(){ int k; cin >> n >> k; memset(dp, -1, sizeof dp); for(int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); if(n == 1){  cout << 1 << '\n';  return ; } cout << (f(2, 0, 0, k)) % MOD << '\n'; } int32_t main(){ ios_base::sync_with_stdio(0), cin.tie(0); int t = 1; // cin >> t; while(t--) solve();}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       ^
skyscraper.cpp:2:1196: error: expected '}' at end of input
    2 | using namespace std;const int MOD = 1e9 + 7;const int MAX = 105;int dp[3][MAX][MAX][MAX * 10], n;int arr[MAX];int f(int alive_ends, int i,int components, int sm){ if(alive_ends < 0) return 0; if(sm < 0) return 0; if(i == n) return alive_ends == 0 && components == 1; int &ret = dp[alive_ends][i][components][sm]; if(~ret) return ret; ret = 0; sm -= (2 * components - 2 + alive_ends) * (arr[i] - arr[i - 1]); ret = (ret + 1LL * (2 * components - 2 + alive_ends) * f(alive_ends, i + 1, components, sm)) % MOD; if(components) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components, sm)) % MOD; ret = (ret + 1LL * (components - 1 + alive_ends) * f(alive_ends, i + 1, components + 1, sm)) % MOD; if(alive_ends) ret = (ret + 1LL * alive_ends * f(alive_ends - 1, i + 1, components + 1, sm)) % MOD; if(components) ret = (ret + 1LL * (components - 1) * f(alive_ends, i + 1, components - 1, sm)) % MOD; return ret;}void solve(){ int k; cin >> n >> k; memset(dp, -1, sizeof dp); for(int i = 0; i < n; i++) cin >> arr[i]; sort(arr, arr + n); if(n == 1){  cout << 1 << '\n';  return ; } cout << (f(2, 0, 0, k)) % MOD << '\n'; } int32_t main(){ ios_base::sync_with_stdio(0), cin.tie(0); int t = 1; // cin >> t; while(t--) solve();}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       ~                                                    ^