QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#798418	#9790. Make Swamp Great Again	ZhaoZiLong	Compile Error	/	/	C++20	1.1kb	2024-12-04 13:33:42	2024-12-04 13:33:43
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息

answer.code:10:1: error: stray ‘\240’ in program
   10 | <a0> <a0> return max(max(a, b), c);
      | ^~~~
answer.code:10:3: error: stray ‘\240’ in program
   10 | <a0> <a0> return max(max(a, b), c);
      |      ^~~~
answer.code:14:1: error: stray ‘\240’ in program
   14 | <a0> <a0> return min(min(a, b), c);
      | ^~~~
answer.code:14:3: error: stray ‘\240’ in program
   14 | <a0> <a0> return min(min(a, b), c);
      |      ^~~~
answer.code:18:1: error: stray ‘\240’ in program
   18 | <a0> <a0> for(int i = 0;i < n;i++) pos[t[i]].push_back(i);
      | ^~~~
answer.code:18:3: error: stray ‘\240’ in program
   18 | <a0> <a0> for(int i = 0;i < n;i++) pos[t[i]].push_back(i);
      |      ^~~~
answer.code:19:1: error: stray ‘\240’ in program
   19 | <a0> <a0> for(int i = 1;i <= 100000;i++){
      | ^~~~
answer.code:19:3: error: stray ‘\240’ in program
   19 | <a0> <a0> for(int i = 1;i <= 100000;i++){
      |      ^~~~
answer.code:20:1: error: stray ‘\240’ in program
   20 | <a0> <a0> <a0> <a0> bool flag = false;
      | ^~~~
answer.code:20:3: error: stray ‘\240’ in program
   20 | <a0> <a0> <a0> <a0> bool flag = false;
      |      ^~~~
answer.code:20:5: error: stray ‘\240’ in program
   20 | <a0> <a0> <a0> <a0> bool flag = false;
      |           ^~~~
answer.code:20:7: error: stray ‘\240’ in program
   20 | <a0> <a0> <a0> <a0> bool flag = false;
      |                ^~~~
answer.code:21:1: error: stray ‘\240’ in program
   21 | <a0> <a0> <a0> <a0> for(int p : pos[i]){
      | ^~~~
answer.code:21:3: error: stray ‘\240’ in program
   21 | <a0> <a0> <a0> <a0> for(int p : pos[i]){
      |      ^~~~
answer.code:21:5: error: stray ‘\240’ in program
   21 | <a0> <a0> <a0> <a0> for(int p : pos[i]){
      |           ^~~~
answer.code:21:7: error: stray ‘\240’ in program
   21 | <a0> <a0> <a0> <a0> for(int p : pos[i]){
      |                ^~~~
answer.code:22:1: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      | ^~~~
answer.code:22:3: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      |      ^~~~
answer.code:22:5: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      |           ^~~~
answer.code:22:7: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      |                ^~~~
answer.code:22:9: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      |                     ^~~~
answer.code:22:11: error: stray ‘\240’ in program
   22 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n]) || t[p] == min3(t[(p - 1 + n) % n], t[p], t[(p + 1) % n])) flag = true;
      |                          ^~~~
answer.code:23:1: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      | ^~~~
answer.code:23:3: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      |      ^~~~
answer.code:23:5: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      |           ^~~~
answer.code:23:7: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      |                ^~~~
answer.code:23:9: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      |                     ^~~~
answer.code:23:11: error: stray ‘\240’ in program
   23 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p]) || t[p] == min3(t[(p - 2 + n) % n], t[(p - 1 + n) % n], t[p])) flag = true;
      |                          ^~~~
answer.code:24:1: error: stray ‘\240’ in program
   24 | <a0> <a0> <a0> <a0> <a0> <a0> if(t[p] == max3(t[p], t[(p + 1) % n], t[(p + 2) % n]) || t[p] == min3(t[p], t[(p + 1) %...