oj.uz

Submission #42146

# Submission time Handle Problem Language Result Execution time Memory
42146 2018-02-22T19:17:13 Z XmtosX Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 4856 KB 
#include <bits/stdc++.h>
using namespace std;
short int n,p[30004],b[30004],m;
priority_queue <pair<short int,short int> ,vector <pair<short int,short int> >,greater <pair<short int,short int> > > pq;
bool vis[30004];
vector <int> v[30004];
set<int> s[30005];
set <int>::iterator it;
short int cur[30004];
void dij()
{
    for (int i=0;i<n;i++)
        cur[i]=32000;
    cur[b[0]]=0;
    pq.push({0,b[0]});
    while (!pq.empty())
    {
        short int x= (pq.top()).second;
        short int y= (pq.top()).first;
        pq.pop();
        if (vis[x])
            continue;
        vis[x]=true;
        if (x==b[1])
            return;
        for (short int i=0;i<v[x].size();i++)
        {
            for (int j=1;j*v[x][i]+x<n||(x-j*v[x][i])>=0;j++)
            {
                int a= (j*v[x][i]+x);
                if (a<n)
                {
                    if (!vis[a]&&cur[a]>y+j&&!v[a].empty())
                    {
                        cur[a]=y+j;
                        pq.push({cur[a],a});
                    }
                }
                a= (x-j*v[x][i]);
                if (a>=0)
                {
                    if (!vis[a]&&cur[a]>y+j&&!v[a].empty())
                    {
                        cur[a]=y+j;
                        pq.push({cur[a],a});
                    }
                }
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >>n>>m;
    for (int i=0;i<m;i++)
    {
        cin >>b[i]>>p[i];
        s[b[i]].insert(p[i]);
    }
    for (int i=0;i<n;i++)
    {
        while (!s[i].empty())
        {
            v[i].push_back(*s[i].begin());
            s[i].erase(s[i].begin());
        }
    }
    dij();
    if (!vis[b[1]])
        cout <<-1;
    else
        cout <<cur[b[1]];
    return 0;
}

Compilation message

skyscraper.cpp: In function 'void dij()':
skyscraper.cpp:26:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (short int i=0;i<v[x].size();i++)
                             ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2428 KB Output is correct
2 Correct 3 ms 2528 KB Output is correct
3 Correct 3 ms 2528 KB Output is correct
4 Correct 3 ms 2528 KB Output is correct
5 Correct 3 ms 2528 KB Output is correct
6 Correct 3 ms 2616 KB Output is correct
7 Correct 3 ms 2616 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2776 KB Output is correct
2 Correct 3 ms 2776 KB Output is correct
3 Correct 3 ms 2776 KB Output is correct
4 Correct 3 ms 2776 KB Output is correct
5 Correct 3 ms 2776 KB Output is correct
6 Correct 4 ms 2776 KB Output is correct
7 Correct 3 ms 2776 KB Output is correct
8 Correct 4 ms 2776 KB Output is correct
9 Correct 4 ms 2776 KB Output is correct
10 Correct 3 ms 2776 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 4 ms 2796 KB Output is correct
14 Correct 4 ms 2824 KB Output is correct
15 Correct 4 ms 2824 KB Output is correct
16 Correct 3 ms 2824 KB Output is correct
17 Correct 4 ms 2824 KB Output is correct
18 Correct 4 ms 2824 KB Output is correct
19 Correct 3 ms 2824 KB Output is correct
20 Correct 11 ms 2824 KB Output is correct
21 Correct 3 ms 2824 KB Output is correct
22 Correct 3 ms 2824 KB Output is correct
23 Correct 4 ms 2824 KB Output is correct
24 Correct 4 ms 2824 KB Output is correct
25 Correct 4 ms 2832 KB Output is correct
26 Correct 3 ms 2832 KB Output is correct
27 Correct 3 ms 2832 KB Output is correct
28 Correct 4 ms 2832 KB Output is correct
29 Correct 4 ms 2832 KB Output is correct
30 Correct 3 ms 2832 KB Output is correct
31 Correct 3 ms 2832 KB Output is correct
32 Correct 4 ms 2832 KB Output is correct
33 Correct 4 ms 2832 KB Output is correct
34 Correct 4 ms 2832 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2832 KB Output is correct
2 Correct 3 ms 2832 KB Output is correct
3 Correct 3 ms 2832 KB Output is correct
4 Correct 3 ms 2832 KB Output is correct
5 Correct 3 ms 2832 KB Output is correct
6 Correct 3 ms 2832 KB Output is correct
7 Correct 3 ms 2832 KB Output is correct
8 Correct 5 ms 2832 KB Output is correct
9 Correct 4 ms 2832 KB Output is correct
10 Correct 3 ms 2832 KB Output is correct
11 Correct 4 ms 2832 KB Output is correct
12 Correct 4 ms 2832 KB Output is correct
13 Correct 4 ms 2832 KB Output is correct
14 Correct 5 ms 2832 KB Output is correct
15 Correct 4 ms 2832 KB Output is correct
16 Correct 3 ms 2832 KB Output is correct
17 Correct 4 ms 2832 KB Output is correct
18 Correct 4 ms 2832 KB Output is correct
19 Correct 3 ms 2832 KB Output is correct
20 Correct 11 ms 2832 KB Output is correct
21 Correct 3 ms 2832 KB Output is correct
22 Correct 3 ms 2832 KB Output is correct
23 Correct 3 ms 2832 KB Output is correct
24 Correct 4 ms 2832 KB Output is correct
25 Correct 4 ms 2832 KB Output is correct
26 Correct 3 ms 2832 KB Output is correct
27 Correct 4 ms 2832 KB Output is correct
28 Correct 4 ms 2832 KB Output is correct
29 Correct 4 ms 2848 KB Output is correct
30 Correct 3 ms 2848 KB Output is correct
31 Correct 3 ms 2848 KB Output is correct
32 Correct 3 ms 2848 KB Output is correct
33 Correct 4 ms 2848 KB Output is correct
34 Correct 4 ms 2848 KB Output is correct
35 Correct 18 ms 4132 KB Output is correct
36 Correct 5 ms 4132 KB Output is correct
37 Correct 13 ms 4132 KB Output is correct
38 Correct 18 ms 4332 KB Output is correct
39 Correct 17 ms 4332 KB Output is correct
40 Correct 19 ms 4332 KB Output is correct
41 Correct 18 ms 4332 KB Output is correct
42 Correct 8 ms 4332 KB Output is correct
43 Correct 9 ms 4332 KB Output is correct
44 Correct 14 ms 4332 KB Output is correct
45 Correct 21 ms 4460 KB Output is correct
46 Correct 20 ms 4460 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 4 ms 4460 KB Output is correct
3 Correct 3 ms 4460 KB Output is correct
4 Correct 3 ms 4460 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 3 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct
8 Correct 3 ms 4460 KB Output is correct
9 Correct 3 ms 4460 KB Output is correct
10 Correct 3 ms 4460 KB Output is correct
11 Correct 4 ms 4460 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 3 ms 4460 KB Output is correct
14 Correct 4 ms 4460 KB Output is correct
15 Correct 4 ms 4460 KB Output is correct
16 Correct 3 ms 4460 KB Output is correct
17 Correct 4 ms 4460 KB Output is correct
18 Correct 3 ms 4460 KB Output is correct
19 Correct 4 ms 4460 KB Output is correct
20 Correct 11 ms 4460 KB Output is correct
21 Correct 5 ms 4460 KB Output is correct
22 Correct 4 ms 4460 KB Output is correct
23 Correct 4 ms 4460 KB Output is correct
24 Correct 4 ms 4460 KB Output is correct
25 Correct 4 ms 4460 KB Output is correct
26 Correct 3 ms 4460 KB Output is correct
27 Correct 3 ms 4460 KB Output is correct
28 Correct 4 ms 4460 KB Output is correct
29 Correct 4 ms 4460 KB Output is correct
30 Correct 4 ms 4460 KB Output is correct
31 Correct 4 ms 4460 KB Output is correct
32 Correct 4 ms 4460 KB Output is correct
33 Correct 4 ms 4460 KB Output is correct
34 Correct 4 ms 4460 KB Output is correct
35 Correct 16 ms 4460 KB Output is correct
36 Correct 5 ms 4460 KB Output is correct
37 Correct 14 ms 4460 KB Output is correct
38 Correct 19 ms 4460 KB Output is correct
39 Correct 18 ms 4460 KB Output is correct
40 Correct 18 ms 4460 KB Output is correct
41 Correct 20 ms 4460 KB Output is correct
42 Correct 8 ms 4460 KB Output is correct
43 Correct 9 ms 4460 KB Output is correct
44 Correct 16 ms 4460 KB Output is correct
45 Correct 25 ms 4460 KB Output is correct
46 Correct 23 ms 4460 KB Output is correct
47 Correct 26 ms 4460 KB Output is correct
48 Correct 15 ms 4460 KB Output is correct
49 Correct 19 ms 4460 KB Output is correct
50 Correct 11 ms 4460 KB Output is correct
51 Correct 27 ms 4716 KB Output is correct
52 Correct 29 ms 4716 KB Output is correct
53 Correct 20 ms 4716 KB Output is correct
54 Correct 4 ms 4716 KB Output is correct
55 Correct 4 ms 4716 KB Output is correct
56 Execution timed out 1077 ms 4856 KB Time limit exceeded
57 Halted 0 ms 0 KB -