#include <bits/stdc++.h>
#define MAXN 30007
using namespace std;
vector<int> g[MAXN],w[MAXN],v[MAXN],c;
bool vi[MAXN];
int dist[MAXN];
void dijkstra(int s)
{
priority_queue<pair<int,int> > pq;
pq.push(make_pair(0,s));
while(!pq.empty())
{
int u=pq.top().second,d=-pq.top().first;
pq.pop();
if(vi[u]) continue;
dist[u]=d;
vi[u]=true;
for(int i=0;i<g[u].size();i++) if(!vi[g[u][i]]) pq.push(make_pair(-d-w[u][i],g[u][i]));
}
}
bool binarna(int l,int r,int k,int val)
{
if(r<l) return false;
int s=(l+r)/2;
if(v[k][s]==val) return true;
if(val<v[k][s]) return binarna(l,s-1,k,val);
return binarna(s+1,r,k,val);
}
int main()
{
int n,m,st,en,t1,t2;
scanf("%d%d",&n,&m);
scanf("%d%d%d%d",&st,&t1,&en,&t2);
v[st].push_back(t1);
v[en].push_back(t2);
for(int i=0;i<m-2;i++)
{
scanf("%d%d",&t1,&t2);
v[t1].push_back(t2);
}
for(int i=0;i<n;i++) sort(v[i].begin(),v[i].end());
for(int i=0;i<n;i++)
{
for(int j=v[i].size()-1;j>=0;j--)
{
int t=v[i][j],cur=i+t,cnt=0;
while(cur<n)
{
cnt++;
g[i].push_back(cur);
w[i].push_back(cnt);
if(binarna(0,v[cur].size()-1,cur,t)) break;
cur+=t;
}
cur=i-t; cnt=0;
while(cur>=0)
{
cnt++;
g[i].push_back(cur);
w[i].push_back(cnt);
if(binarna(0,v[cur].size()-1,cur,t)) break;
cur-=t;
}
}
}
dijkstra(st);
if(!vi[en]) dist[en]=-1;
printf("%d",dist[en]);
}
Compilation message
skyscraper.cpp: In function 'void dijkstra(int)':
skyscraper.cpp:18:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<g[u].size();i++) if(!vi[g[u][i]]) pq.push(make_pair(-d-w[u][i],g[u][i]));
~^~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d",&st,&t1,&en,&t2);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&t1,&t2);
~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2424 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2532 KB |
Output is correct |
| 3 |
Correct |
3 ms |
2532 KB |
Output is correct |
| 4 |
Correct |
4 ms |
2532 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2532 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2532 KB |
Output is correct |
| 7 |
Correct |
3 ms |
2592 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2640 KB |
Output is correct |
| 2 |
Correct |
3 ms |
2768 KB |
Output is correct |
| 3 |
Correct |
3 ms |
2768 KB |
Output is correct |
| 4 |
Correct |
4 ms |
2768 KB |
Output is correct |
| 5 |
Correct |
4 ms |
2768 KB |
Output is correct |
| 6 |
Correct |
3 ms |
2768 KB |
Output is correct |
| 7 |
Correct |
3 ms |
2768 KB |
Output is correct |
| 8 |
Correct |
5 ms |
2768 KB |
Output is correct |
| 9 |
Correct |
4 ms |
2768 KB |
Output is correct |
| 10 |
Correct |
5 ms |
2768 KB |
Output is correct |
| 11 |
Correct |
5 ms |
2856 KB |
Output is correct |
| 12 |
Correct |
12 ms |
5056 KB |
Output is correct |
| 13 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 14 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 15 |
Correct |
5 ms |
5056 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 2 |
Correct |
3 ms |
5056 KB |
Output is correct |
| 3 |
Correct |
3 ms |
5056 KB |
Output is correct |
| 4 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 5 |
Correct |
3 ms |
5056 KB |
Output is correct |
| 6 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 7 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 8 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 9 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 10 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 11 |
Correct |
6 ms |
5056 KB |
Output is correct |
| 12 |
Correct |
14 ms |
5056 KB |
Output is correct |
| 13 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 14 |
Correct |
6 ms |
5056 KB |
Output is correct |
| 15 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 16 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 17 |
Correct |
8 ms |
5056 KB |
Output is correct |
| 18 |
Correct |
6 ms |
5056 KB |
Output is correct |
| 19 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 20 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 21 |
Correct |
4 ms |
5056 KB |
Output is correct |
| 22 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 23 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 24 |
Correct |
7 ms |
5056 KB |
Output is correct |
| 25 |
Correct |
5 ms |
5056 KB |
Output is correct |
| 26 |
Correct |
96 ms |
34188 KB |
Output is correct |
| 27 |
Correct |
145 ms |
36176 KB |
Output is correct |
| 28 |
Correct |
5 ms |
36176 KB |
Output is correct |
| 29 |
Correct |
18 ms |
36176 KB |
Output is correct |
| 30 |
Correct |
7 ms |
36176 KB |
Output is correct |
| 31 |
Correct |
8 ms |
36176 KB |
Output is correct |
| 32 |
Correct |
7 ms |
36176 KB |
Output is correct |
| 33 |
Correct |
28 ms |
36176 KB |
Output is correct |
| 34 |
Correct |
28 ms |
36176 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 2 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 3 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 4 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 5 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 6 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 7 |
Correct |
3 ms |
36176 KB |
Output is correct |
| 8 |
Correct |
3 ms |
36176 KB |
Output is correct |
| 9 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 10 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 11 |
Correct |
5 ms |
36176 KB |
Output is correct |
| 12 |
Correct |
13 ms |
36176 KB |
Output is correct |
| 13 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 14 |
Correct |
5 ms |
36176 KB |
Output is correct |
| 15 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 16 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 17 |
Correct |
7 ms |
36176 KB |
Output is correct |
| 18 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 19 |
Correct |
5 ms |
36176 KB |
Output is correct |
| 20 |
Correct |
5 ms |
36176 KB |
Output is correct |
| 21 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 22 |
Correct |
4 ms |
36176 KB |
Output is correct |
| 23 |
Correct |
6 ms |
36176 KB |
Output is correct |
| 24 |
Correct |
6 ms |
36176 KB |
Output is correct |
| 25 |
Correct |
6 ms |
36176 KB |
Output is correct |
| 26 |
Correct |
98 ms |
36176 KB |
Output is correct |
| 27 |
Correct |
151 ms |
36192 KB |
Output is correct |
| 28 |
Correct |
6 ms |
36192 KB |
Output is correct |
| 29 |
Correct |
15 ms |
36192 KB |
Output is correct |
| 30 |
Correct |
6 ms |
36192 KB |
Output is correct |
| 31 |
Correct |
10 ms |
36192 KB |
Output is correct |
| 32 |
Correct |
7 ms |
36192 KB |
Output is correct |
| 33 |
Correct |
30 ms |
36192 KB |
Output is correct |
| 34 |
Correct |
30 ms |
36192 KB |
Output is correct |
| 35 |
Correct |
25 ms |
36192 KB |
Output is correct |
| 36 |
Correct |
8 ms |
36192 KB |
Output is correct |
| 37 |
Correct |
39 ms |
36192 KB |
Output is correct |
| 38 |
Correct |
38 ms |
36192 KB |
Output is correct |
| 39 |
Correct |
40 ms |
36192 KB |
Output is correct |
| 40 |
Correct |
38 ms |
36192 KB |
Output is correct |
| 41 |
Correct |
36 ms |
36192 KB |
Output is correct |
| 42 |
Execution timed out |
1026 ms |
263168 KB |
Time limit exceeded |
| 43 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
3 ms |
263168 KB |
Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
| 2 |
Halted |
0 ms |
0 KB |
- |
