제출 #69671

#제출 시각아이디문제언어결과실행 시간메모리
696713zpHomecoming (BOI18_homecoming)C++14
0 / 100
40 ms8352 KiB
#include<bits/stdc++.h> #include "homecoming.h" using namespace std; long long sa[60009], sb[60009]; long long su (long long l, long long r){ if(!l) return -sb[r]+sa[r]; return -sb[r] + sa[r] + sb[l-1] - sa[l-1]; } long long Sb(long long l, long long r){ if(!l) return sb[r]; else return sb[r] - sb[l-1]; } long long M[5009][22]; long long dp[40009][2]; long long int solve(int N, int K, int *A, int *B){ for(long long i = 0; i < 2*N; i++) A[i+N] = A[i], B[i+N] = B[i]; sa[0] = A[0]; sb[0] = B[0]; for(long long i = 1; i < 3*N; i++) sa[i] = sa[i-1] + A[i], sb[i] = sb[i-1] + B[i]; for(int i = 0 ;i < 2*N; i++) M[i][0] = su(i,i); /* for(long long i = 1; (1 << i) < 2*N; i++){ for(long long j = 0; j + (1<<i) - 1 < 2*N; j++){ long long m1 = M[j][i-1]; long long m2 = M[j+(1<<(i-1))][i-1]; M[j][i] = max(m2, m1 + su(j+(1<<i-1), j+(1<<i) - 1)); } } /*long long masof = 1e9, FI = -1; for(long long i = N; i < 2*N; i++){ long long S = A[i] - sb[i+K-1] + sb[i-1]; long long x = i, ss = 0; for(long long L = 21; L >= 0; L--){ if(x - (1<<L) < 0) continue; //cout << ss <<" "<< x- (1<<L) <<" "<<L<<" "<<M[x-(1<<L)][L]<<" "<<S<<endl; if(M[x - (1<<L)][L] + ss + S >= 0) continue; ss += su(x - (1 << L), x -1); x = x - (1 << L); } int l; if(S >= 0) l = i; else l = x - 1; if(l <= i - N) l = -1; if(l != -1 && masof > i - l) { FI = i; masof = i - l; } // cout << i <<" "<<l << " "<<S<<" "<<A[i]<<" "<<sb[i+K-1]<<" "<<sb[i-1]<<endl; } if(FI == -1) return 0; FI -= N; /*dp[FI][0] = -1e18; dp[FI][1] = A[FI] - Sb(FI, FI+K-1); for(long long i = FI + 1; i < FI + N - K; i++){ dp[i][0] = dp[i-1][0] + dp[i-1][1]; dp[i][1] = dp[i-1][1] + A[i] - B[i + K - 1]; if(i - K >= FI) dp[i][1] =max(dp[i][1], dp[i - K][0] + dp[i - K][1] + A[i] - Sb(i, i+K-1)); } long long ans = max(dp[FI + N - K - 1][0], dp[FI+ N - K - 1][1]); long long s = 0; for(long long i = FI - 1; i > FI - N + K; i --){ s += A[i+N] - B[i+N]; ans =max(ans, s + max(dp[i + N - K - 1][0], dp[i + N - K - 1][1])); } return max(max((long long)0,ans), sa[N-1]-sb[N-1]);*/ return 0; } /*long long a[100009], b[100009]; main(){ long long n, K; cin >> n >> K; for(long long i= 0 ; i < n; i++) cin >> a[i]; for(long long i = 0; i < n; i++){ cin >> b[i]; } cout << solve(n, K, a, b) << endl; } */

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

homecoming.cpp:34:5: warning: "/*" within comment [-Wcomment]
     /*long long masof = 1e9, FI = -1;
      
homecoming.cpp:57:5: warning: "/*" within comment [-Wcomment]
     /*dp[FI][0] = -1e18;
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...