# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318735 | KWang31 | Travelling Salesperson (CCO20_day2problem1) | Java | 4587 ms | 222480 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import java.io.*; import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int N=Integer.parseInt(br.readLine());
boolean[][] adj=new boolean[N][N];
for (int i = 1; i < N; i++) {
String s=br.readLine();
for (int j = 0; j <i; j++) {
if(s.charAt(j)=='R'){
adj[i][j]=true; adj[j][i]=true;
}
}
}
boolean[] c=new boolean[N];//Tracks color of first edge, red=true
Deque<Integer> [][] dq=new Deque[N][2];//Tracks first part (same color as first edge)
int[] rev2=new int [N];//Tracks whether dq[1] is first or dq[0] is first
for (int i = 0; i < N; i++) {
dq[i][0]=new ArrayDeque<>(); dq[i][1]=new ArrayDeque<>();
dq[i][0].add(i);//Prevents empty stuff
}
if(adj[0][1]){
c[0]=true; c[1]=true;
}
dq[0][0].addLast(1); dq[1][0].addLast(0);
int k;
for (int i = 2; i < N; i++) {
/*
if(i==5){
for (int j = 0; j < i; j++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |