Submission #569278

# Submission time Handle Problem Language Result Execution time Memory
569278 2022-05-27T08:15:45 Z BadPenalty Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
1000 ms 3468 KB
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int N = 30010,mod = 1e9+7;
int vstd[N],dst[N];
pair<int,int>A[N];
vector<int> tile[N];
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;

    for(int i = 0;i<m;i++)dst[i] = 1e9;
    for(int i = 0;i<m;i++)
    {
        cin>>A[i].F>>A[i].S;
        tile[A[i].F].pb(i);
    }
    priority_queue<pair<int,int>>pq;
    for(auto u:tile[A[0].F])
    {
        pq.push({0,u});
        dst[u] = 0;
    }
    int mx = 0;
    while(!pq.empty())
    {
        mx = max(mx,(int)pq.size());
        int nd = pq.top().S;
        int jumps = -pq.top().F;
        int x = A[nd].F;
        int p = A[nd].S;
        pq.pop();
        if(vstd[nd])continue;
        vstd[nd] = 1;
//        if(nd==1)
//        {
//            cout<<jumps<<' '<<mx<<endl;
//            return 0;
//        }
        int k = 1;
        for(int i = x+p;i<n;i+=p)
        {
            for(auto u:tile[i])
            {
                if(vstd[u])continue;
                if(dst[u]>k+jumps)
                {
                    pq.push({-(k+jumps),u});
                    dst[u] = k+jumps;
                }
            }
            k++;
        }
        k = 1;
        for(int i = x-p;i>=0;i-=p)
        {
            for(auto u:tile[i])
            {
                if(vstd[u])continue;

                if(dst[u]>k+jumps)
                {
                    pq.push({-(k+jumps),u});
                    dst[u] = k+jumps;
                }
            }
            k++;
        }
    }
    if(dst[1]!=1e9)cout<<dst[1]<<endl;
    else cout<<-1<<endl;
    return 0;
}
/*
4
9
0 1
3 1
0 1
0 1
0 1
1 2
3 1
3 1
3 1

*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 3 ms 1160 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 2 ms 1032 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 14 ms 1164 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 1 ms 1028 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 13 ms 1116 KB Output is correct
27 Correct 12 ms 1116 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 2 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 15 ms 1164 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 12 ms 1116 KB Output is correct
27 Correct 11 ms 1116 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 2 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 24 ms 2272 KB Output is correct
36 Correct 4 ms 1236 KB Output is correct
37 Correct 25 ms 2128 KB Output is correct
38 Correct 30 ms 2892 KB Output is correct
39 Correct 30 ms 2892 KB Output is correct
40 Correct 30 ms 2808 KB Output is correct
41 Correct 33 ms 2764 KB Output is correct
42 Correct 194 ms 1912 KB Output is correct
43 Correct 190 ms 1892 KB Output is correct
44 Correct 247 ms 2324 KB Output is correct
45 Correct 24 ms 2508 KB Output is correct
46 Correct 26 ms 2508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 3 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 14 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 13 ms 1108 KB Output is correct
27 Correct 12 ms 1112 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 1 ms 980 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 2 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 24 ms 2256 KB Output is correct
36 Correct 4 ms 1236 KB Output is correct
37 Correct 27 ms 2092 KB Output is correct
38 Correct 29 ms 2864 KB Output is correct
39 Correct 30 ms 2864 KB Output is correct
40 Correct 30 ms 2892 KB Output is correct
41 Correct 30 ms 2892 KB Output is correct
42 Correct 187 ms 1968 KB Output is correct
43 Correct 189 ms 1884 KB Output is correct
44 Correct 241 ms 2196 KB Output is correct
45 Correct 20 ms 2508 KB Output is correct
46 Correct 20 ms 2448 KB Output is correct
47 Correct 45 ms 3056 KB Output is correct
48 Correct 6 ms 2004 KB Output is correct
49 Correct 6 ms 1972 KB Output is correct
50 Correct 4 ms 1620 KB Output is correct
51 Correct 31 ms 3468 KB Output is correct
52 Correct 34 ms 2960 KB Output is correct
53 Correct 15 ms 3072 KB Output is correct
54 Correct 1 ms 980 KB Output is correct
55 Correct 1 ms 1028 KB Output is correct
56 Execution timed out 1091 ms 3012 KB Time limit exceeded
57 Halted 0 ms 0 KB -