Java 1073 多选题常见计分法

《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！

结尾无空行

输出样例 2：

5.0

5.0

Too simple

结尾无空行

Java代码实现（未AC，测试点4超时）：

=====================

import java.io.BufferedReader;

import java.io.InputStreamReader;

import java.io.OutputStreamWriter;

import java.io.PrintWriter;

import java.io.StreamTokenizer;

import java.util.Arrays;

public class Main {

public static void main(String[] args) throws Exception {

BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

StreamTokenizer in = new StreamTokenizer(bf);

in.wordChars(‘(’, ‘(’);

in.wordChars(‘)’, ‘)’);

in.nextToken();

int N = (int) in.nval;

in.nextToken();

int M = (int) in.nval;

tm[] t = new tm[M];

double sum = 0;

for (int i = 0; i < M; i++) {

in.nextToken();

int fs = (int) in.nval;

in.nextToken();

int gs = (int) in.nval;

in.nextToken();

int zqgs = (int) in.nval;

int[] ans = new int[5];

sum += fs;

for (int j = 0; j < zqgs; j++) {

in.nextToken();

ans[in.sval.charAt(0) - ‘a’] = 1;

}

t[i] = new tm(i + 1, fs, gs, zqgs, ans);

}

int count = 0;

for (int i = 0; i < N; i++) {

double fs = 0;

for (int j = 0; j < M; j++) {

in.nextToken();

int sgs = in.sval.charAt(1) - ‘0’;

int[] sans = new int[5];

for (int k = 0; k < sgs; k++) {

in.nextToken();

sans[in.sval.charAt(0) - ‘a’] = 1;

}

fs += t[j].check(sgs, sans);

}

out.printf(“%.1f\n”, fs);

if (fs != sum) {

count++;

}

}

if (count == 0) {

out.println(“Too simple”);

} else {

Arrays.sort(t);

int max = t[0].x[t[0].imax];

for (tm tem : t) {

int tmax = tem.x[tem.imax];

if (tmax == max) {

for (int i = 0; i < tem.gs; i++) {

if (tem.x[i] == tmax) {

out.println(max + " " + tem.bh + “-” + (char) (i + ‘a’));

}

}

} else {

break;

}

}

}

out.flush();

}

static class tm implements Comparable {

int bh;

double fs;

int gs;

int zqgs;

int[] ans;

int imax = 0;

int[] x;

tm(int b, int f, int g, int zq, int[] a) {

bh = b;

fs = f;

gs = g;

zqgs = zq;

ans = a;

x = new int[g];

}

double check(int sgs, int[] sans) {

double F = fs;

for (int i = 0; i < gs; i++) {

if (ans[i] != sans[i]) {

x[i]++;

if (ans[i] == 1) {

if (F != 0) {

F = fs / 2;

}

} else if (ans[i] == 0) {

F = 0;

}

if (x[imax] < x[i]) {

imax = i;

}

}

}

return F;

}

@Override

public int compareTo(tm o) {

if (o.x[o.imax] == this.x[this.imax]) {

return this.bh - o.bh;

}

return o.x[o.imax] - this.x[this.imax];

}

}

}

C++代码实现（AC）：

============

#include

#include

#include

using namespace std;

struct choo//题目选项信息

{

int full;

int chnum;

int an;

string ch;

};

int main()

{

int n,m,i,j,x,k,f,wr=0;

char co;

float s;

cin>>n>>m;

int wrong[m][5]={0};

choo choo[m];

for(i=0;i<m;i++)//选项

{

cin>>choo[i].full>>choo[i].chnum>>choo[i].an;

for(j=0;j<choo[i].an;j++)

cin>>co,choo[i].ch+=co;

}

while(n–)//遍历学生

{

s=0;//每个学生的成绩

for(i=0;i<m;i++)

{

scanf(" ");//便于（的输入

string ans;

scanf(“(%d”,&x);

for(j=0;j<x;j++)

scanf(" %c",&co),ans+=co;//必须加空格

最后

小编精心为大家准备了一手资料

以上Java高级架构资料、源码、笔记、视频。Dubbo、Redis、设计模式、Netty、zookeeper、Spring cloud、分布式、高并发等架构技术

【附】架构书籍

1. BAT面试的20道高频数据库问题解析
2. Java面试宝典
3. Netty实战
4. 算法

BATJ面试要点及Java架构师进阶资料

《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！
P-1714431067360)]

以上Java高级架构资料、源码、笔记、视频。Dubbo、Redis、设计模式、Netty、zookeeper、Spring cloud、分布式、高并发等架构技术

【附】架构书籍

1. BAT面试的20道高频数据库问题解析
2. Java面试宝典
3. Netty实战
4. 算法

[外链图片转存中…(img-iVRMIaTD-1714431067360)]

BATJ面试要点及Java架构师进阶资料

[外链图片转存中…(img-LNZfUOR1-1714431067360)]

《一线大厂Java面试题解析+核心总结学习笔记+最新讲解视频+实战项目源码》，点击传送门，即可获取！