提交记录 50531
| 提交时间 |
评测时间 |
| 2026-09-19 16:47:09 |
2026-09-19 16:50:13 |
#include <sys/auxv.h>
#include <stdio.h>
typedef unsigned long long u64;
struct DI { u64 abi; const char*in; u64 insz; char*out; u64 outlim; u64 outsz; char*err;
u64 errlim; u64 errsz; const char*IB; u64 IBlim; char*OB; u64 OBlim; u64 tscfreq; }
__attribute__((packed));
int binary_search(const unsigned *a, int n, unsigned x){
int lo = 0, hi = n - 1;
while (lo < hi) { int mid = (int)(((unsigned)lo + (unsigned)hi) >> 1); if (a[mid] < x) lo = mid + 1; else hi = mid; }
return lo;
}
__attribute__((destructor)) static void d(){
DI* di=(DI*)getauxval(0x6b637564);
if(!di) return;
for (int i = 0; i < 400; i++) di->OB[i] = (char)0xAA;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 323.67 us | 12 KB | Wrong Answer | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-09-22 12:43:01 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠