Submission details
Task:Bittipeli
Sender:Pietu1998
Submission time:2015-10-08 15:03:17 +0300
Language:C++
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
#40
Test results
testverdicttimesubtask
#10.14 s1details
#20.05 s1details
#30.14 s1details
#40.15 s1details
#50.14 s1details
#60.15 s1details
#70.15 s1details
#80.14 s1details
#90.14 s1details
#100.15 s1details
#110.14 s1details
#120.15 s1details
#130.13 s1details
#140.15 s1details
#150.14 s1details
#160.15 s1details
#170.14 s1details
#180.16 s1details
#190.14 s1details
#200.07 s1details
#210.12 s2details
#220.14 s2details
#230.14 s2details
#240.06 s2details
#250.15 s2details
#260.13 s2details
#270.14 s2details
#280.05 s2details
#290.15 s2details
#300.05 s2details
#310.14 s2details
#320.14 s2details
#330.14 s2details
#340.14 s2details
#350.14 s2details
#360.13 s2details
#370.13 s2details
#380.15 s2details
#390.14 s2details
#400.12 s2details
#410.13 s3details
#420.14 s3details
#430.16 s3details
#440.14 s3details
#450.05 s3details
#460.13 s3details
#470.14 s3details
#480.06 s3details
#490.13 s3details
#500.16 s3details
#510.14 s3details
#520.15 s3details
#530.14 s3details
#540.06 s3details
#550.14 s3details
#560.14 s3details
#570.12 s3details
#580.13 s3details
#590.14 s3details
#600.14 s3details
#610.14 s4details
#620.14 s4details
#630.13 s4details
#640.14 s4details
#650.15 s4details
#660.13 s4details
#670.14 s4details
#680.14 s4details
#690.14 s4details
#700.14 s4details
#710.13 s4details
#720.16 s4details
#730.14 s4details
#740.14 s4details
#750.14 s4details
#760.14 s4details
#770.14 s4details
#780.13 s4details
#790.14 s4details
#800.15 s4details

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

#define monta 999999999999LL

int main()
{
	cin.sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<pair<int,long long>> v[n+100001];
	for(int i=0;i<m;i++){
		int a,b,h;
		cin>>a>>b>>h;
		v[a].push_back(make_pair(b+100000,h));
		v[a+100000].push_back(make_pair(b,0));
	}
	priority_queue<pair<long long,int>> q;
	bool t[n+100001];
	long long e[n+100001];
	for(int i=1;i<=n+100000;i++){t[i]=0;e[i]=monta;}
	e[1]=0;
	q.push(make_pair(0,1));
	while (!q.empty()) {
		long long x = -q.top().first;
		int s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (unsigned i = 0; i < v[s].size(); i++) {
			int u = v[s][i].first;
			if (x+v[s][i].second < e[u]) {
				e[u] = x+v[s][i].second;
				q.push(make_pair(-e[u],u));
			}
		}
	}
	cout<<min(e[n],e[n+100000])<<endl;
	return 0;
}

Test details

Test 1

Subtask: 1

Verdict:

input
1011001010

correct output
QAQ

user output
(empty)

Test 2

Subtask: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
999999999999

Test 3

Subtask: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
(empty)

Test 4

Subtask: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
(empty)

Test 5

Subtask: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
(empty)

Test 6

Subtask: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
(empty)

Test 7

Subtask: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
(empty)

Test 8

Subtask: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
(empty)

Test 9

Subtask: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
(empty)

Test 10

Subtask: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
(empty)

Test 11

Subtask: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
(empty)

Test 12

Subtask: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
(empty)

Test 13

Subtask: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
(empty)

Test 14

Subtask: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
(empty)

Test 15

Subtask: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

Test 16

Subtask: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
(empty)

Test 17

Subtask: 1

Verdict:

input
1100101011

correct output
QAQ

user output
(empty)

Test 18

Subtask: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
(empty)

Test 19

Subtask: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
(empty)

Test 20

Subtask: 1

Verdict:

input
0000101000

correct output
QAQ

user output
999999999999

Test 21

Subtask: 2

Verdict:

input
1110010100

correct output
QAQ

user output
(empty)

Test 22

Subtask: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
(empty)

Test 23

Subtask: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
(empty)

Test 24

Subtask: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
999999999999

Test 25

Subtask: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
(empty)

Test 26

Subtask: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
(empty)

Test 27

Subtask: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
(empty)

Test 28

Subtask: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
999999999999

Test 29

Subtask: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
(empty)

Test 30

Subtask: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
999999999999

Test 31

Subtask: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
(empty)

Test 32

Subtask: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
(empty)

Test 33

Subtask: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
(empty)

Test 34

Subtask: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
(empty)

Test 35

Subtask: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

Test 36

Subtask: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
(empty)

Test 37

Subtask: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
(empty)

Test 38

Subtask: 2

Verdict:

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
(empty)

Test 39

Subtask: 2

Verdict:

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 40

Subtask: 2

Verdict:

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
(empty)

Test 41

Subtask: 3

Verdict:

input
0010101000

correct output
QAQ

user output
(empty)

Test 42

Subtask: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
(empty)

Test 43

Subtask: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
(empty)

Test 44

Subtask: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
(empty)

Test 45

Subtask: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
999999999999

Test 46

Subtask: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
(empty)

Test 47

Subtask: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
(empty)

Test 48

Subtask: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
999999999999

Test 49

Subtask: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
(empty)

Test 50

Subtask: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
(empty)

Test 51

Subtask: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
(empty)

Test 52

Subtask: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
(empty)

Test 53

Subtask: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
(empty)

Test 54

Subtask: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
999999999999

Test 55

Subtask: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

Test 56

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Subtask: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
(empty)

Test 59

Subtask: 3

Verdict:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 60

Subtask: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
(empty)

Test 61

Subtask: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

Test 62

Subtask: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
(empty)

Test 63

Subtask: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
(empty)

Test 64

Subtask: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
(empty)

Test 65

Subtask: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
(empty)

Test 66

Subtask: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
(empty)

Test 67

Subtask: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
(empty)

Test 68

Subtask: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
(empty)

Test 69

Subtask: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
(empty)

Test 70

Subtask: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
(empty)

Test 71

Subtask: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
(empty)

Test 72

Subtask: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
(empty)

Test 73

Subtask: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
(empty)

Test 74

Subtask: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
(empty)

Test 75

Subtask: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
(empty)

Test 76

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Subtask: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
(empty)

Test 79

Subtask: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 80

Subtask: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
(empty)