Submission #3375511
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 if(now>=0){ int[] bin = {0, 1}; int cnt = 0; Queue<Integer> queue = new ArrayDeque<Integer>(); queue.add(now); while(queue.size()!=0){ now = queue.poll(); for(int i=0; i<=1; i++){ cnt++; if(cnt>2046){ break; } var[cnt] = Changevar(var[(cnt+1)/2-1], litvar[i][now]); if(Search(literal, litvar, var[cnt])<0){ break; } else{ queue.add(Search(literal, litvar, var[cnt])); } } } if(cnt>2046)ans = "TOO LARGE"; else{ int sum = -1; for(int i=0; i<=10; i++){ sum = 2*sum + 2; if(cnt<=sum){ ans = String.valueOf(i); break; } } } } else{ ans = "TOO LARGE"; } System.out.println(ans); } }
Submission Info
Submission Time | |
---|---|
Task | E - 2-SAT |
User | Ricky_pon |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 2643 Byte |
Status | WA |
Exec Time | 1793 ms |
Memory | 227196 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | 93 ms | 19284 KB |
00-sample-10 | AC | 98 ms | 20820 KB |
00-sample-20 | AC | 117 ms | 21764 KB |
10-sat-00 | AC | 244 ms | 42832 KB |
10-sat-01 | AC | 223 ms | 41640 KB |
10-sat-02 | AC | 443 ms | 64764 KB |
10-sat-03 | WA | 308 ms | 44204 KB |
10-sat-04 | WA | 1522 ms | 131384 KB |
10-sat-05 | AC | 382 ms | 61860 KB |
10-sat-06 | WA | 1793 ms | 220564 KB |
10-sat-07 | WA | 1446 ms | 136520 KB |
10-sat-08 | WA | 1151 ms | 220324 KB |
10-sat-09 | WA | 655 ms | 90872 KB |
10-sat-10 | WA | 953 ms | 224088 KB |
10-sat-11 | WA | 675 ms | 108020 KB |
10-sat-12 | WA | 965 ms | 223576 KB |
10-sat-13 | WA | 936 ms | 152748 KB |
10-sat-14 | WA | 892 ms | 225380 KB |
10-sat-15 | WA | 603 ms | 84616 KB |
10-sat-16 | WA | 874 ms | 227196 KB |
10-sat-17 | WA | 281 ms | 73976 KB |
10-sat-18 | WA | 768 ms | 222992 KB |
10-sat-19 | WA | 527 ms | 111656 KB |
10-sat-20 | WA | 699 ms | 216060 KB |
10-sat-21 | WA | 298 ms | 68912 KB |
10-sat-22 | AC | 645 ms | 220844 KB |
10-sat-23 | AC | 413 ms | 78184 KB |
10-sat-24 | AC | 640 ms | 222188 KB |
10-sat-25 | AC | 499 ms | 105100 KB |
10-sat-26 | AC | 656 ms | 220444 KB |
10-sat-27 | AC | 511 ms | 105880 KB |
10-sat-28 | AC | 643 ms | 214472 KB |
10-sat-29 | AC | 399 ms | 77440 KB |
10-sat-30 | AC | 645 ms | 218456 KB |
10-sat-31 | AC | 374 ms | 62732 KB |
10-sat-32 | AC | 632 ms | 222212 KB |
10-sat-33 | AC | 437 ms | 92476 KB |
10-sat-34 | AC | 660 ms | 219516 KB |
10-sat-35 | AC | 271 ms | 75652 KB |
10-sat-36 | AC | 664 ms | 223832 KB |
10-sat-37 | AC | 281 ms | 75848 KB |
10-sat-38 | AC | 653 ms | 218372 KB |
10-sat-39 | AC | 368 ms | 56096 KB |
20-unsat-00 | AC | 721 ms | 222324 KB |
20-unsat-01 | AC | 535 ms | 97332 KB |
20-unsat-02 | AC | 657 ms | 221628 KB |
20-unsat-03 | AC | 304 ms | 106420 KB |
20-unsat-04 | AC | 661 ms | 221872 KB |
20-unsat-05 | AC | 293 ms | 74168 KB |
20-unsat-06 | AC | 667 ms | 221424 KB |
20-unsat-07 | AC | 496 ms | 110556 KB |
20-unsat-08 | AC | 739 ms | 221144 KB |
20-unsat-09 | AC | 457 ms | 111984 KB |