Submission #4680908
Source Code Expand
#include <iostream> #define N_MAX 200000 using namespace std; typedef long long ll; ll x[N_MAX]; ll sum[N_MAX+1]; ll cost(int n){ if(n == 1) return 5; else return n*2+1; } int main(){ ll N, X; cin >> N >> X; ll ans = __LONG_LONG_MAX__; //if(N > 2000) return 0; sum[0] = 0; for(int i = 0; i < N ; i++){ cin >> x[i]; sum[i+1] = sum[i]+x[i]; } for(int i = 1; i <= N; i++){ int m, k; if(N%i == 0){ m = N/i; k = i; }else{ m = N/i+1; k = N%i; } ll tmp = X*i + X*N; tmp += (sum[k]-sum[0])*cost(m); if(m >= 2){ tmp += (sum[k+i]-sum[k])*cost(m-1); } for(int j = 2; j < m; j++){ tmp += (sum[k+j*i]-sum[k+(j-1)*i])*cost(m-j); } ans = min(ans, tmp); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Garbage Collector |
User | ytkn |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 953 Byte |
Status | WA |
Exec Time | 89 ms |
Memory | 3328 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | 0 / 300 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, stest_01.txt, stest_02.txt, stest_03.txt, stest_04.txt, stest_05.txt, stest_06.txt, stest_07.txt, stest_08.txt, stest_09.txt, stest_10.txt, stest_11.txt, stest_12.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, stest_01.txt, stest_02.txt, stest_03.txt, stest_04.txt, stest_05.txt, stest_06.txt, stest_07.txt, stest_08.txt, stest_09.txt, stest_10.txt, stest_11.txt, stest_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
stest_01.txt | AC | 2 ms | 256 KB |
stest_02.txt | AC | 2 ms | 256 KB |
stest_03.txt | AC | 1 ms | 256 KB |
stest_04.txt | AC | 1 ms | 256 KB |
stest_05.txt | AC | 2 ms | 256 KB |
stest_06.txt | AC | 1 ms | 256 KB |
stest_07.txt | AC | 2 ms | 256 KB |
stest_08.txt | AC | 2 ms | 256 KB |
stest_09.txt | AC | 1 ms | 256 KB |
stest_10.txt | AC | 2 ms | 256 KB |
stest_11.txt | AC | 2 ms | 256 KB |
stest_12.txt | AC | 1 ms | 256 KB |
test_13.txt | WA | 89 ms | 3328 KB |
test_14.txt | WA | 89 ms | 3328 KB |
test_15.txt | AC | 18 ms | 896 KB |
test_16.txt | AC | 68 ms | 3328 KB |
test_17.txt | AC | 68 ms | 3328 KB |
test_18.txt | AC | 10 ms | 768 KB |
test_19.txt | AC | 77 ms | 3328 KB |
test_20.txt | AC | 77 ms | 3328 KB |
test_21.txt | AC | 77 ms | 3328 KB |
test_22.txt | AC | 77 ms | 3328 KB |
test_23.txt | AC | 69 ms | 3328 KB |
test_24.txt | AC | 69 ms | 3328 KB |
test_25.txt | AC | 34 ms | 1920 KB |
test_26.txt | AC | 77 ms | 3328 KB |
test_27.txt | AC | 78 ms | 3328 KB |
test_28.txt | AC | 62 ms | 2816 KB |