Submission #3380156
Source Code Expand
import java.util.*; public class Main{ static int Search(String[][] literal, int[][] litvar, String var){ int index = -1; for(int i=0; i<literal[0].length; i++){ String lit1 = literal[0][i]; String lit2 = literal[1][i]; char var1 = var.charAt(litvar[0][i]); char var2 = var.charAt(litvar[1][i]); if((lit1.charAt(0)!='~'&&lit2.charAt(0)!='~'&&var1=='F'&&var2=='F')||(lit1.charAt(0)=='~'&&lit2.charAt(0)!='~'&&var1=='T'&&var2=='F')||(lit1.charAt(0)!='~'&&lit2.charAt(0)=='~'&&var1=='F'&&var2=='T')||(lit1.charAt(0)=='~'&&lit2.charAt(0)=='~'&&var1=='T'&&var2=='T')){ index = i; break; } } return index; } static String Changevar(String var, int litvar){ StringBuilder sb = new StringBuilder(var); if(var.charAt(litvar)=='T'){ sb.setCharAt(litvar, 'F'); } else{ sb.setCharAt(litvar, 'T'); } return sb.toString(); } public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); String cnf = sc.next(); String a = sc.next(); String[] clause = new String[m]; String[][] literal = new String[2][m]; int[][] litvar = new int[2][m]; Arrays.fill(clause, ""); int j = 1; for(int i=0; i<m; i++){ while(!cnf.substring(j, j+1).equals(")")){ clause[i] += cnf.substring(j, j+1); j++; } j += 3; } for(int i=0; i<m; i++){ String[] spl = clause[i].split("v", 0); for(int k=0; k<=1; k++){ literal[k][i] = spl[k]; if(literal[k][i].charAt(0)=='~'){ litvar[k][i] = Integer.parseInt(literal[k][i].substring(1)) - 1; } else{ litvar[k][i] = Integer.parseInt(literal[k][i]) - 1; } } } String ans = ""; String[] var = new String[2050]; var[0] = a; int now = Search(literal, litvar, var[0]); if(now<0){ ans = "0"; } else{ int cnt = 0; Queue<Integer> queue = new ArrayDeque<Integer>(); queue.add(now); int flag = 0; while(queue.size()!=0 && flag==0){ now = queue.poll(); for(int i=0; i<=1; i++){ cnt++; if(cnt>2046){ flag = 1; break; } var[cnt] = Changevar(var[(cnt+1)/2-1], litvar[i][now]); if(Search(literal, litvar, var[cnt])<0){ flag = 2; break; } queue.add(Search(literal, litvar, var[cnt])); } } if(flag==1){ ans = "TOO LARGE"; } if(flag==2){ int sum = -1; for(int i=0; i<=10; i++){ sum = 2*sum + 2; if(cnt<=sum){ ans = String.valueOf(i); break; } } } } System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | E - 2-SAT |
User | Ricky_pon |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 2632 Byte |
Status | AC |
Exec Time | 727 ms |
Memory | 226148 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 200 / 200 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00-sample-00, 00-sample-10, 00-sample-20, 10-sat-00, 10-sat-01, 10-sat-02, 10-sat-03, 10-sat-04, 10-sat-05, 10-sat-06, 10-sat-07, 10-sat-08, 10-sat-09, 10-sat-10, 10-sat-11, 10-sat-12, 10-sat-13, 10-sat-14, 10-sat-15, 10-sat-16, 10-sat-17, 10-sat-18, 10-sat-19, 10-sat-20, 10-sat-21, 10-sat-22, 10-sat-23, 10-sat-24, 10-sat-25, 10-sat-26, 10-sat-27, 10-sat-28, 10-sat-29, 10-sat-30, 10-sat-31, 10-sat-32, 10-sat-33, 10-sat-34, 10-sat-35, 10-sat-36, 10-sat-37, 10-sat-38, 10-sat-39, 20-unsat-00, 20-unsat-01, 20-unsat-02, 20-unsat-03, 20-unsat-04, 20-unsat-05, 20-unsat-06, 20-unsat-07, 20-unsat-08, 20-unsat-09 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample-00 | AC | 92 ms | 20692 KB |
00-sample-10 | AC | 100 ms | 21204 KB |
00-sample-20 | AC | 115 ms | 21716 KB |
10-sat-00 | AC | 265 ms | 41996 KB |
10-sat-01 | AC | 213 ms | 40708 KB |
10-sat-02 | AC | 489 ms | 66776 KB |
10-sat-03 | AC | 287 ms | 43508 KB |
10-sat-04 | AC | 565 ms | 112788 KB |
10-sat-05 | AC | 375 ms | 60180 KB |
10-sat-06 | AC | 532 ms | 113628 KB |
10-sat-07 | AC | 469 ms | 100296 KB |
10-sat-08 | AC | 555 ms | 107240 KB |
10-sat-09 | AC | 327 ms | 54900 KB |
10-sat-10 | AC | 584 ms | 109608 KB |
10-sat-11 | AC | 478 ms | 80700 KB |
10-sat-12 | AC | 589 ms | 111792 KB |
10-sat-13 | AC | 512 ms | 106744 KB |
10-sat-14 | AC | 528 ms | 113104 KB |
10-sat-15 | AC | 325 ms | 56112 KB |
10-sat-16 | AC | 539 ms | 113540 KB |
10-sat-17 | AC | 250 ms | 49120 KB |
10-sat-18 | AC | 598 ms | 136696 KB |
10-sat-19 | AC | 542 ms | 115688 KB |
10-sat-20 | AC | 551 ms | 158592 KB |
10-sat-21 | AC | 338 ms | 66588 KB |
10-sat-22 | AC | 643 ms | 224240 KB |
10-sat-23 | AC | 412 ms | 79352 KB |
10-sat-24 | AC | 660 ms | 222984 KB |
10-sat-25 | AC | 508 ms | 109616 KB |
10-sat-26 | AC | 655 ms | 218720 KB |
10-sat-27 | AC | 529 ms | 104880 KB |
10-sat-28 | AC | 653 ms | 219908 KB |
10-sat-29 | AC | 419 ms | 73564 KB |
10-sat-30 | AC | 727 ms | 223892 KB |
10-sat-31 | AC | 377 ms | 64156 KB |
10-sat-32 | AC | 691 ms | 222188 KB |
10-sat-33 | AC | 432 ms | 91604 KB |
10-sat-34 | AC | 662 ms | 222280 KB |
10-sat-35 | AC | 280 ms | 76356 KB |
10-sat-36 | AC | 670 ms | 225256 KB |
10-sat-37 | AC | 267 ms | 77056 KB |
10-sat-38 | AC | 670 ms | 226148 KB |
10-sat-39 | AC | 375 ms | 58296 KB |
20-unsat-00 | AC | 691 ms | 218280 KB |
20-unsat-01 | AC | 489 ms | 100264 KB |
20-unsat-02 | AC | 676 ms | 218372 KB |
20-unsat-03 | AC | 294 ms | 102172 KB |
20-unsat-04 | AC | 665 ms | 215332 KB |
20-unsat-05 | AC | 302 ms | 73052 KB |
20-unsat-06 | AC | 668 ms | 219216 KB |
20-unsat-07 | AC | 507 ms | 112300 KB |
20-unsat-08 | AC | 691 ms | 222436 KB |
20-unsat-09 | AC | 491 ms | 111796 KB |