oj.uz

Submission #336991

# Submission time Handle Problem Language Result Execution time Memory
336991 2020-12-17T17:43:42 Z KWang31 Xoractive (IZhO19_xoractive) Java 11
100 / 100
 642 ms 21404 KB 
import java.io.*; import java.util.*;
public class Xoractive{
	

    
    static int MOD=998244353;
    static int[] rk, p,siz;
    /*
    public static void main(String[] args){
        int[] x= {1,1,6,6,7,7};
        int[] y= {1,1,1,2,2,3,3,5,5,6,6,7,7};
        System.out.println(ext(x,y));
    }
    */
    public static int[] guess(int n) {
    	int[] ans=new int[n];
    	ans[0]=grader.ask(1);//Array is 1-indexed
    	
    	ArrayList<Integer> S[][]=new ArrayList[7][2];
    	ArrayList<Integer> cur=new ArrayList<>();
    	ArrayList<Integer> all=new ArrayList<>();
    	int[] c;
    	for(int i=0;i<7;i++) {//Compute S[i][0]
    		S[i][0]=new ArrayList<>(); cur=new ArrayList<>();
    		for(int j=1;j<n;j++) {
    			if((j&(1<<i))==0) {
    				cur.add(j+1);//1-indexed!!
    			}
    		}
    		c=new int[cur.size()]; for(int j=0;j<cur.size();j++) c[j]=cur.get(j);
    		int[] x=grader.get_pairwise_xor(c);
    		c=new int[cur.size()+1]; for(int j=0;j<cur.size();j++) c[j]=cur.get(j); c[cur.size()]=1;
    		int[] y=grader.get_pairwise_xor(c);
    		int pter=0;while(pter<x.length && x[pter]==0) {pter++;}//Ignore zero elements
    		int cnt=0; int jj; cur=ext(x,y);
    		
    		for(int j: cur) {
    			j^=ans[0]; 
    			//if(i==0)System.out.println("element: "+j);
    			if(S[i][0].contains(j))continue;
    			S[i][0].add(j);
    			if(!all.contains(j)) {
    				all.add(j);
    			}
    		}
    		//System.out.println(i+"..."+S[i][0]);
    		
    	}
    	for(int i=0;i<7;i++) {
    		S[i][1]=new ArrayList<>();
    		for(int j: all) {
    			if(!S[i][0].contains(j)) {
    				S[i][1].add(j);
    			}
    		}
    	}
    	
    	for(int i=1; i<n;i++) {
    		
    		for(int j: S[0][i&1]) {
    			boolean ok=true;
    			for(int k=1; k<7; k++) {
    				if(!S[k][(i>>>k)&1].contains(j)) {
    					ok=false; break;
    				}
    			}
    			if(ok) {
        			ans[i]=j;  break;
        		}
    		}
    		
    	}
    	return ans;
    }
    public static ArrayList<Integer> ext(int[] x, int[] y){
    	int pter=0; while(pter<x.length && x[pter]==0)pter++; int jj;
    	ArrayList<Integer> cur=new ArrayList<>();
    	for(int j=0; j<y.length; j++) {
			//System.out.println(j+" "+cur);
			if(y[j]==0)continue;
			jj=j;
			while(pter<x.length && jj<y.length && x[pter]==y[j] && y[j]==y[jj]) {
				pter++; jj++;
			}
			if(pter<x.length && jj<y.length && x[pter]>y[j] && y[jj]==y[j]) {
				cur.add(y[j]); 
				while(jj<y.length && y[jj]==y[j])jj++;
			}else if(pter==x.length && jj<y.length && y[jj]==y[j]) {
				cur.add(y[j]); 
				while(jj<y.length && y[jj]==y[j])jj++;
			}
			j=jj-1;
			//Compare 
			//x=[1,1,2,2,2]
			//y=[1,1,2,2,3]
		}
    	return cur;
    }
}
//Debugging:
//Are you sure your algorithm is correct?
//Bounds: long
//Special cases: n=0,1?
//Make sure you remove your debugging code before you submit!

Compilation message

Note: Xoractive.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 10240 KB Output is correct
2 Correct 121 ms 10476 KB Output is correct
3 Correct 122 ms 10476 KB Output is correct
4 Correct 121 ms 10352 KB Output is correct

Subtask #2
94.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 19108 KB Output is correct
2 Correct 404 ms 19404 KB Output is correct
3 Correct 325 ms 19360 KB Output is correct
4 Correct 639 ms 19968 KB Output is correct
5 Correct 326 ms 19480 KB Output is correct
6 Correct 314 ms 19308 KB Output is correct
7 Correct 306 ms 19344 KB Output is correct
8 Correct 507 ms 19960 KB Output is correct
9 Correct 318 ms 20136 KB Output is correct
10 Correct 394 ms 19820 KB Output is correct
11 Correct 312 ms 19740 KB Output is correct
12 Correct 489 ms 19600 KB Output is correct
13 Correct 497 ms 19520 KB Output is correct
14 Correct 323 ms 19304 KB Output is correct
15 Correct 316 ms 19324 KB Output is correct
16 Correct 309 ms 19324 KB Output is correct
17 Correct 310 ms 19208 KB Output is correct
18 Correct 395 ms 19128 KB Output is correct
19 Correct 291 ms 18232 KB Output is correct
20 Correct 321 ms 19444 KB Output is correct
21 Correct 306 ms 18428 KB Output is correct
22 Correct 506 ms 21068 KB Output is correct
23 Correct 393 ms 20232 KB Output is correct
24 Correct 631 ms 21404 KB Output is correct
25 Correct 304 ms 19160 KB Output is correct
26 Correct 615 ms 20988 KB Output is correct
27 Correct 466 ms 19496 KB Output is correct
28 Correct 510 ms 19992 KB Output is correct
29 Correct 499 ms 19816 KB Output is correct
30 Correct 632 ms 20216 KB Output is correct
31 Correct 378 ms 19292 KB Output is correct
32 Correct 305 ms 18828 KB Output is correct
33 Correct 402 ms 20120 KB Output is correct
34 Correct 416 ms 20268 KB Output is correct
35 Correct 319 ms 19432 KB Output is correct
36 Correct 538 ms 20636 KB Output is correct
37 Correct 404 ms 19784 KB Output is correct
38 Correct 410 ms 19248 KB Output is correct
39 Correct 311 ms 19136 KB Output is correct
40 Correct 317 ms 19192 KB Output is correct
41 Correct 495 ms 19912 KB Output is correct
42 Correct 309 ms 19320 KB Output is correct
43 Correct 309 ms 18944 KB Output is correct
44 Correct 406 ms 19192 KB Output is correct
45 Correct 317 ms 19332 KB Output is correct
46 Correct 489 ms 19520 KB Output is correct
47 Correct 320 ms 19436 KB Output is correct
48 Correct 308 ms 19064 KB Output is correct
49 Correct 418 ms 19892 KB Output is correct
50 Correct 398 ms 19852 KB Output is correct
51 Correct 390 ms 19504 KB Output is correct
52 Correct 315 ms 19088 KB Output is correct
53 Correct 397 ms 19284 KB Output is correct
54 Correct 495 ms 19808 KB Output is correct
55 Correct 331 ms 18820 KB Output is correct
56 Correct 498 ms 19740 KB Output is correct
57 Correct 308 ms 19732 KB Output is correct
58 Correct 426 ms 20704 KB Output is correct
59 Correct 311 ms 19728 KB Output is correct
60 Correct 321 ms 20116 KB Output is correct
61 Correct 642 ms 20612 KB Output is correct
62 Correct 511 ms 19744 KB Output is correct
63 Correct 302 ms 19264 KB Output is correct
64 Correct 308 ms 18844 KB Output is correct
65 Correct 407 ms 19804 KB Output is correct
66 Correct 310 ms 20176 KB Output is correct
67 Correct 296 ms 18464 KB Output is correct
68 Correct 323 ms 20060 KB Output is correct
69 Correct 327 ms 19996 KB Output is correct
70 Correct 517 ms 20288 KB Output is correct
71 Correct 319 ms 19228 KB Output is correct
72 Correct 494 ms 20380 KB Output is correct
73 Correct 519 ms 19832 KB Output is correct
74 Correct 636 ms 20848 KB Output is correct
75 Correct 320 ms 19552 KB Output is correct
76 Correct 324 ms 19608 KB Output is correct
77 Correct 520 ms 20500 KB Output is correct
78 Correct 505 ms 19448 KB Output is correct
79 Correct 350 ms 19332 KB Output is correct
80 Correct 504 ms 19888 KB Output is correct
81 Correct 308 ms 19332 KB Output is correct
82 Correct 309 ms 19432 KB Output is correct
83 Correct 343 ms 19336 KB Output is correct
84 Correct 315 ms 19688 KB Output is correct
85 Correct 323 ms 20196 KB Output is correct
86 Correct 518 ms 19832 KB Output is correct
87 Correct 396 ms 20652 KB Output is correct
88 Correct 320 ms 19212 KB Output is correct
89 Correct 608 ms 20724 KB Output is correct
90 Correct 307 ms 19280 KB Output is correct
91 Correct 466 ms 19348 KB Output is correct
92 Correct 407 ms 20340 KB Output is correct
93 Correct 423 ms 20000 KB Output is correct
94 Correct 410 ms 20748 KB Output is correct
95 Correct 342 ms 18312 KB Output is correct
96 Correct 432 ms 20636 KB Output is correct
97 Correct 325 ms 20068 KB Output is correct
98 Correct 483 ms 19116 KB Output is correct
99 Correct 310 ms 19228 KB Output is correct
100 Correct 502 ms 20016 KB Output is correct