제출 #95889

#제출 시각아이디문제언어결과실행 시간메모리
95889popovicirobertCalvinball championship (CEOI15_teams)C++14
10 / 100
264 ms504 KiB
#include <bits/stdc++.h> #define lsb(x) (x & (-x)) #define ll long long #define ull unsigned long long #define ld long double // 217 // 44 using namespace std; const int MOD = (int) 1e6 + 7; const int MAXN = 10005; inline void mod(int &x) { if(x >= MOD) x -= MOD; } int arr[MAXN + 1], mx[MAXN + 1]; int dp[2][MAXN + 1]; int main() { //ifstream cin("A.in"); //ofstream cout("A.out"); int i, j, n; ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n; for(i = 1; i <= n; i++) { cin >> arr[i]; mx[i] = max(mx[i - 1], arr[i]); } for(i = 1; i <= mx[n]; i++) { dp[n & 1][i] = 1; } int ans = arr[n] - 1; for(i = n - 1; i >= 1; i--) { int sum = 0; for(j = 1; j <= mx[n]; j++) { dp[i & 1][j] = (dp[1 - i & 1][j + 1] + sum + 1LL * dp[1 - i & 1][j] * j) % MOD; sum += dp[1 - i & 1][j]; mod(sum); } int cur = dp[1 - i & 1][mx[i - 1]] + dp[1 - i & 1][mx[i - 1] + 1]; ans = (ans + 1LL * cur * (arr[i] - 1)) % MOD; } cout << (ans + 1) % MOD; //cin.close(); //cout.close(); return 0; }

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

teams.cpp: In function 'int main()':
teams.cpp:40:34: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
             dp[i & 1][j] = (dp[1 - i & 1][j + 1] + sum + 1LL * dp[1 - i & 1][j] * j) % MOD;
                                ~~^~~
teams.cpp:40:69: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
             dp[i & 1][j] = (dp[1 - i & 1][j + 1] + sum + 1LL * dp[1 - i & 1][j] * j) % MOD;
                                                                   ~~^~~
teams.cpp:41:25: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
             sum += dp[1 - i & 1][j];
                       ~~^~~
teams.cpp:44:24: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
         int cur = dp[1 - i & 1][mx[i - 1]] + dp[1 - i & 1][mx[i - 1] + 1];
                      ~~^~~
teams.cpp:44:51: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
         int cur = dp[1 - i & 1][mx[i - 1]] + dp[1 - i & 1][mx[i - 1] + 1];
                                                 ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...