提出 #72041104
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 5;
#define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
long long n, ans;
long long a[N], b[N], c[N];
pair<ll, ll> t[N];
int main(){
cin >> n;
rep(i, 1, n, 1){
cin >> a[i];
a[i] += a[i - 1];
}
rep(i, 1, n, 1){
cin >> b[i];
b[i] += b[i - 1];
}
rep(i, 1, n, 1){
cin >> c[i];
c[i] += c[i - 1];
}
rep(i, 2, n - 1, 1){
t[i - 1] = {b[i] + c[n] - c[i], i};
}
sort(t + 1, t + n - 1);
int j = n - 2;
rep(i, 1, n - 2, 1){
while(t[j].second <= i)j--;
ans = max(ans, t[j].first - b[i] + a[i]);
}
cout << ans;
return 0;
}
提出情報
コンパイルエラー
./Main.cpp: In function 'int main()':
./Main.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:11:9: note: in expansion of macro 'rep'
11 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: note: remove parentheses
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:11:9: note: in expansion of macro 'rep'
11 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:15:9: note: in expansion of macro 'rep'
15 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: note: remove parentheses
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:15:9: note: in expansion of macro 'rep'
15 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:19:9: note: in expansion of macro 'rep'
19 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: note: remove parentheses
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:19:9: note: in expansion of macro 'rep'
19 | rep(i, 1, n, 1){
| ^~~
./Main.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:23:9: note: in expansion of macro 'rep'
23 | rep(i, 2, n - 1, 1){
| ^~~
./Main.cpp:5:29: note: remove parentheses
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:23:9: note: in expansion of macro 'rep'
23 | rep(i, 2, n - 1, 1){
| ^~~
./Main.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:28:9: note: in expansion of macro 'rep'
28 | rep(i, 1, n - 2, 1){
| ^~~
./Main.cpp:5:29: note: remove parentheses
5 | #define rep(i,j,k,w) for(ll (i) = (j); ((w) > 0) ? ((i) <= (k)) : ((i) >= (k)); (i) += (w))
| ^~~
./Main.cpp:28:9: note: in expansion of macro 'rep'
28 | rep(i, 1, n - 2, 1){
| ^~~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
400 / 400 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
sample00.txt, sample01.txt, sample02.txt |
| All |
sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| sample00.txt |
AC |
3 ms |
3376 KiB |
| sample01.txt |
AC |
1 ms |
3620 KiB |
| sample02.txt |
AC |
1 ms |
3392 KiB |
| testcase00.txt |
AC |
1 ms |
3396 KiB |
| testcase01.txt |
AC |
1 ms |
3404 KiB |
| testcase02.txt |
AC |
1 ms |
3428 KiB |
| testcase03.txt |
AC |
142 ms |
15312 KiB |
| testcase04.txt |
AC |
142 ms |
15256 KiB |
| testcase05.txt |
AC |
141 ms |
15168 KiB |
| testcase06.txt |
AC |
141 ms |
15376 KiB |
| testcase07.txt |
AC |
140 ms |
15116 KiB |
| testcase08.txt |
AC |
141 ms |
15120 KiB |
| testcase09.txt |
AC |
172 ms |
15064 KiB |
| testcase10.txt |
AC |
159 ms |
15156 KiB |
| testcase11.txt |
AC |
161 ms |
15400 KiB |
| testcase12.txt |
AC |
155 ms |
15164 KiB |
| testcase13.txt |
AC |
141 ms |
15164 KiB |
| testcase14.txt |
AC |
140 ms |
15064 KiB |
| testcase15.txt |
AC |
116 ms |
15064 KiB |
| testcase16.txt |
AC |
115 ms |
15168 KiB |
| testcase17.txt |
AC |
62 ms |
7188 KiB |
| testcase18.txt |
AC |
169 ms |
13844 KiB |
| testcase19.txt |
AC |
192 ms |
15400 KiB |
| testcase20.txt |
AC |
134 ms |
11816 KiB |
| testcase21.txt |
AC |
112 ms |
10304 KiB |
| testcase22.txt |
AC |
192 ms |
15400 KiB |
| testcase23.txt |
AC |
28 ms |
5172 KiB |
| testcase24.txt |
AC |
140 ms |
12040 KiB |
| testcase25.txt |
AC |
191 ms |
15068 KiB |
| testcase26.txt |
AC |
107 ms |
11792 KiB |
| testcase27.txt |
AC |
135 ms |
14032 KiB |
| testcase28.txt |
AC |
149 ms |
15120 KiB |
| testcase29.txt |
AC |
100 ms |
11228 KiB |
| testcase30.txt |
AC |
105 ms |
11708 KiB |
| testcase31.txt |
AC |
149 ms |
15256 KiB |
| testcase32.txt |
AC |
142 ms |
14568 KiB |
| testcase33.txt |
AC |
122 ms |
13136 KiB |
| testcase34.txt |
AC |
150 ms |
15156 KiB |