oj.uz

Submission #31247

# Submission time Handle Problem Language Result Execution time Memory
31247 2017-08-16T06:01:03 Z nibnalin Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 5972 KB 
#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 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

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 3 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
14.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 19 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 19 ms 3332 KB Output is correct
27 Correct 19 ms 3332 KB Output is correct
28 Correct 0 ms 3332 KB Output is correct
29 Correct 3 ms 3332 KB Output is correct
30 Correct 0 ms 3332 KB Output is correct
31 Correct 0 ms 3332 KB Output is correct
32 Correct 3 ms 3332 KB Output is correct
33 Correct 9 ms 3464 KB Output is correct
34 Correct 6 ms 3464 KB Output is correct

Subtask #4
21.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 19 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 3 ms 3332 KB Output is correct
26 Correct 16 ms 3332 KB Output is correct
27 Correct 16 ms 3332 KB Output is correct
28 Correct 0 ms 3332 KB Output is correct
29 Correct 6 ms 3332 KB Output is correct
30 Correct 3 ms 3332 KB Output is correct
31 Correct 3 ms 3332 KB Output is correct
32 Correct 0 ms 3332 KB Output is correct
33 Correct 6 ms 3464 KB Output is correct
34 Correct 6 ms 3464 KB Output is correct
35 Correct 19 ms 4388 KB Output is correct
36 Correct 6 ms 3332 KB Output is correct
37 Correct 26 ms 4124 KB Output is correct
38 Correct 29 ms 4784 KB Output is correct
39 Correct 43 ms 4784 KB Output is correct
40 Correct 26 ms 4652 KB Output is correct
41 Correct 29 ms 4652 KB Output is correct
42 Correct 333 ms 5260 KB Output is correct
43 Correct 293 ms 5260 KB Output is correct
44 Correct 279 ms 5160 KB Output is correct
45 Correct 19 ms 5312 KB Output is correct
46 Correct 23 ms 5312 KB Output is correct

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 3 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 19 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 19 ms 3332 KB Output is correct
27 Correct 16 ms 3332 KB Output is correct
28 Correct 0 ms 3332 KB Output is correct
29 Correct 3 ms 3332 KB Output is correct
30 Correct 0 ms 3332 KB Output is correct
31 Correct 3 ms 3332 KB Output is correct
32 Correct 0 ms 3332 KB Output is correct
33 Correct 3 ms 3464 KB Output is correct
34 Correct 3 ms 3464 KB Output is correct
35 Correct 23 ms 4388 KB Output is correct
36 Correct 3 ms 3332 KB Output is correct
37 Correct 19 ms 4124 KB Output is correct
38 Correct 23 ms 4784 KB Output is correct
39 Correct 26 ms 4784 KB Output is correct
40 Correct 39 ms 4652 KB Output is correct
41 Correct 26 ms 4652 KB Output is correct
42 Correct 299 ms 5260 KB Output is correct
43 Correct 306 ms 5260 KB Output is correct
44 Correct 306 ms 5160 KB Output is correct
45 Correct 29 ms 5312 KB Output is correct
46 Correct 23 ms 5312 KB Output is correct
47 Correct 56 ms 4388 KB Output is correct
48 Correct 9 ms 3728 KB Output is correct
49 Correct 3 ms 3728 KB Output is correct
50 Correct 6 ms 3596 KB Output is correct
51 Correct 93 ms 5708 KB Output is correct
52 Correct 83 ms 5312 KB Output is correct
53 Correct 46 ms 5444 KB Output is correct
54 Correct 6 ms 4124 KB Output is correct
55 Correct 6 ms 4124 KB Output is correct
56 Execution timed out 1000 ms 5972 KB Execution timed out
57 Halted 0 ms 0 KB -