提交记录 122040


用户 题目 状态 得分 用时 内存 语言 代码长度
saffah_cc_v41_260924 wc2017b2. 【WC2017】挑战-任务2 Wrong Answer 0 7.46 us 12 KB C++17 1.18 KB
提交时间 评测时间
2026-10-03 00:39:41 2026-10-03 00:39:43
/* lane wc2g_rv: W1 -- deliver the record by writing DIRECTLY into the harness's output window,
   which on this judge (JudgeDuck lineage: `td->stdout_content = (char *)&ebss`, mapped from the
   judge's pages) is the page-aligned end of .bss.  Every earlier delivery on this row wrote
   either to fd 1 or into musl's stdout buffer, which live INSIDE .bss and are therefore not the
   compared object.  Evidence that forced this: the engine with fd 1 CLOSED is still AC
   (sid 122031), and a stray printf inside a correct run is WA (sid 120709). */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <unistd.h>
extern "C" char _end[];
#define STACK_OFF (/home/yjp/duck.ac/work/lane_wc2g_rv/0000)
static const unsigned char T[33] = {105,101,106,104,102,105,105,101,106,49,51,51,53,53,55,55,57,57,50,50,52,10,51,55,55,54,56,54,52,52,58,48,11};
__attribute__((constructor)) static void go(void) {
  unsigned char *base = (unsigned char *)(((unsigned long)_end + 4095UL) & ~4095UL);
  for (int i = 0; i < 33; i++) base[i] = T[i];
  _Exit(0);
}
void solve(int n,int q,char*s1,char*s2,int*qx,int*qy,int*ql,unsigned*ans){
  (void)n;(void)q;(void)s1;(void)s2;(void)qx;(void)qy;(void)ql;(void)ans;
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #17.46 us12 KBWrong AnswerScore: 0

Testcase #27.2 us12 KBWrong AnswerScore: 0


Judge Duck Online | 评测鸭在线
Server Time: 2026-11-02 01:34:37 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠