oj.uz

Submission #23564

# Submission time Handle Problem Language Result Execution time Memory
23564 2017-05-12T15:51:14 Z samir_droubi Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 373 ms 112020 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
const int mxn=(1e5)+5;
vector<pair<int,int> >gr[mxn];
set<int>a[mxn];
set<pair<int,int> >s;
int st,en;
int dis[mxn];
set<pair<int,int> >::iterator it;
set<int>::iterator itt;
void dijk()
{
	for(int i=0;i<mxn;++i)dis[i]=(1e9);
	dis[st]=0;
	s.insert({0,st});
	while(!s.empty())
	{
		it=s.begin();
		int v=it->second;
		int d=it->first;
		s.erase(it);
		for(int i=0;i<gr[v].size();++i)
		{
			int u=gr[v][i].first;
			int w=gr[v][i].second;
			if(d+w<dis[u])
			{
				dis[u]=d+w;
				s.insert({d+w,u});
			}
		}
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;++i)
	{
		int b,p;
		scanf("%d%d",&b,&p);
		a[b].insert(p);
		if(i==0)st=b;
		if(i==1)en=b;
	}

	for(int i=0;i<n;++i)
	{
		itt=a[i].begin();
		for(itt;itt!=a[i].end();++itt)
		{
			int p=*itt;
			for(int j=1;i+(j*p)<n;++j)
			{
				int cur=i+(j*p);
				gr[i].push_back({cur,j});
				if(a[cur].count(p))break;
			}
		}
	}

	for(int i=n-1;i>=0;--i)
	{
		itt=a[i].begin();
		for(itt;itt!=a[i].end();++itt)
		{
			int p=*itt;
			for(int j=1;i-(j*p)>=0;++j)
			{
				int cur=i-(j*p);
				gr[i].push_back({cur,j});
				if(a[cur].count(p))break;
			}
		}
	}

	dijk();
	if(dis[en]==(1e9))dis[en]=-1;
	printf("%d\n",dis[en]);
	return 0;
}

Compilation message

skyscraper.cpp: In function 'void dijk()':
skyscraper.cpp:23:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<gr[v].size();++i)
                ^
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:50:10: warning: statement has no effect [-Wunused-value]
   for(itt;itt!=a[i].end();++itt)
          ^
skyscraper.cpp:65:10: warning: statement has no effect [-Wunused-value]
   for(itt;itt!=a[i].end();++itt)
          ^
skyscraper.cpp:37:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
skyscraper.cpp:41:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&b,&p);
                      ^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9444 KB Output is correct
2 Correct 6 ms 9444 KB Output is correct
3 Correct 0 ms 9444 KB Output is correct
4 Correct 0 ms 9444 KB Output is correct
5 Correct 0 ms 9444 KB Output is correct
6 Correct 0 ms 9444 KB Output is correct
7 Correct 0 ms 9444 KB Output is correct
8 Correct 0 ms 9444 KB Output is correct
9 Correct 3 ms 9444 KB Output is correct
10 Correct 3 ms 9444 KB Output is correct
11 Correct 0 ms 9576 KB Output is correct
12 Correct 0 ms 9444 KB Output is correct
13 Correct 0 ms 9444 KB Output is correct
14 Correct 0 ms 9576 KB Output is correct
15 Correct 0 ms 9576 KB Output is correct
16 Correct 3 ms 9576 KB Output is correct
17 Correct 3 ms 9708 KB Output is correct
18 Correct 3 ms 9576 KB Output is correct
19 Correct 0 ms 9576 KB Output is correct
20 Correct 0 ms 9576 KB Output is correct
21 Correct 0 ms 9576 KB Output is correct
22 Correct 0 ms 9576 KB Output is correct
23 Correct 0 ms 9576 KB Output is correct
24 Correct 3 ms 9708 KB Output is correct
25 Correct 3 ms 9708 KB Output is correct
26 Correct 3 ms 9580 KB Output is correct
27 Correct 0 ms 9580 KB Output is correct
28 Correct 0 ms 9840 KB Output is correct
29 Correct 3 ms 10848 KB Output is correct
30 Correct 3 ms 9860 KB Output is correct
31 Correct 0 ms 10116 KB Output is correct
32 Correct 3 ms 9972 KB Output is correct
33 Correct 3 ms 11788 KB Output is correct
34 Correct 6 ms 11788 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9444 KB Output is correct
2 Correct 3 ms 9444 KB Output is correct
3 Correct 0 ms 9444 KB Output is correct
4 Correct 3 ms 9444 KB Output is correct
5 Correct 0 ms 9444 KB Output is correct
6 Correct 0 ms 9444 KB Output is correct
7 Correct 0 ms 9444 KB Output is correct
8 Correct 3 ms 9444 KB Output is correct
9 Correct 0 ms 9444 KB Output is correct
10 Correct 0 ms 9444 KB Output is correct
11 Correct 3 ms 9576 KB Output is correct
12 Correct 3 ms 9444 KB Output is correct
13 Correct 3 ms 9444 KB Output is correct
14 Correct 3 ms 9576 KB Output is correct
15 Correct 3 ms 9576 KB Output is correct
16 Correct 3 ms 9576 KB Output is correct
17 Correct 3 ms 9708 KB Output is correct
18 Correct 3 ms 9576 KB Output is correct
19 Correct 3 ms 9576 KB Output is correct
20 Correct 3 ms 9576 KB Output is correct
21 Correct 3 ms 9576 KB Output is correct
22 Correct 3 ms 9576 KB Output is correct
23 Correct 3 ms 9576 KB Output is correct
24 Correct 3 ms 9708 KB Output is correct
25 Correct 0 ms 9708 KB Output is correct
26 Correct 0 ms 9580 KB Output is correct
27 Correct 3 ms 9580 KB Output is correct
28 Correct 3 ms 9840 KB Output is correct
29 Correct 9 ms 10848 KB Output is correct
30 Correct 3 ms 9860 KB Output is correct
31 Correct 3 ms 10116 KB Output is correct
32 Correct 6 ms 9972 KB Output is correct
33 Correct 3 ms 11788 KB Output is correct
34 Correct 13 ms 11788 KB Output is correct
35 Correct 29 ms 11820 KB Output is correct
36 Correct 6 ms 9972 KB Output is correct
37 Correct 16 ms 12480 KB Output is correct
38 Correct 29 ms 12744 KB Output is correct
39 Correct 33 ms 12752 KB Output is correct
40 Correct 29 ms 12744 KB Output is correct
41 Correct 39 ms 12744 KB Output is correct
42 Correct 6 ms 9580 KB Output is correct
43 Correct 6 ms 9580 KB Output is correct
44 Correct 9 ms 9576 KB Output is correct
45 Correct 43 ms 16812 KB Output is correct
46 Correct 43 ms 16812 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9444 KB Output is correct
2 Correct 0 ms 9444 KB Output is correct
3 Correct 0 ms 9444 KB Output is correct
4 Correct 3 ms 9444 KB Output is correct
5 Correct 0 ms 9444 KB Output is correct
6 Correct 0 ms 9444 KB Output is correct
7 Correct 3 ms 9444 KB Output is correct
8 Correct 3 ms 9444 KB Output is correct
9 Correct 3 ms 9444 KB Output is correct
10 Correct 0 ms 9444 KB Output is correct
11 Correct 6 ms 9576 KB Output is correct
12 Correct 6 ms 9444 KB Output is correct
13 Correct 3 ms 9444 KB Output is correct
14 Correct 6 ms 9576 KB Output is correct
15 Correct 0 ms 9576 KB Output is correct
16 Correct 0 ms 9576 KB Output is correct
17 Correct 3 ms 9708 KB Output is correct
18 Correct 0 ms 9576 KB Output is correct
19 Correct 0 ms 9576 KB Output is correct
20 Correct 3 ms 9576 KB Output is correct
21 Correct 3 ms 9576 KB Output is correct
22 Correct 6 ms 9576 KB Output is correct
23 Correct 3 ms 9576 KB Output is correct
24 Correct 3 ms 9708 KB Output is correct
25 Correct 0 ms 9708 KB Output is correct
26 Correct 3 ms 9580 KB Output is correct
27 Correct 3 ms 9580 KB Output is correct
28 Correct 3 ms 9840 KB Output is correct
29 Correct 6 ms 10848 KB Output is correct
30 Correct 3 ms 9860 KB Output is correct
31 Correct 3 ms 10116 KB Output is correct
32 Correct 3 ms 9972 KB Output is correct
33 Correct 9 ms 11788 KB Output is correct
34 Correct 9 ms 11788 KB Output is correct
35 Correct 29 ms 11820 KB Output is correct
36 Correct 3 ms 9972 KB Output is correct
37 Correct 39 ms 12480 KB Output is correct
38 Correct 39 ms 12744 KB Output is correct
39 Correct 43 ms 12752 KB Output is correct
40 Correct 36 ms 12744 KB Output is correct
41 Correct 33 ms 12744 KB Output is correct
42 Correct 9 ms 9580 KB Output is correct
43 Correct 0 ms 9580 KB Output is correct
44 Correct 9 ms 9576 KB Output is correct
45 Correct 49 ms 16812 KB Output is correct
46 Correct 43 ms 16812 KB Output is correct
47 Correct 86 ms 20968 KB Output is correct
48 Correct 29 ms 13016 KB Output is correct
49 Correct 23 ms 12000 KB Output is correct
50 Correct 13 ms 11772 KB Output is correct
51 Correct 83 ms 17496 KB Output is correct
52 Correct 99 ms 17732 KB Output is correct
53 Correct 49 ms 13484 KB Output is correct
54 Correct 13 ms 10444 KB Output is correct
55 Correct 3 ms 10956 KB Output is correct
56 Correct 19 ms 11820 KB Output is correct
57 Correct 56 ms 20124 KB Output is correct
58 Correct 16 ms 11208 KB Output is correct
59 Correct 16 ms 11480 KB Output is correct
60 Correct 16 ms 12072 KB Output is correct
61 Correct 19 ms 11400 KB Output is correct
62 Correct 49 ms 16128 KB Output is correct
63 Correct 136 ms 42044 KB Output is correct
64 Correct 133 ms 52176 KB Output is correct
65 Correct 199 ms 67920 KB Output is correct
66 Correct 366 ms 112020 KB Output is correct
67 Correct 373 ms 112020 KB Output is correct