代码

#define STAT 2
/* wc2017b2 data-shape probe via the memory side channel.
   STAT 0: n/100  1: q/100  2: sum(l)/1e7  3: max(l)/100  4: avg(l)/100  5: #distinct l */
static char pad[32 << 20];
static inline void dumpv(unsigned long long v) {
    if (v > 15000) v = 15000;
    volatile char *p = pad;
    for (unsigned long long i = 0; i < v; i++) p[i * 4096] = 1;
}
#ifndef STAT
#define STAT 0
#endif
void solve(int n, int q, char *s1, char *s2, int *q_x, int *q_y, int *q_len, unsigned *ans) {
    (void)s1; (void)s2; (void)q_x; (void)q_y;
    unsigned long long v = 0;
#if STAT == 0
    v = (unsigned long long)n / 100;
#elif STAT == 1
    v = (unsigned long long)q / 100;
#elif STAT == 2
    { unsigned long long s = 0; for (int i = 0; i < q; i++) s += (unsigned)q_len[i]; v = s / 10000000ULL; }
#elif STAT == 3
    { int mx = 0; for (int i = 0; i < q; i++) if (q_len[i] > mx) mx = q_len[i]; v = (unsigned long long)mx / 100; }
#elif STAT == 4
    { unsigned long long s = 0; for (int i = 0; i < q; i++) s += (unsigned)q_len[i]; v = q ? (s / (unsigned long long)q) / 100 : 0; }
#elif STAT == 5
    { int c = 0; for (int i = 0; i < q; i++) if (q_len[i] == 1) c++; v = (unsigned long long)c / 100; }
#endif
    dumpv(1000 + v);
    for (int i = 0; i < q; i++) ans[i] = 0;
}

//wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww

评测结果