CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:Maunuliini
Submission time:2015-10-11 23:29:09
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.17 s1details
#20.18 s1details
#3ACCEPTED0.18 s1details
#4ACCEPTED0.18 s1details
#5ACCEPTED0.19 s1details
#60.21 s2details
#70.24 s2details
#80.22 s2details
#90.21 s2details
#100.23 s2details
#110.65 s3details
#120.72 s3details
#130.60 s3details
#140.58 s3details
#15ACCEPTED0.67 s3details
#16ACCEPTED0.63 s3details
#170.81 s3details

Code

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */


/**
 *
 * @author alexey
 */import java.util.*;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.StringTokenizer;
public class Datis {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        IO io =new IO();
        
        int city=io.nextInt();
        int connect=io.nextInt();
        int[][] cities = new int[city+1][2];
        int i=1;
       
      
      ArrayList<ArrayList<int[]>> connections= new  ArrayList<ArrayList<int[]>>();
      connections.add(new ArrayList());
      Comparator<int[]> comparator = new comp();
      PriorityQueue<int[]> queue = 
            new PriorityQueue<int[]>(connect, comparator);
        for (int j = 0; j < city; j++) {
            connections.add(new ArrayList<int[]>());
        }
        
        for (int j = 0; j < connect; j++) {
            int a=io.nextInt();
            int b=io.nextInt();
            int c=io.nextInt();
            int[] d =new int[3];
            d[0]=b;
            d[1]=c;
            d[2]=a;
            connections.get(a).add(d);
        }
        
        for(int[] x :connections.get(1)){
                    
                    queue.add(x);
                }
        while(!queue.isEmpty()){
            int[] a= queue.poll();
            if(cities[a[0]][0]==0){
                cities[a[0]][0]+=a[1];
                cities[a[0]][1]=1-cities[a[2]][1];
                for(int[] x :connections.get(a[0])){
                    x[1]=cities[a[0]][0]+cities[a[2]][1]*x[1];
                    queue.add(x);
                }
            }
        }
        
        io.print(cities[city][0]);
        io.close();
     
    }
    
    public static class comp implements Comparator<int[]>{

        @Override
        public int compare(int[] t, int[] t1) {
            if(t[1]>t1[1]){
                return 1;
            } 
            if(t[1]<t1[1]){
                return -1;
            }  
            return 0;
        }
        
        
    }
    
    
     static class IO extends PrintWriter {
	private BufferedReader r;
	private StringTokenizer s;
	
	public IO() {
		super(new BufferedOutputStream(System.out));
		r = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextLine() {
		String s = null;
		try {
			s = r.readLine();
		} catch (Exception e) {}
		if(s == null) throw new NoSuchElementException();
		return s;
	}
	
	public String next() {
		while (s == null || !s.hasMoreElements()) {
			s = new StringTokenizer(nextLine());
		}
		return s.nextToken();
	}
        public int nextInt() {
		return Integer.parseInt(next());
	}
}
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 20
2 1 3
7 6 4
1 6 7
1 6 1
...

correct output
8

user output
8

Test 2

Group: 1

Verdict:

input
10 20
4 3 10
1 10 9
3 4 10
2 6 7
...

correct output
9

user output
10

Test 3

Group: 1

Verdict: ACCEPTED

input
10 20
5 7 4
6 1 1
7 3 8
8 4 2
...

correct output
8

user output
8

Test 4

Group: 1

Verdict: ACCEPTED

input
10 20
1 6 2
5 3 3
7 3 6
5 6 2
...

correct output
13

user output
13

Test 5

Group: 1

Verdict: ACCEPTED

input
10 20
10 8 5
2 4 7
9 4 7
9 4 1
...

correct output
4

user output
4

Test 6

Group: 2

Verdict:

input
1000 2000
91 828 365044406
17 984 445675537
251 852 100987451
907 487 58830088
...

correct output
11893353673

user output
219389397

Test 7

Group: 2

Verdict:

input
1000 2000
722 939 530579090
404 606 268877348
133 750 760086153
506 46 582310443
...

correct output
30248963445

user output
-1321444318

Test 8

Group: 2

Verdict:

input
1000 2000
340 237 43690066
217 141 453160975
744 202 639037814
605 926 404985542
...

correct output
3126797692

user output
379367556

Test 9

Group: 2

Verdict:

input
1000 2000
88 312 190442306
480 402 411574469
29 901 397491243
636 459 323246996
...

correct output
18416073173

user output
599077770

Test 10

Group: 2

Verdict:

input
1000 2000
333 228 718389176
796 286 323493090
743 43 751876815
128 554 175625940
...

correct output
6399349335

user output
-443424117

Test 11

Group: 3

Verdict:

input
100000 200000
28264 92686 186865663
92570 33956 925976418
87377 71249 644757113
16701 81203 922125505
...

correct output
518249578675

user output
-402731144

Test 12

Group: 3

Verdict:

input
100000 200000
95740 71482 846654568
44131 16806 670712211
3967 49254 424174139
39369 53007 830346557
...

correct output
920862321580

user output
645860542

Test 13

Group: 3

Verdict:

input
100000 200000
79947 25489 71554257
59184 25577 328436360
82945 73554 4942918
22380 92385 874250042
...

correct output
399407698440

user output
-547434504

Test 14

Group: 3

Verdict:

input
100000 200000
31139 12960 580545990
27744 95556 747296719
46969 42578 840321561
5638 28960 513805324
...

correct output
165235287505

user output
720499614

Test 15

Group: 3

Verdict: ACCEPTED

input
99993 199980
1 3 1
3 2 1
1 4 1
4 2 1
...

correct output
2

user output
2

Test 16

Group: 3

Verdict: ACCEPTED

input
100000 149994
93867 98509 1755709
85029 99843 1347591
10305 35305 6447
75638 80585 1829972
...

correct output
1124960

user output
1124960

Test 17

Group: 3

Verdict:

input
100000 200000
70413 71496 49
15963 40963 18635
81291 89420 1850028
8848 33848 17316
...

correct output
110298

user output
138301