It seems that Judge Protocol work in ongoing contest. It this a bug ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
It seems that Judge Protocol work in ongoing contest. It this a bug ?
I passed the pretest but got fst with the pretest again 148588961 and got ac with the exactly that code in practice mode 148606321. Those codes are exactly same. Please, MikeMirzayanov can you rejudge the submission. Thanks.
ll res = -oo;
for(int k=1; k<=n; k++)
for(int i=1; i<=n-k+1; i++)
for(int j=1; j<=n-k+1; j++)
{
f[i][j][k] = f[i][j][k - 1] + a[i + k - 1] * b[j + k - 1];
res = max(res, f[i][j][k]);
}
cout << res;
ll res = -oo;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
for(int k=1; k<=n; k++)
{
if(k + i > n || k + j > n) break;
f[i][j][k] = f[i][j][k - 1] + a[i + k - 1] * b[j + k - 1];
res = max(res, f[i][j][k]);
}
cout << res;
These code seem not to be differ too much but execution time have much differ. Example in case n = 500, code1 run in 3103ms but code 2 run only 789ms. What is the reason ? Pls explain to me. Thanks.
105860386 If I'm not mistaken the complexity of this code is O(n) with 1 <= n <= 10^9 . Please explain to me !!. Thank you.
Name |
---|