oj.uz

답안 #1109798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109798 2024-11-07T15:36:51 Z simona1230 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 435 ms 262144 KB 
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

struct edge
{
    int x,d;
    edge(){}
    edge(int _x,int _d)
    {
        x=_x;
        d=_d;
    }

    bool operator<(const edge&e)const
    {
        return e.d<d;
    }
};

int n,m;
vector<edge> v[32001];
void read()
{
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        for(int j=x;j<n;j+=y)
        {
            //cout<<i<<" "<<j+m<<endl;
            v[i].push_back({j+m,(j-x)/y});
        }

        for(int j=x-y;j>=0;j-=y)
        {
            //cout<<i<<" "<<j+m<<endl;
            v[i].push_back({j+m,(x-j)/y});
        }

        //cout<<x+m<<" "<<i<<endl;
        v[x+m].push_back({i,0});
    }
}

int d[32001];
priority_queue<edge> q;
void dijkstra()
{
    for(int i=0;i<=n+m;i++)
        d[i]=1e9;

    d[0]=0;
    q.push({0,0});
    while(q.size())
    {
        edge e=q.top();
        //cout<<e.x<<endl;
        q.pop();

        if(d[e.x]>=e.d)
        {
            for(int i=0;i<v[e.x].size();i++)
            {
                edge nb=v[e.x][i];
                if(nb.d+e.d<d[nb.x])
                {
                    d[nb.x]=nb.d+e.d;
                    q.push({nb.x,d[nb.x]});
                }
            }
        }
    }
}

int main()
{
    read();
    dijkstra();
    if(d[1]==1e9)d[1]=-1;
    cout<<d[1]<<endl;
    return 0;
}

Compilation message

skyscraper.cpp: In function 'void dijkstra()':
skyscraper.cpp:64:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             for(int i=0;i<v[e.x].size();i++)
      |                         ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1104 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 2 ms 1276 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1104 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct
8 Correct 1 ms 1104 KB Output is correct
9 Correct 1 ms 1104 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 2 ms 1360 KB Output is correct
12 Correct 8 ms 3152 KB Output is correct
13 Correct 6 ms 3068 KB Output is correct
14 Correct 3 ms 1104 KB Output is correct
15 Correct 2 ms 1104 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1104 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct
8 Correct 1 ms 1104 KB Output is correct
9 Correct 1 ms 1104 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 3 ms 1360 KB Output is correct
12 Correct 5 ms 3092 KB Output is correct
13 Correct 5 ms 3152 KB Output is correct
14 Correct 3 ms 1104 KB Output is correct
15 Correct 2 ms 1104 KB Output is correct
16 Correct 2 ms 1104 KB Output is correct
17 Correct 3 ms 1464 KB Output is correct
18 Correct 3 ms 1104 KB Output is correct
19 Correct 2 ms 1204 KB Output is correct
20 Correct 57 ms 33380 KB Output is correct
21 Correct 2 ms 1208 KB Output is correct
22 Correct 1 ms 1104 KB Output is correct
23 Correct 2 ms 1104 KB Output is correct
24 Correct 3 ms 1360 KB Output is correct
25 Correct 3 ms 1360 KB Output is correct
26 Correct 65 ms 30112 KB Output is correct
27 Correct 65 ms 28520 KB Output is correct
28 Correct 3 ms 1360 KB Output is correct
29 Correct 4 ms 1872 KB Output is correct
30 Correct 2 ms 1360 KB Output is correct
31 Correct 3 ms 1616 KB Output is correct
32 Correct 3 ms 1496 KB Output is correct
33 Correct 8 ms 2640 KB Output is correct
34 Correct 7 ms 2640 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1104 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 2 ms 1104 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct
8 Correct 1 ms 1104 KB Output is correct
9 Correct 1 ms 1104 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 3 ms 1360 KB Output is correct
12 Correct 5 ms 3152 KB Output is correct
13 Correct 7 ms 3152 KB Output is correct
14 Correct 3 ms 1360 KB Output is correct
15 Correct 2 ms 1104 KB Output is correct
16 Correct 2 ms 1104 KB Output is correct
17 Correct 3 ms 1360 KB Output is correct
18 Correct 2 ms 1208 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Correct 60 ms 33176 KB Output is correct
21 Correct 2 ms 1104 KB Output is correct
22 Correct 2 ms 1104 KB Output is correct
23 Correct 2 ms 1104 KB Output is correct
24 Correct 3 ms 1360 KB Output is correct
25 Correct 3 ms 1360 KB Output is correct
26 Correct 63 ms 30288 KB Output is correct
27 Correct 60 ms 28488 KB Output is correct
28 Correct 3 ms 1360 KB Output is correct
29 Correct 3 ms 1872 KB Output is correct
30 Correct 2 ms 1360 KB Output is correct
31 Correct 2 ms 1616 KB Output is correct
32 Correct 3 ms 1360 KB Output is correct
33 Correct 5 ms 2652 KB Output is correct
34 Correct 5 ms 2640 KB Output is correct
35 Correct 17 ms 3920 KB Output is correct
36 Correct 5 ms 1624 KB Output is correct
37 Correct 17 ms 5076 KB Output is correct
38 Correct 21 ms 4956 KB Output is correct
39 Correct 21 ms 5192 KB Output is correct
40 Correct 21 ms 4936 KB Output is correct
41 Correct 22 ms 4944 KB Output is correct
42 Runtime error 422 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1104 KB Output is correct
2 Correct 2 ms 1104 KB Output is correct
3 Correct 1 ms 1276 KB Output is correct
4 Correct 1 ms 1104 KB Output is correct
5 Correct 1 ms 1104 KB Output is correct
6 Correct 1 ms 1104 KB Output is correct
7 Correct 1 ms 1276 KB Output is correct
8 Correct 1 ms 1104 KB Output is correct
9 Correct 2 ms 1104 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 2 ms 1360 KB Output is correct
12 Correct 6 ms 3324 KB Output is correct
13 Correct 5 ms 3152 KB Output is correct
14 Correct 2 ms 1104 KB Output is correct
15 Correct 2 ms 1104 KB Output is correct
16 Correct 2 ms 1104 KB Output is correct
17 Correct 3 ms 1360 KB Output is correct
18 Correct 2 ms 1104 KB Output is correct
19 Correct 2 ms 1204 KB Output is correct
20 Correct 53 ms 33388 KB Output is correct
21 Correct 2 ms 1104 KB Output is correct
22 Correct 2 ms 1200 KB Output is correct
23 Correct 3 ms 1104 KB Output is correct
24 Correct 4 ms 1360 KB Output is correct
25 Correct 3 ms 1360 KB Output is correct
26 Correct 59 ms 30124 KB Output is correct
27 Correct 56 ms 28488 KB Output is correct
28 Correct 3 ms 1360 KB Output is correct
29 Correct 3 ms 1872 KB Output is correct
30 Correct 3 ms 1360 KB Output is correct
31 Correct 3 ms 1616 KB Output is correct
32 Correct 3 ms 1360 KB Output is correct
33 Correct 5 ms 2640 KB Output is correct
34 Correct 6 ms 2640 KB Output is correct
35 Correct 18 ms 3920 KB Output is correct
36 Correct 4 ms 1624 KB Output is correct
37 Correct 18 ms 4944 KB Output is correct
38 Correct 21 ms 4780 KB Output is correct
39 Correct 20 ms 5200 KB Output is correct
40 Correct 20 ms 4944 KB Output is correct
41 Correct 28 ms 4840 KB Output is correct
42 Runtime error 435 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -