CSES - Datatähti 2016 peili

Submission details
Task:	Lennot
Sender:	jokkebk
Submission time:	2015-09-28 19:30:09 +0300
Language:	C++
Status:	READY
Result:	100

Feedback
subtask	verdict	score
#1	ACCEPTED	24
#2	ACCEPTED	37
#3	ACCEPTED	39

Test results
test	verdict	time	subtask
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.06 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.06 s	2	details
#7	ACCEPTED	0.05 s	2	details
#8	ACCEPTED	0.06 s	2	details
#9	ACCEPTED	0.05 s	2	details
#10	ACCEPTED	0.06 s	2	details
#11	ACCEPTED	0.28 s	3	details
#12	ACCEPTED	0.29 s	3	details
#13	ACCEPTED	0.20 s	3	details
#14	ACCEPTED	0.18 s	3	details
#15	ACCEPTED	0.17 s	3	details
#16	ACCEPTED	0.16 s	3	details
#17	ACCEPTED	0.22 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:23:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     S(n); S(m);
         ^
input/code.cpp:23:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     S(n); S(m);
               ^
input/code.cpp:28:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         S(a); S(b); S(h);
             ^
input/code.cpp:28:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         S(a); S(b); S(h);
                   ^
input/code.cpp:28:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         S(a); S(b); S(h);
                         ^

Code

#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
#include <queue>
#include <map>

using namespace std;

#define REP(n) for(__typeof(n) _i=0; _i<(n); ++_i)
#define FOR(i,a,b) for(__typeof(b) i=a; i<b; ++i)
#define FORE(i,a,b) for(__typeof(b) i=a; i<=b; ++i)
#define S(x) scanf("%d", &(x))

typedef long long LL;

#define MAX(a,b) ((a)<(b) ? (b) : (a))

int main() {
    int n, m, a, b, h;
    priority_queue<pair<LL,int>> pq;

    S(n); S(m);

    vector<vector<pair<LL,int>>> to(n*2);

    REP(m) {
        S(a); S(b); S(h);
        to[a-1].push_back(make_pair(h, b-1+n)); // paid a to free b
        to[a-1+n].push_back(make_pair(0, b-1)); // free a to paid b
    }

    pq.push(make_pair(0,0)); // start at node 0

    set<int> seen;

    while(!pq.empty()) {
        auto p = pq.top(); pq.pop();
        LL cost = p.first;
        int node = p.second;

        if(seen.count(node)) continue; // visited
        //if(node<n)
        //    cout << "Paid node " << node+1 << " after " << -cost << endl;
        //else
        //    cout << "Free node " << node+1-n << " after " << -cost << endl;
        seen.insert(node);

        if(node+1 == n || node+1 == 2*n) {
            cout << -cost;
            break;
        }

        for(auto nd : to[node]) {
            //cout << "Can get to " << nd.second+1 << " with " << nd.first << endl;
            pq.push(make_pair(cost-nd.first, nd.second)); // negative to keep order
        }
    }

    return 0;
}

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
`10 20 2 1 3 7 6 4 1 6 7 1 6 1 ...` view save

correct output
`8` view save

user output
`8` view save

Test 2

Subtask: 1

Verdict: ACCEPTED

input
`10 20 4 3 10 1 10 9 3 4 10 2 6 7 ...` view save

correct output
`9` view save

user output
`9` view save

Test 3

Subtask: 1

Verdict: ACCEPTED

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

correct output
`8` view save

user output
`8` view save

Test 4

Subtask: 1

Verdict: ACCEPTED

input
`10 20 1 6 2 5 3 3 7 3 6 5 6 2 ...` view save

correct output
`13` view save

user output
`13` view save

Test 5

Subtask: 1

Verdict: ACCEPTED

input
`10 20 10 8 5 2 4 7 9 4 7 9 4 1 ...` view save

correct output
`4` view save

user output
`4` view save

Test 6

Subtask: 2

Verdict: ACCEPTED

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

correct output
`11893353673` view save

user output
`11893353673` view save

Test 7

Subtask: 2

Verdict: ACCEPTED

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

correct output
`30248963445` view save

user output
`30248963445` view save

Test 8

Subtask: 2

Verdict: ACCEPTED

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

correct output
`3126797692` view save

user output
`3126797692` view save

Test 9

Subtask: 2

Verdict: ACCEPTED

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

correct output
`18416073173` view save

user output
`18416073173` view save

Test 10

Subtask: 2

Verdict: ACCEPTED

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

correct output
`6399349335` view save

user output
`6399349335` view save

Test 11

Subtask: 3

Verdict: ACCEPTED

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

correct output
`518249578675` view save

user output
`518249578675` view save

Test 12

Subtask: 3

Verdict: ACCEPTED

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

correct output
`920862321580` view save

user output
`920862321580` view save

Test 13

Subtask: 3

Verdict: ACCEPTED

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

correct output
`399407698440` view save

user output
`399407698440` view save

Test 14

Subtask: 3

Verdict: ACCEPTED

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

correct output
`165235287505` view save

user output
`165235287505` view save

Test 15

Subtask: 3

Verdict: ACCEPTED

input
`99993 199980 1 3 1 3 2 1 1 4 1 4 2 1 ...` view save

correct output
`2` view save

user output
`2` view save

Test 16

Subtask: 3

Verdict: ACCEPTED

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

correct output
`1124960` view save

user output
`1124960` view save

Test 17

Subtask: 3

Verdict: ACCEPTED

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

correct output
`110298` view save

user output
`110298` view save

Datatähti 2016 peili

Lennot

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (jokkebk)