oj.uz

Submission #72741

# Submission time Handle Problem Language Result Execution time Memory
72741 2018-08-26T21:55:28 Z Pajaraja Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 57624 KB 
#include <bits/stdc++.h>
#define MAXN 30007
using namespace std;
vector<int> g[MAXN],w[MAXN];
set<int> v[MAXN];
bool vi[MAXN];
int dist[MAXN],en;
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;
		if(u==en) return;
		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,t1,t2;
	scanf("%d%d",&n,&m);
	scanf("%d%d%d%d",&st,&t1,&en,&t2);
	v[st].insert(t1);
	v[en].insert(t2);
	for(int i=0;i<m-2;i++)
	{
		scanf("%d%d",&t1,&t2);
		v[t1].insert(t2);
	}
	for(int i=0;i<n;i++)
	{
		for(set<int>::iterator it=v[i].begin();it!=v[i].end();it++)
		{
			int t=*it,cur=i+t;
			while(cur<n)
			{
				g[i].push_back(cur);
				w[i].push_back((cur-i)/t);
				if(v[cur].find(t)!=v[cur].end()) break;
				cur+=t;
			} 
			cur=i-t;
			while(cur>=0)
			{
				g[i].push_back(cur);
				w[i].push_back((i-cur)/t);
				if(v[cur].find(t)!=v[cur].end()) 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:20: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:34: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:35: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:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&t1,&t2);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3064 KB Output is correct
2 Correct 5 ms 3172 KB Output is correct
3 Correct 4 ms 3248 KB Output is correct
4 Correct 4 ms 3388 KB Output is correct
5 Correct 5 ms 3392 KB Output is correct
6 Correct 5 ms 3424 KB Output is correct
7 Correct 4 ms 3424 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3564 KB Output is correct
2 Correct 4 ms 3564 KB Output is correct
3 Correct 5 ms 3564 KB Output is correct
4 Correct 5 ms 3564 KB Output is correct
5 Correct 4 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 5 ms 3564 KB Output is correct
9 Correct 5 ms 3564 KB Output is correct
10 Correct 6 ms 3564 KB Output is correct
11 Correct 6 ms 3580 KB Output is correct
12 Correct 6 ms 3580 KB Output is correct
13 Correct 5 ms 3580 KB Output is correct
14 Correct 6 ms 3700 KB Output is correct
15 Correct 7 ms 3700 KB Output is correct
16 Correct 5 ms 3700 KB Output is correct
17 Correct 7 ms 3708 KB Output is correct
18 Correct 6 ms 3708 KB Output is correct
19 Correct 6 ms 3708 KB Output is correct
20 Correct 6 ms 3708 KB Output is correct
21 Correct 5 ms 3708 KB Output is correct
22 Correct 6 ms 3708 KB Output is correct
23 Correct 7 ms 3708 KB Output is correct
24 Correct 7 ms 3712 KB Output is correct
25 Correct 7 ms 3712 KB Output is correct
26 Correct 5 ms 3712 KB Output is correct
27 Correct 5 ms 3712 KB Output is correct
28 Correct 7 ms 3792 KB Output is correct
29 Correct 16 ms 4812 KB Output is correct
30 Correct 7 ms 4812 KB Output is correct
31 Correct 9 ms 4812 KB Output is correct
32 Correct 8 ms 4812 KB Output is correct
33 Correct 30 ms 5896 KB Output is correct
34 Correct 22 ms 5896 KB Output is correct

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13552 KB Output is correct
2 Correct 4 ms 13552 KB Output is correct
3 Correct 4 ms 13552 KB Output is correct
4 Correct 4 ms 13552 KB Output is correct
5 Correct 4 ms 13552 KB Output is correct
6 Correct 4 ms 13552 KB Output is correct
7 Correct 4 ms 13552 KB Output is correct
8 Correct 4 ms 13552 KB Output is correct
9 Correct 5 ms 13552 KB Output is correct
10 Correct 4 ms 13552 KB Output is correct
11 Correct 6 ms 13552 KB Output is correct
12 Correct 5 ms 13552 KB Output is correct
13 Correct 5 ms 13552 KB Output is correct
14 Correct 5 ms 13552 KB Output is correct
15 Correct 5 ms 13552 KB Output is correct
16 Correct 4 ms 13552 KB Output is correct
17 Correct 6 ms 13552 KB Output is correct
18 Correct 5 ms 13552 KB Output is correct
19 Correct 6 ms 13552 KB Output is correct
20 Correct 8 ms 13552 KB Output is correct
21 Correct 5 ms 13552 KB Output is correct
22 Correct 5 ms 13552 KB Output is correct
23 Correct 5 ms 13552 KB Output is correct
24 Correct 6 ms 13552 KB Output is correct
25 Correct 6 ms 13552 KB Output is correct
26 Correct 6 ms 13552 KB Output is correct
27 Correct 5 ms 13552 KB Output is correct
28 Correct 6 ms 13552 KB Output is correct
29 Correct 16 ms 13552 KB Output is correct
30 Correct 9 ms 13552 KB Output is correct
31 Correct 10 ms 13552 KB Output is correct
32 Correct 8 ms 13552 KB Output is correct
33 Correct 29 ms 13552 KB Output is correct
34 Correct 21 ms 13552 KB Output is correct
35 Correct 29 ms 13552 KB Output is correct
36 Correct 12 ms 13552 KB Output is correct
37 Correct 32 ms 13552 KB Output is correct
38 Correct 49 ms 13552 KB Output is correct
39 Correct 36 ms 13552 KB Output is correct
40 Correct 36 ms 13552 KB Output is correct
41 Correct 58 ms 13552 KB Output is correct
42 Correct 10 ms 13552 KB Output is correct
43 Correct 11 ms 13552 KB Output is correct
44 Correct 11 ms 13552 KB Output is correct
45 Correct 136 ms 13576 KB Output is correct
46 Correct 96 ms 13576 KB Output is correct
47 Correct 78 ms 14576 KB Output is correct
48 Correct 31 ms 14576 KB Output is correct
49 Correct 38 ms 14576 KB Output is correct
50 Correct 24 ms 14576 KB Output is correct
51 Correct 58 ms 14576 KB Output is correct
52 Correct 71 ms 14576 KB Output is correct
53 Correct 27 ms 14576 KB Output is correct
54 Correct 8 ms 14576 KB Output is correct
55 Correct 10 ms 14576 KB Output is correct
56 Correct 27 ms 14576 KB Output is correct
57 Correct 30 ms 14576 KB Output is correct
58 Correct 16 ms 14576 KB Output is correct
59 Correct 15 ms 14576 KB Output is correct
60 Correct 19 ms 14576 KB Output is correct
61 Correct 16 ms 14576 KB Output is correct
62 Correct 45 ms 14576 KB Output is correct
63 Correct 457 ms 36296 KB Output is correct
64 Correct 529 ms 39460 KB Output is correct
65 Execution timed out 1096 ms 57624 KB Time limit exceeded
66 Halted 0 ms 0 KB -