CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:Ollie
Submission time:2015-10-03 18:01:25
Language:C++
Status:READY
Result:76
Feedback
groupverdictscore
#10
#2ACCEPTED37
#3ACCEPTED39
Test results
testverdicttimegroup
#10.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.06 s2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.07 s2details
#11ACCEPTED0.15 s3details
#12ACCEPTED0.16 s3details
#13ACCEPTED0.15 s3details
#14ACCEPTED0.14 s3details
#15ACCEPTED0.11 s3details
#16ACCEPTED0.11 s3details
#17ACCEPTED0.16 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:70:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v[s].size(); i++) {
                           ^

Code

#include <bits/stdc++.h>

#define _ ios_base::sync_with_stdio(0);cin.tie();
#define mp make_pair
#define pb push_back

#define ll long long
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

#define INF 9223372036854775807LL
#define N 200000

using namespace std;

struct node {
public:
    ll dist;
    int id;
    int fid;

    bool operator<(const node& a) const {
        return dist > a.dist;
    }

    node(ll dist, int id, int fid) {
        this->dist = dist;
        this->id = id;
        this->fid = fid;
    }
};

vector<pair<int,ll>> v[N+1];
priority_queue<node> q;

ll e[N+1][2];
ll t[N+1][2];

int main() { _
    int n,m;
    cin >> n >> m;

    for(int i=0;i<m;i++) {
        int a,b,h;
        cin >> a >> b >> h;
        v[a].pb(mp(b,h));
    }

    int a=1;
    for (int i=1;i<=n;i++) {
        e[i][0] = INF;
        e[i][1] = INF;
    }

    e[a][0] = 0;
    e[a][1] = 0;
    q.push(node(0,a,1));

    while (!q.empty()) {
        ll x = q.top().dist;
        int s = q.top().id;
        int fid = q.top().fid;

        q.pop();

        if (t[s][fid%2]) continue;
        t[s][fid%2] = 1;

        for (int i = 0; i < v[s].size(); i++) {
            int u = v[s][i].first;
            ll cost = v[s][i].second;
            if(fid%2 == 0) cost = 0;

            if (x+cost < e[u][fid%2]) {
                e[u][fid%2] = x+cost;
                q.push(node(x+cost,u,fid+1));
            }
        }

    }

    cout << min(e[n][0], e[n][1]) << endl;

    return 0;
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
8

user output
10

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
9

user output
9

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: ACCEPTED

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

correct output
11893353673

user output
11893353673

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
30248963445

user output
30248963445

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
3126797692

user output
3126797692

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
18416073173

user output
18416073173

Test 10

Group: 2

Verdict: ACCEPTED

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

correct output
6399349335

user output
6399349335

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
518249578675

user output
518249578675

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
920862321580

user output
920862321580

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
399407698440

user output
399407698440

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
165235287505

user output
165235287505

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: ACCEPTED

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

correct output
110298

user output
110298