QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#575790 | #9308. World Cup | 1091857051 | AC ✓ | 91ms | 45016kb | Java8 | 2.0kb | 2024-09-19 16:47:38 | 2024-09-19 16:47:39 |
Judging History
answer
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.nio.Buffer;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
static kattio sc=new kattio();
static PrintWriter out=new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
public static void main(String[] args) {
int t=sc.nextint();
while (t-->0) {
sovle();
}
out.close();
}
static void sovle(){
int n=32;
int []arr=new int[n];
int team=0;
for (int i = 0; i < arr.length; i++) {
arr[i]=sc.nextint();
}
team=arr[0];
int xiao=0;int da=0;
for (int i = 1; i < arr.length; i++) {
if (arr[i]<arr[0]) {
xiao++;
}else {
da++;
}
}
int ans=32;
if (xiao>=2) {
ans/=2;
if (xiao>5) {
ans/=2;
if (xiao>=13) {
ans/=2;
if (xiao>=27) {
ans/=2;
if (xiao==31) {
ans/=2;
}
}
}
}
}
out.println(ans);
}
}
class kattio extends PrintWriter{
private BufferedReader b;
private StringTokenizer st;
public kattio(){this(System.in,System.out);}
public kattio(InputStream i,OutputStream o){
super(o);
b=new BufferedReader(new InputStreamReader(i));
}
public kattio(String i,String o) throws IOException{
super(o);
b=new BufferedReader(new FileReader(i));
}
public String next(){
try {
while (st==null||!st.hasMoreElements()) {
st=new StringTokenizer(b.readLine());
}
return st.nextToken();
} catch (Exception e) {
return null;
// TODO: handle exception
}
}
public int nextint(){return Integer.parseInt(next());}
public long nextlong(){return Long.parseLong(next());}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 30ms
memory: 37540kb
input:
1 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 41ms
memory: 38612kb
input:
32 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...
output:
32 32 16 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1
result:
ok 32 numbers
Test #3:
score: 0
Accepted
time: 91ms
memory: 45016kb
input:
1000 158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 628894325 731963982 822804784 450968417 430302156 982631932 161735902 880895728 923078537 707723857 189330739 910286918 802329211 404539679 303238506 317063340 492686568 773361868 125660...
output:
16 4 1 4 1 4 4 2 4 2 4 32 4 2 4 4 8 4 32 1 4 4 2 4 2 16 2 8 4 8 8 1 2 4 8 4 16 4 4 2 4 4 2 16 8 4 2 16 4 8 8 4 4 4 4 16 16 2 1 4 4 8 1 4 4 2 4 8 16 4 4 8 4 32 32 8 8 8 1 4 4 4 4 4 32 8 4 4 8 32 4 4 16 2 8 32 16 8 8 4 1 4 4 16 32 4 4 4 4 4 8 4 4 8 4 4 4 8 16 4 4 8 2 4 4 16 2 8 16 4 4 16 2 32 8 16 4 3...
result:
ok 1000 numbers
Extra Test:
score: 0
Extra Test Passed