{
 "generatedAt": "2026-09-12T10:49:40.512Z",
 "baseUrl": "https://oj.qonnwolf.com",
 "course": {
  "id": "6a826183bdde81887a2237b5",
  "title": "2026 秋季班 CSP04"
 },
 "group": "橙子周六1400CSP04",
 "section": {
  "id": "6a826183bdde81887a2237ba",
  "no": "02",
  "name": "简单排序",
  "title": "02 简单排序"
 },
 "progress": [
  {
   "title": "01 基础回顾",
   "submitted": 5,
   "started": 5,
   "students": 5
  },
  {
   "title": "02 简单排序",
   "submitted": 2,
   "started": 2,
   "students": 5
  },
  {
   "title": "03 二维数组",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "04 二维数组图形",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "05 二维数组综合",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "06 综合训练1",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "07 自定义函数进阶",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "08 sort基础",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "09 sort进阶",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "10 结构体基础",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "11 结构体进阶",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "12 综合训练2",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "13 递推算法 ",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "14 指针基础",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "15 指针进阶",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "16 文件操作与异常处理",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "17 综合训练3",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "18 真题实战1",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "19 真题实战2",
   "submitted": 0,
   "started": 0,
   "students": 5
  },
  {
   "title": "20 期末考试",
   "submitted": 0,
   "started": 0,
   "students": 5
  }
 ],
 "classSummary": {
  "studentCount": 5,
  "startedStudentCount": 2,
  "submittedStudentCount": 2,
  "completedStudentCount": 0,
  "attentionStudentCount": 5,
  "notStartedStudentCount": 3,
  "recoveredStudentCount": 1,
  "completionRate": 5.88,
  "firstAttemptScoreRate": 70,
  "finalScoreRate": 5.88,
  "averageAttemptsPerStudent": 1.6,
  "averageFirstAttemptDurationMs": 1649862
 },
 "perProblem": [
  {
   "name": "📝 课堂练习",
   "title": "CSP04-02A",
   "problems": [
    {
     "pid": 4262,
     "title": "冒泡排序实现",
     "submitted": 2,
     "accepted": 2,
     "firstAttemptScoreRate": 55,
     "averageAttempts": 2
    },
    {
     "pid": 4263,
     "title": "选择排序实现",
     "submitted": 2,
     "accepted": 2,
     "firstAttemptScoreRate": 100,
     "averageAttempts": 1
    },
    {
     "pid": 4264,
     "title": "计算排序后的交换次数",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4265,
     "title": "求第 K 小的数",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4266,
     "title": "成绩排名（稳定排序）",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 6602,
     "title": "简单排序 - 选择题",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 6603,
     "title": "简单排序 - 判断题",
     "submitted": 1,
     "accepted": 1,
     "firstAttemptScoreRate": 40,
     "averageAttempts": 2
    }
   ]
  },
  {
   "name": "📋 课后作业",
   "title": "CSP04-02B",
   "problems": [
    {
     "pid": 4267,
     "title": "数字排序（作业）",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4268,
     "title": "找中位数",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4269,
     "title": "判断排序方向",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    }
   ]
  },
  {
   "name": "🚀 拓展练习",
   "title": "CSP04-02C",
   "problems": [
    {
     "pid": 4270,
     "title": "计算逆序对数量",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4271,
     "title": "鸡尾酒排序",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4272,
     "title": "区间排序",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4273,
     "title": "排序可视化（模拟输出）",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 4274,
     "title": "双关键字排序",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 8164,
     "title": "部分排序",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    },
    {
     "pid": 8165,
     "title": "相邻差最小",
     "submitted": 0,
     "accepted": 0,
     "firstAttemptScoreRate": null,
     "averageAttempts": null
    }
   ]
  }
 ],
 "students": [
  {
   "uid": 202,
   "name": "张雨禾",
   "groups": [
    "橙子周六1400CSP04"
   ],
   "stats": {
    "assigned": 17,
    "accepted": 3,
    "firstAttemptScoreRate": 80,
    "finalScoreRate": 17.65,
    "attemptCount": 4,
    "signals": [
     "尚未完成"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4262,
     "title": "冒泡排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f35025d632ee5c41c5dd",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std;\nint arr[10010];\nint n;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\t\n\t\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t\tswap(arr[j],arr[j+1]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\t\n\t\n}\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4fec425d632ee5c41d9f9",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint arr[10010];\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tint maxx=arr[i];\n\t\tint idx=i;\n\t\tfor(int j=i+1;j<=n;j++){\n\t\t\tif(arr[j]>maxx){\n\t\t\t\tmaxx=arr[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(arr[idx],arr[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\t\n\treturn 0;\t\n}\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 6603,
     "title": "简单排序 - 判断题",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 40,
       "rid": "6aa4eb6425d632ee5c41bebb",
       "lang": "_",
       "errorHead": "",
       "code": "'1': A\n'2': B\n'3': A\n'4': B\n'5': A\n"
      },
      {
       "seq": 2,
       "status": "AC",
       "score": 100,
       "rid": "6aa4eb7425d632ee5c41bf02",
       "lang": "_",
       "errorHead": "",
       "code": "'1': B\n'2': B\n'3': A\n'4': A\n'5': B\n"
      }
     ]
    }
   ]
  },
  {
   "uid": 357,
   "name": "苏俊宇",
   "groups": [
    "橙子周六1400CSP04"
   ],
   "stats": {
    "assigned": 17,
    "accepted": 2,
    "firstAttemptScoreRate": 55,
    "finalScoreRate": 11.76,
    "attemptCount": 4,
    "signals": [
     "尚未完成",
     "首刷掌握不足",
     "订正后提升明显"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4262,
     "title": "冒泡排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 10,
       "rid": "6aa4f59825d632ee5c41c8e3",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std; \nint arr[1000];\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\t\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]);\n\t\t\t   int t=arr[j];\n\t\t\t   arr[j]=arr[j+1];\n\t\t\t   arr[j+1]=t;\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      },
      {
       "seq": 2,
       "status": "WA",
       "score": 10,
       "rid": "6aa4f5fb25d632ee5c41c943",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std; \nint arr[1000];\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\t\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]);\n\t\t\t   int t=arr[j];\n\t\t\t   arr[j]=arr[j+1];\n\t\t\t   arr[j+1]=t;\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      },
      {
       "seq": 3,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f63e25d632ee5c41c99a",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std; \nint arr[1000];\nint main(){\n\tint n;\n\tcin>>n;\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\t\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t   int t=arr[j];\n\t\t\t   arr[j]=arr[j+1];\n\t\t\t   arr[j+1]=t;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa5015825d632ee5c41e61c",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std; \nint arr[1000];\nint main(){\n\tint n;\n    cin>>n;\n    for(int i=1;i<=n;i++){\n    \tcin>>arr[i];\n\t}\n\t\n\tfor(int i=1;i<=n;i++){\n\t\tint maxx=arr[i];\n\t\tint idx=i;\n\t\tfor(int j=i+1;j<=n;j++){\n\t\t\tif(arr[j]>maxx){\n\t\t\t\tmaxx=arr[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(arr[idx],arr[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      }
     ]
    }
   ]
  },
  {
   "uid": 360,
   "name": "郑子煜",
   "groups": [
    "橙子周六1400CSP04"
   ],
   "stats": {
    "assigned": 17,
    "accepted": 0,
    "firstAttemptScoreRate": null,
    "finalScoreRate": 0,
    "attemptCount": 0,
    "signals": [
     "尚未开始"
    ]
   },
   "problems": []
  },
  {
   "uid": 370,
   "name": "卢华琛",
   "groups": [
    "橙子周六1400CSP04"
   ],
   "stats": {
    "assigned": 17,
    "accepted": 0,
    "firstAttemptScoreRate": null,
    "finalScoreRate": 0,
    "attemptCount": 0,
    "signals": [
     "尚未开始"
    ]
   },
   "problems": []
  },
  {
   "uid": 393,
   "name": "鲍佳音",
   "groups": [
    "橙子周六1400CSP04"
   ],
   "stats": {
    "assigned": 17,
    "accepted": 0,
    "firstAttemptScoreRate": null,
    "finalScoreRate": 0,
    "attemptCount": 0,
    "signals": [
     "尚未开始"
    ]
   },
   "problems": []
  },
  {
   "uid": 366,
   "name": "王子芮",
   "groups": [],
   "makeup": true,
   "stats": {
    "assigned": 17,
    "accepted": 2,
    "firstAttemptScoreRate": 55,
    "finalScoreRate": 11.76,
    "attemptCount": 5,
    "signals": [
     "尚未完成",
     "首刷掌握不足",
     "订正后提升明显"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4262,
     "title": "冒泡排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 10,
       "rid": "6aa4f64425d632ee5c41c9b6",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint arr[1000];\nint main(){\n\tint n=0,a=0;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t\tswap(arr[j],arr[j+1]);\n\t\t\t\tint t=arr[j];\n\t\t\t\tarr[j]=arr[j+i];\n\t\t\t\tarr[j+1]=t;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      },
      {
       "seq": 2,
       "status": "AC",
       "score": 100,
       "rid": "6aa4fcd225d632ee5c41d61e",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint arr[1000];\nint main(){\n\tint n=0;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t\tswap(arr[j],arr[j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      },
      {
       "seq": 3,
       "status": "WA",
       "score": 0,
       "rid": "6aa4ffd425d632ee5c41dd5c",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint arr[100100];\nint main(){\n\tint n=0;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tint maxx=arr[i];\n\t\tint idx=i;\n\t\tfor(int j=1+i;j<=n;j++){\n\t\t\tif(arr[j]>maxx){\n\t\t\t\tmaxx=arr[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(arr[idx],arr[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      },
      {
       "seq": 4,
       "status": "AC",
       "score": 100,
       "rid": "6aa5004825d632ee5c41df24",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint arr[1000];\nint main(){\n\tint n=0;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(arr[j]>arr[j+1]){\n\t\t\t\tswap(arr[j],arr[j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa5002725d632ee5c41de78",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint arr[100100];\nint main(){\n\tint n=0;\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>arr[i];\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tint maxx=arr[i];\n\t\tint idx=i;\n\t\tfor(int j=1+i;j<=n;j++){\n\t\t\tif(arr[j]>maxx){\n\t\t\t\tmaxx=arr[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(arr[idx],arr[i]);\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout<<arr[i]<<\" \";\n\t}\n\treturn 0;\n}\n"
      }
     ]
    }
   ]
  },
  {
   "uid": 364,
   "name": "李若瑜",
   "groups": [],
   "makeup": true,
   "stats": {
    "assigned": 17,
    "accepted": 0,
    "firstAttemptScoreRate": 30,
    "finalScoreRate": 1.76,
    "attemptCount": 3,
    "signals": [
     "尚未完成",
     "首刷掌握不足",
     "反复尝试仍未通过"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 30,
       "rid": "6aa5001c25d632ee5c41de3f",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std;\nint r[100100];\nint main(){\n\tint n=0;\n\tcin >> n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin >> r[i];\n\t}for(int i=1;i<=n;i++){\n\t\tint m=r[i];\n\t\tint d=i;\n\t\tfor(int j=1+i;j<=n;j++){\n\t\t\tif(r[j]>m){\n\t\t\t\tm=r[j];\n\t\t\t\td=j;\n\t\t\t}\n\t\t\tswap(r[d],r[i]);\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout << r[i] << \" \";\n\t}\t\n\treturn 0;\n} "
      },
      {
       "seq": 2,
       "status": "WA",
       "score": 30,
       "rid": "6aa5005c25d632ee5c41df73",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std;\nint r[100100];\nint main(){\n\tint n=0;\n\tcin >> n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin >> r[i];\n\t}for(int i=1;i<=n;i++){\n\t\tint m=r[i];\n\t\tint d=i;\n\t\tfor(int j=1+i;j<=n;j++){\n\t\t\tif(r[j]>m){\n\t\t\t\tm=r[j];\n\t\t\t\td=j;\n\t\t\t}\n\t\t\tswap(r[d],r[i]);\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout << r[i] << \" \";\n\t}\t\n\treturn 0;\n} \n"
      },
      {
       "seq": 3,
       "status": "WA",
       "score": 30,
       "rid": "6aa501bf25d632ee5c41e96f",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h>\nusing namespace std;\nint r[100100];\nint main(){\n\tint n=0;\n\tcin >> n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin >> r[i];\n\t}for(int i=1;i<=n;i++){\n\t\tint m=r[i];\n\t\tint d=i;\n\t\tfor(int j=1+i;j<=n;j++){\n\t\t\tif(r[j]>m){\n\t\t\t\tm=r[j];\n\t\t\t\td=j;\n\t\t\t}\n\tswap(r[d],r[i]);\n\t\t}\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tcout << r[i] << \" \";\n\t}\t\n\treturn 0;\n} \n"
      }
     ]
    }
   ]
  },
  {
   "uid": 352,
   "name": "张立坤",
   "groups": [],
   "makeup": true,
   "stats": {
    "assigned": 17,
    "accepted": 6,
    "firstAttemptScoreRate": 83.33,
    "finalScoreRate": 35.29,
    "attemptCount": 9,
    "signals": [
     "尚未完成"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4262,
     "title": "冒泡排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f3be25d632ee5c41c68c",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include <bits/stdc++.h>\nusing namespace std;\nint a[1010];\nint n;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(a[j]>a[j+1]){\n\t\t\t\tswap(a[j],a[j+1]);\n\t\t\t}\n\t\t} \n\t\t\n\t\t\n\t} \n\tfor(int i=1;i<=n;i++){\n\t\tcout<<a[i]<<\" \";\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f40625d632ee5c41c700",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include <bits/stdc++.h>\nusing namespace std;\nint a[1010];\nint n;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(a[j]<a[j+1]){\n\t\t\t\tswap(a[j],a[j+1]);\n\t\t\t}\n\t\t} \n\t\t\n\t\t\n\t} \n\tfor(int i=1;i<=n;i++){\n\t\tcout<<a[i]<<\" \";\n\t}\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4264,
     "title": "计算排序后的交换次数",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f47c25d632ee5c41c7da",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include <bits/stdc++.h>\nusing namespace std;\nint a[1010];\nint n,s;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(a[j]>a[j+1]){\n\t\t\t\tswap(a[j],a[j+1]);\n\t\t\t\ts++;\n\t\t\t}\n\t\t} \n\t\t\n\t\t\n\t} \n\tfor(int i=1;i<=n;i++){\n\t\tcout<<a[i]<<\" \";\n\t}\n\tcout<<endl<<s;\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4265,
     "title": "求第 K 小的数",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f55b25d632ee5c41c883",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include <bits/stdc++.h>\nusing namespace std;\nint a[1010];\nint n,s;\nint main(){\n\tcin>>n>>s;\n\tfor(int i=1;i<=n;i++){\n\t\tcin>>a[i];\n\t}\n\tfor(int i=1;i<=n-1;i++){\n\t\tfor(int j=1;j<=n-i;j++){\n\t\t\tif(a[j]>a[j+1]){\n\t\t\t\tswap(a[j],a[j+1]);\n\t\t\t}\n\t\t} \n\t\t\n\t\t\n\t} \n\tfor(int i=1;i<=n;i++){\n\t\tcout<<a[s]<<\" \";\n\t\treturn 0;\n\t}\n\tcout<<endl<<s;\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 6602,
     "title": "简单排序 - 选择题",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 40,
       "rid": "6aa500c325d632ee5c41e31d",
       "lang": "_",
       "errorHead": "",
       "code": "'1': A\n'2': B\n'3': A\n'4': B\n'5': A\n"
      },
      {
       "seq": 2,
       "status": "WA",
       "score": 40,
       "rid": "6aa500d425d632ee5c41e397",
       "lang": "_",
       "errorHead": "",
       "code": "'1': A\n'2': B\n'3': D\n'4': A\n'5': C\n"
      },
      {
       "seq": 3,
       "status": "AC",
       "score": 100,
       "rid": "6aa500e325d632ee5c41e3c8",
       "lang": "_",
       "errorHead": "",
       "code": "'1': A\n'2': B\n'3': C\n'4': C\n'5': B\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 6603,
     "title": "简单排序 - 判断题",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 60,
       "rid": "6aa501a425d632ee5c41e7e8",
       "lang": "_",
       "errorHead": "",
       "code": "'1': A\n'2': B\n'3': A\n'4': A\n'5': A\n"
      },
      {
       "seq": 2,
       "status": "AC",
       "score": 100,
       "rid": "6aa501ad25d632ee5c41e7ff",
       "lang": "_",
       "errorHead": "",
       "code": "'1': B\n'2': B\n'3': A\n'4': A\n'5': B\n"
      }
     ]
    }
   ]
  },
  {
   "uid": 365,
   "name": "潘沐辰",
   "groups": [],
   "makeup": true,
   "stats": {
    "assigned": 17,
    "accepted": 2,
    "firstAttemptScoreRate": 50,
    "finalScoreRate": 11.76,
    "attemptCount": 4,
    "signals": [
     "尚未完成",
     "首刷掌握不足",
     "订正后提升明显"
    ]
   },
   "problems": [
    {
     "tid": "tid1",
     "pid": 4262,
     "title": "冒泡排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "AC",
       "score": 100,
       "rid": "6aa4f4f925d632ee5c41c833",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint ar[1010],n;\nint main(){\n\tcin >> n;\n\tfor (int i=1;i<=n;i++){\n\t\tcin >> ar[i];\n\t}\n\tfor (int i=1;i<=n-1;i++){\n\t\tfor (int j=1;j<=n-i;j++){\n\t\t\tif (ar[j]>ar[j+1]){\n\t\t\t\tswap(ar[j],ar[j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tcout << ar[i] << ' ';\n\t}\n\treturn 0;\n}\n"
      }
     ]
    },
    {
     "tid": "tid1",
     "pid": 4263,
     "title": "选择排序实现",
     "submissions": [
      {
       "seq": 1,
       "status": "WA",
       "score": 0,
       "rid": "6aa4fc4d25d632ee5c41d51f",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint ar[1010],n;\nint main(){\n\tcin >> n;\n\tfor (int i=1;i<=n;i++){\n\t\tcin >> ar[i];\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tfor (int j=1;j<=n-i;j++){\n\t\t\tif (ar[j]>ar[j+1]){\n\t\t\t\tswap(ar[j],ar[j+1]);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tcout << ar[i] << ' ';\n\t}\n\treturn 0;\n}\n"
      },
      {
       "seq": 2,
       "status": "WA",
       "score": 10,
       "rid": "6aa4fe6925d632ee5c41d8d0",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint ar[1010],n;\nint main(){\n\tcin >> n;\n\tfor (int i=1;i<=n;i++){\n\t\tcin >> ar[i];\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tint maxx=INT_MIN;\n\t\tint idx;\n\t\t\n\t\tfor (int j=1+i;j<=n;j++){\n\t\t\tif (ar[j]>maxx){\n\t\t\t\tmaxx=ar[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(ar[idx],ar[i]);\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tcout << ar[i] << ' ';\n\t}\n\treturn 0;\n}\n"
      },
      {
       "seq": 3,
       "status": "AC",
       "score": 100,
       "rid": "6aa4fec525d632ee5c41da01",
       "lang": "cc.cc14o2",
       "errorHead": "",
       "code": "#include<bits/stdc++.h> \nusing namespace std;\nint ar[1010],n;\nint main(){\n\tcin >> n;\n\tfor (int i=1;i<=n;i++){\n\t\tcin >> ar[i];\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tint maxx=ar[i];\n\t\tint idx=i;\n\t\t\n\t\tfor (int j=1+i;j<=n;j++){\n\t\t\tif (ar[j]>maxx){\n\t\t\t\tmaxx=ar[j];\n\t\t\t\tidx=j;\n\t\t\t}\n\t\t}\n\t\tswap(ar[idx],ar[i]);\n\t}\n\tfor (int i=1;i<=n;i++){\n\t\tcout << ar[i] << ' ';\n\t}\n\treturn 0;\n}\n"
      }
     ]
    }
   ]
  }
 ],
 "objective": {
  "6602": {
   "title": "简单排序 - 选择题 - 题目详情 - 穹狼科创",
   "questions": [
    {
     "no": 1,
     "text": "【202503】对数组 arr[]={5, 3, 8, 1} 进行升序排序，执行第一轮冒泡排序后数组 arr 中的内容为（ ）。",
     "options": [
      "3, 5, 1, 8",
      "3, 1, 5, 8",
      "3, 5, 8, 1",
      "5, 3, 8, 1"
     ]
    },
    {
     "no": 2,
     "text": "【202506】小杨在整理一副扑克牌的所有红心扑克牌，使其从小到大排列。他的做法是：最开始抓到第1张扑克牌被认为已经排好序；然后抓第2张扑克牌，将其插入至有序部分的正确位置；不断循环步骤，每次将新抓到扑克牌插入至有序部分，直至抓完所有扑克牌，这样抓牌结束时就完成了扑克牌的排序。小杨这种整理扑克牌的方式与（ ）排序的方式最接近。",
     "options": [
      "冒泡排序",
      "插入排序",
      "选择排序",
      "直接排序"
     ]
    },
    {
     "no": 3,
     "text": "【202509】关于排序算法的稳定性，以下说法错误的是（ ）。",
     "options": [
      "稳定的排序算法不改变相等元素的相对位置",
      "冒泡排序是稳定的排序算法",
      "选择排序是稳定的排序算法",
      "插入排序是稳定的排序算法"
     ]
    },
    {
     "no": 4,
     "text": "【202606】下面代码使用某种排序算法，将数组中的元素按从小到大排序。这段代码使用的排序算法是（ ）。 void mystery_sort(double arr[], int n) { for (int i = 0; i < n - 1; i++) { int minPos = i; for (int j = i + 1; j < n; j++) { if (arr[j] < arr[minPos]) { minPos = j; } } double temp = arr[i]; arr[i] = arr[minPos]; arr[minPos] = temp; } }",
     "options": [
      "冒泡排序",
      "插入排序",
      "选择排序",
      "非典型排序"
     ]
    },
    {
     "no": 5,
     "text": "【202509】关于插入排序的时间复杂度，下列说法正确的是（ ）。",
     "options": [
      "最好情况和最坏情况的时间复杂度都是",
      "O",
      "(",
      "n",
      "2",
      ")",
      "最好情况是",
      "O",
      "(",
      "n",
      ")",
      "，最坏情况是",
      "O",
      "(",
      "n",
      "2",
      ")",
      "最好情况是",
      "O",
      "(",
      "n",
      ")",
      "，最坏情况是",
      "O",
      "(",
      "2",
      "n",
      ")",
      "最好情况是",
      "O",
      "(",
      "n",
      "2",
      ")",
      "，最坏情况是",
      "O",
      "(",
      "2",
      "n",
      ")"
     ]
    }
   ]
  },
  "6603": {
   "title": "简单排序 - 判断题 - 题目详情 - 穹狼科创",
   "questions": [
    {
     "no": 1,
     "text": "【202509】对整数数组 {4, 1, 3, 1, 5, 2} 进行冒泡排序（将最大元素放到最后），执行一轮之后是 {4, 1, 3, 1, 2, 5} 。",
     "options": [
      "正确",
      "错误"
     ]
    },
    {
     "no": 2,
     "text": "【202503】对数组 arr[]={4, 3, 1, 5, 2} 进行升序排序，执行第一轮选择排序后数组arr中的内容是 {1, 4, 3, 5, 2} 。",
     "options": [
      "正确",
      "错误"
     ]
    },
    {
     "no": 3,
     "text": "【202512】冒泡排序和插入排序都是稳定排序算法。",
     "options": [
      "正确",
      "错误"
     ]
    },
    {
     "no": 4,
     "text": "【202606】如果使用带 flag 的冒泡排序，且待排序数组一开始就是有序的，那么算法只需一轮扫描即可结束，时间复杂度为 O ( n ) 。",
     "options": [
      "正确",
      "错误"
     ]
    },
    {
     "no": 5,
     "text": "【202603】由于选择排序和插入排序的时间复杂度均为 O ( n 2 ) ，在任何实际场景下两者的性能表现几乎相同，可以互相替代。（ ）",
     "options": [
      "正确",
      "错误"
     ]
    }
   ]
  }
 }
}