Submission #31246

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
31246	2017-08-16T05:58:04 Z	nibnalin	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	22 / 100	33 ms	3464 KB

skyscraper

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;

const int inf = int(1e9)+5, maxn = int(3e4)+5;

int B[maxn], P[maxn], D[maxn][2];
vector<int> doge[maxn];

// 0 => doge
// 1 => skyscraper

bool go(int x, int y)
{
    return binary_search(doge[y].begin(), doge[y].end(), P[x]);
}

int main(void)
{
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 0;i < m;i++)
    {
        scanf("%d%d", &B[i], &P[i]), D[i][0] = inf;
        doge[B[i]].push_back(i);
    }
    for(int i = 0;i < n;i++) sort(doge[i].begin(), doge[i].end()), D[i][1] = inf;

    set<pair<int, pair<int, int>>> Q;
    D[0][0] = 0;
    Q.insert({0, {0, 0}});

    while(!Q.empty())
    {
        pair<int, pair<int, int>> top = *Q.begin();
        Q.erase(Q.begin());
        //cout << top.second << "\n";

        if(top.second.second)
        {
            for(auto it: doge[top.second.first])
            {
                if(top.first < D[it][0])
                {
                    if(D[it][0] != inf) Q.erase({D[it][0], {it, 0}});
                    D[it][0] = top.first;
                    Q.insert({D[it][0], {it, 0}});
                }
            }
        }
        else
        {
            for(int i = B[top.second.first];i < n;i += P[top.second.first])
            {
                int c = top.first+(abs(i-B[top.second.first])/P[top.second.first]);
                if(c < D[i][1])
                {
                    if(D[i][1] != inf) Q.erase({D[i][1], {i, 1}});
                    D[i][1] = c;
                    Q.insert({D[i][1], {i, 1}});
                }

                if(go(top.second.first, i)) break;
            }

            for(int i = B[top.second.first];i >= 0;i -= P[top.second.first])
            {
                int c = top.first+(abs(i-B[top.second.first])/P[top.second.first]);
                if(c < D[i][1])
                {
                    if(D[i][1] != inf) Q.erase({D[i][1], {i, 1}});
                    D[i][1] = c;
                    Q.insert({D[i][1], {i, 1}});
                }

                if(go(top.second.first, i)) break;
            }
        }
    }

    printf("%d\n", (D[1][0] >= inf)?-1:D[1][0]);
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:25:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^
skyscraper.cpp:28:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &B[i], &P[i]), D[i][0] = inf;
                                                   ^

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	3200 KB	Output is correct
2	Correct	3200 KB	Output is correct
3	Correct	3200 KB	Output is correct
4	Correct	3200 KB	Output is correct
5	Correct	3200 KB	Output is correct
6	Correct	3200 KB	Output is correct
7	Correct	3200 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3200 KB	Output is correct
2	Correct	0 ms	3200 KB	Output is correct
3	Correct	0 ms	3200 KB	Output is correct
4	Correct	0 ms	3200 KB	Output is correct
5	Correct	0 ms	3200 KB	Output is correct
6	Correct	0 ms	3200 KB	Output is correct
7	Correct	0 ms	3200 KB	Output is correct
8	Correct	0 ms	3200 KB	Output is correct
9	Correct	0 ms	3200 KB	Output is correct
10	Correct	0 ms	3200 KB	Output is correct
11	Correct	0 ms	3332 KB	Output is correct
12	Correct	0 ms	3332 KB	Output is correct
13	Correct	3 ms	3332 KB	Output is correct
14	Correct	0 ms	3332 KB	Output is correct
15	Correct	0 ms	3332 KB	Output is correct

Subtask #3
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3200 KB	Output is correct
2	Correct	0 ms	3200 KB	Output is correct
3	Correct	0 ms	3200 KB	Output is correct
4	Correct	0 ms	3200 KB	Output is correct
5	Correct	0 ms	3200 KB	Output is correct
6	Correct	0 ms	3200 KB	Output is correct
7	Correct	0 ms	3200 KB	Output is correct
8	Correct	0 ms	3200 KB	Output is correct
9	Correct	0 ms	3200 KB	Output is correct
10	Correct	0 ms	3200 KB	Output is correct
11	Correct	0 ms	3332 KB	Output is correct
12	Correct	0 ms	3332 KB	Output is correct
13	Correct	3 ms	3332 KB	Output is correct
14	Correct	0 ms	3332 KB	Output is correct
15	Correct	0 ms	3332 KB	Output is correct
16	Correct	0 ms	3200 KB	Output is correct
17	Correct	0 ms	3332 KB	Output is correct
18	Correct	0 ms	3200 KB	Output is correct
19	Correct	0 ms	3200 KB	Output is correct
20	Correct	33 ms	3464 KB	Output is correct
21	Correct	0 ms	3200 KB	Output is correct
22	Correct	0 ms	3200 KB	Output is correct
23	Correct	0 ms	3332 KB	Output is correct
24	Correct	3 ms	3332 KB	Output is correct
25	Correct	0 ms	3332 KB	Output is correct
26	Correct	26 ms	3332 KB	Output is correct
27	Correct	0 ms	3332 KB	Output is correct
28	Incorrect	0 ms	3332 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3200 KB	Output is correct
2	Correct	0 ms	3200 KB	Output is correct
3	Correct	0 ms	3200 KB	Output is correct
4	Correct	0 ms	3200 KB	Output is correct
5	Correct	0 ms	3200 KB	Output is correct
6	Correct	0 ms	3200 KB	Output is correct
7	Correct	0 ms	3200 KB	Output is correct
8	Correct	0 ms	3200 KB	Output is correct
9	Correct	0 ms	3200 KB	Output is correct
10	Correct	0 ms	3200 KB	Output is correct
11	Correct	0 ms	3332 KB	Output is correct
12	Correct	0 ms	3332 KB	Output is correct
13	Correct	3 ms	3332 KB	Output is correct
14	Correct	0 ms	3332 KB	Output is correct
15	Correct	0 ms	3332 KB	Output is correct
16	Correct	0 ms	3200 KB	Output is correct
17	Correct	0 ms	3332 KB	Output is correct
18	Correct	0 ms	3200 KB	Output is correct
19	Correct	0 ms	3200 KB	Output is correct
20	Correct	29 ms	3464 KB	Output is correct
21	Correct	0 ms	3200 KB	Output is correct
22	Correct	0 ms	3200 KB	Output is correct
23	Correct	0 ms	3332 KB	Output is correct
24	Correct	0 ms	3332 KB	Output is correct
25	Correct	0 ms	3332 KB	Output is correct
26	Correct	29 ms	3332 KB	Output is correct
27	Correct	0 ms	3332 KB	Output is correct
28	Incorrect	0 ms	3332 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3200 KB	Output is correct
2	Correct	0 ms	3200 KB	Output is correct
3	Correct	0 ms	3200 KB	Output is correct
4	Correct	0 ms	3200 KB	Output is correct
5	Correct	0 ms	3200 KB	Output is correct
6	Correct	0 ms	3200 KB	Output is correct
7	Correct	0 ms	3200 KB	Output is correct
8	Correct	0 ms	3200 KB	Output is correct
9	Correct	0 ms	3200 KB	Output is correct
10	Correct	0 ms	3200 KB	Output is correct
11	Correct	0 ms	3332 KB	Output is correct
12	Correct	0 ms	3332 KB	Output is correct
13	Correct	0 ms	3332 KB	Output is correct
14	Correct	0 ms	3332 KB	Output is correct
15	Correct	0 ms	3332 KB	Output is correct
16	Correct	0 ms	3200 KB	Output is correct
17	Correct	0 ms	3332 KB	Output is correct
18	Correct	0 ms	3200 KB	Output is correct
19	Correct	0 ms	3200 KB	Output is correct
20	Correct	33 ms	3464 KB	Output is correct
21	Correct	0 ms	3200 KB	Output is correct
22	Correct	0 ms	3200 KB	Output is correct
23	Correct	0 ms	3332 KB	Output is correct
24	Correct	0 ms	3332 KB	Output is correct
25	Correct	0 ms	3332 KB	Output is correct
26	Correct	29 ms	3332 KB	Output is correct
27	Correct	0 ms	3332 KB	Output is correct
28	Incorrect	0 ms	3332 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Submission #31246

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 14.0

Subtask #4 0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 14.0

Subtask #4
0 / 21.0

Subtask #5
0 / 43.0