# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
909391 |
2024-01-17T07:44:32 Z |
shoryu386 |
Hacker (BOI15_hac) |
C++17 |
|
1 ms |
600 KB |
#include <bits/stdc++.h>
using namespace std;
#define MAX 200007
#define int long long
main(){
int n; cin >> n;
int count = (n+1)/2;
int arr[2*n];
for (int x = 0; x < n; x++) cin >> arr[x];
for (int x = 0; x < n; x++) arr[n + x] = arr[x];
int hmm[n]; memset(hmm, 63, sizeof(hmm));
int sums[n];
for (int x = 0; x < n; x++){
int sum = 0;
for (int y = x; y < x+count; y++){
sum += arr[y];
}
sums[x] = sum;
//hmm is min of all values from x-count+1 to x
for (int y = x; y < x+count; y++){
hmm[y % n] = min(hmm[y % n], sum);
}
}
multiset<int> ms;
for (int x = 0; x < count; x++){
ms.insert(sums[x]);
}
hmm[0] = *ms.begin();
for (int x = 1; x < n; x++){
ms.insert(sums[count+x-1]);
ms.erase(ms.find(sums[x-1]));
hmm[x] = *ms.begin();
}
int ans = INT_MIN;
for (int x = 0; x < n; x++){
ans = max(ans, hmm[x]);
}
cout << ans;
}
Compilation message
hac.cpp:5:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
5 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |