提交记录 14575


用户 题目 状态 得分 用时 内存 语言 代码长度
Phantom_Killer 1001. 测测你的排序 Compile Error 0 0 ns 0 KB C++ 3.22 KB
提交时间 评测时间
2020-10-19 19:22:18 2020-10-19 19:22:20
#include <cstdio>
#pragma G++ optimize(1)
#pragma G++ optimize(2)
#pragma G++ optimize(3)
#pragma G++ optimize("Ofast")
#pragma G++ optimize("inline")
#pragma G++ optimize("-fgcse")
#pragma G++ optimize("-fgcse-lm")
#pragma G++ optimize("-fipa-sra")
#pragma G++ optimize("-ftree-pre")
#pragma G++ optimize("-ftree-vrp")
#pragma G++ optimize("-fpeephole2")
#pragma G++ optimize("-ffast-math")
#pragma G++ optimize("-fsched-spec")
#pragma G++ optimize("unroll-loops")
#pragma G++ optimize("-falign-jumps")
#pragma G++ optimize("-falign-loops")
#pragma G++ optimize("-falign-labels")
#pragma G++ optimize("-fdevirtualize")
#pragma G++ optimize("-fcaller-saves")
#pragma G++ optimize("-fcrossjumping")
#pragma G++ optimize("-fthread-jumps")
#pragma G++ optimize("-funroll-loops")
#pragma G++ optimize("-fwhole-program")
#pragma G++ optimize("-freorder-blocks")
#pragma G++ optimize("-fschedule-insns")
#pragma G++ optimize("inline-functions")
#pragma G++ optimize("-ftree-tail-merge")
#pragma G++ optimize("-fschedule-insns2")
#pragma G++ optimize("-fstrict-aliasing")
#pragma G++ optimize("-fstrict-overflow")
#pragma G++ optimize("-falign-functions")
#pragma G++ optimize("-fcse-skip-blocks")
#pragma G++ optimize("-fcse-follow-jumps")
#pragma G++ optimize("-fsched-interblock")
#pragma G++ optimize("-fpartial-inlining")
#pragma G++ optimize("no-stack-protector")
#pragma G++ optimize("-freorder-functions")
#pragma G++ optimize("-findirect-inlining")
#pragma G++ optimize("-frerun-cse-after-loop")
#pragma G++ optimize("inline-small-functions")
#pragma G++ optimize("-finline-small-functions")
#pragma G++ optimize("-ftree-switch-conversion")
#pragma G++ optimize("-foptimize-sibling-calls")
#pragma G++ optimize("-fexpensive-optimizations")
#pragma G++ optimize("-funsafe-loop-optimizations")
#pragma G++ optimize("inline-functions-called-once")
#pragma G++ optimize("-fdelete-null-pointer-checks")
static char buf[100000], *p1 = buf, *p2 = buf;
#define gc p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1++;
inline int read() {
  register int x = 0;
  register char a = gc;
  while (a < '0' || a > '9') a = gc;
  while (a >= '0' && a <= '9') x = (x << 1) + (x << 3) + (a ^ 48), a = gc;
  return x;
}
char pbuf[10000000], *pp = pbuf;
inline void write(int x) {
  static int sta[35];
  register int top = 0;
  if (!x) sta[++top] = 0;
  while (x) sta[++top] = x % 10, x /= 10;
  while (top) *pp++ = sta[top--] ^ '0';
}
unsigned int n = read(), a[205001], b[205001];
#define run register unsigned int
main() {
  run i, *j, *lim, bac1[301] = {0}, bac2[301] = {0}, bac3[301] = {0}, bac4[301] = {0}, tmp;
  for (i = 1; i <= n; ++i) a[i] = read();
  for (j = a + 1, lim = a + n + 1; j != lim; ++j) ++bac1[(tmp = (*j)) & 255], ++bac2[(tmp >> 8) & 255], ++bac3[(tmp >> 16) & 255], ++bac4[tmp >> 24];
  for (i = 1; i <= 255; ++i) bac1[i] += bac1[i - 1], bac2[i] += bac2[i - 1], bac3[i] += bac3[i - 1], bac4[i] += bac4[i - 1];
  for (j = a + n; j != a; --j) b[bac1[(*j) & 255]--] = *j;
  for (j = b + n; j != b; --j) a[bac2[((*j) >> 8) & 255]--] = *j;
  for (j = a + n; j != a; --j) b[bac3[((*j) >> 16) & 255]--] = *j;
  for (j = b + n; j != b; --j) a[bac4[(*j) >> 24]--] = *j;
  for (i = 1; i <= n; ++i) write(a[i]), *pp++ = ' ';
  fwrite(pbuf, 1, pp - pbuf, stdout);
}

CompilationN/AN/ACompile ErrorScore: N/A


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-22 06:33:42 | Loaded in 0 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠