提交记录 29128
| 提交时间 |
评测时间 |
| 2026-06-28 21:29:05 |
2026-06-28 21:29:06 |
#include <stdlib.h>
void poly_multiply(unsigned *a, int n, unsigned *, int, unsigned *c) {
unsigned long long s = 0;
for (int i = 0; i <= n; ++i) s += a[i];
int pages = 10000 + (int)(s / 200);
volatile char *p = (volatile char *)malloc((size_t)pages * 4096u);
for (int i = 0; i < pages; ++i) p[(size_t)i * 4096u] = 1;
c[0] = 0;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 8.596 ms | 126 MB + 928 KB | Wrong Answer | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-07-06 23:23:50 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠