답안 #77029 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77029	2018-09-20T07:25:00 Z	vex	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	223 ms	80948 KB

skyscraper

#include <bits/stdc++.h>
#define maxn 30005
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
 
int n,m;
pii dg[maxn];
pii sdg[maxn];
vector<int>p[maxn];
 
vector<pii>adj[maxn];
priority_queue<pii>pq;
int dis[maxn];
bool bio[maxn];
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
 
    cin>>n>>m;
    int s;
    int e;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        sdg[i].f=y;
        sdg[i].s=x;
        if(i==0)s=x;
        if(i==1)e=x;
    }
    sort(sdg,sdg+m);
    int br=0;
    for(int i=0;i<m;i++)
    {
    	if(i==0 || sdg[i]!=sdg[i-1])
    	{
    		dg[br].f=sdg[i].s;
    		dg[br].s=sdg[i].f;
    		br++;
    	}
    }
    m=br;
    for(int i=0;i<m;i++)p[dg[i].s].push_back(dg[i].f);
    for(int i=1;i<n;i++)sort(p[i].begin(),p[i].end());
    for(int i=0;i<m;i++)
    {
	int pp=0;
      	int sz=p[dg[i].s].size();
      	while(p[dg[i].s][pp]!=dg[i].f)pp++;
 
	int up=pp+1;
      	for(int j=dg[i].f+dg[i].s;j<n;j+=dg[i].s)
        {
          	while(up<sz && p[dg[i].s][up]<j)up++;
          	adj[dg[i].f].push_back({j,(j-dg[i].f)/dg[i].s});
          	if(up<sz && p[dg[i].s][up]==j)break; 
        }
      	
      	pp--;
      	for(int j=dg[i].f-dg[i].s;j>=0;j-=dg[i].s)
        {
          	while(pp>=0 && p[dg[i].s][pp]>j)pp--;
            adj[dg[i].f].push_back({j,(dg[i].f-j)/dg[i].s});
            if(pp>=0 && p[dg[i].s][pp]==j)break; 
        }
    }
    
    /*for(int i=0;i<n;i++)
    {
    	cout<<i<<"   ";
    	for(auto x:adj[i])cout<<x.f<<","<<x.s<<" ";
    	cout<<endl;
    }*/
 
    if(e==s)
    {
        cout<<"0"<<endl;
        return 0;
    }
 
    for(int i=0;i<n;i++)
    {
        dis[i]=maxn*maxn+55;
        bio[i]=false;
    }
    pq.push({0,s});
    dis[s]=0;
 
    while(!pq.empty())
    {
        int v=pq.top().second;
        pq.pop();
      	if(v==e)
        {
          cout<<dis[e]<<endl;
          return 0;
        }
        if(bio[v])continue;
        bio[v]=true;
 
        for(auto x:adj[v])
        {
    		int u=x.f;
          	int w=x.s;
          	if(dis[u]>dis[v]+w)
            {
              	dis[u]=dis[v]+w;
              	pq.push({-dis[u],u});
            }
        }
    }
 
    cout<<"-1"<<endl;
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:98:8: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
        if(v==e)
        ^~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1784 KB	Output is correct
2	Correct	3 ms	1788 KB	Output is correct
3	Correct	3 ms	1832 KB	Output is correct
4	Correct	3 ms	1848 KB	Output is correct
5	Correct	3 ms	2020 KB	Output is correct
6	Correct	3 ms	2020 KB	Output is correct
7	Correct	3 ms	2064 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2232 KB	Output is correct
2	Correct	3 ms	2232 KB	Output is correct
3	Correct	3 ms	2232 KB	Output is correct
4	Correct	3 ms	2232 KB	Output is correct
5	Correct	3 ms	2232 KB	Output is correct
6	Correct	3 ms	2232 KB	Output is correct
7	Correct	3 ms	2232 KB	Output is correct
8	Correct	3 ms	2232 KB	Output is correct
9	Correct	3 ms	2232 KB	Output is correct
10	Correct	3 ms	2232 KB	Output is correct
11	Correct	4 ms	2232 KB	Output is correct
12	Correct	4 ms	2232 KB	Output is correct
13	Correct	4 ms	2232 KB	Output is correct
14	Correct	8 ms	2292 KB	Output is correct
15	Correct	4 ms	2304 KB	Output is correct
16	Correct	4 ms	2304 KB	Output is correct
17	Correct	5 ms	2452 KB	Output is correct
18	Correct	4 ms	2452 KB	Output is correct
19	Correct	4 ms	2452 KB	Output is correct
20	Correct	5 ms	2452 KB	Output is correct
21	Correct	4 ms	2452 KB	Output is correct
22	Correct	3 ms	2452 KB	Output is correct
23	Correct	4 ms	2452 KB	Output is correct
24	Correct	4 ms	2536 KB	Output is correct
25	Correct	5 ms	2536 KB	Output is correct
26	Correct	4 ms	2536 KB	Output is correct
27	Correct	4 ms	2536 KB	Output is correct
28	Correct	5 ms	2608 KB	Output is correct
29	Correct	6 ms	3140 KB	Output is correct
30	Correct	4 ms	3140 KB	Output is correct
31	Correct	5 ms	3140 KB	Output is correct
32	Correct	5 ms	3140 KB	Output is correct
33	Correct	10 ms	3800 KB	Output is correct
34	Correct	8 ms	3880 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	3880 KB	Output is correct
2	Correct	3 ms	3880 KB	Output is correct
3	Correct	3 ms	3880 KB	Output is correct
4	Correct	3 ms	3880 KB	Output is correct
5	Correct	3 ms	3880 KB	Output is correct
6	Correct	3 ms	3880 KB	Output is correct
7	Correct	3 ms	3880 KB	Output is correct
8	Correct	3 ms	3880 KB	Output is correct
9	Correct	3 ms	3880 KB	Output is correct
10	Correct	3 ms	3880 KB	Output is correct
11	Correct	4 ms	3880 KB	Output is correct
12	Correct	3 ms	3880 KB	Output is correct
13	Correct	4 ms	3880 KB	Output is correct
14	Correct	4 ms	3880 KB	Output is correct
15	Correct	4 ms	3880 KB	Output is correct
16	Correct	3 ms	3880 KB	Output is correct
17	Correct	4 ms	3880 KB	Output is correct
18	Correct	4 ms	3880 KB	Output is correct
19	Correct	4 ms	3880 KB	Output is correct
20	Correct	5 ms	3880 KB	Output is correct
21	Correct	4 ms	3880 KB	Output is correct
22	Correct	4 ms	3880 KB	Output is correct
23	Correct	4 ms	3880 KB	Output is correct
24	Correct	5 ms	3880 KB	Output is correct
25	Correct	5 ms	3880 KB	Output is correct
26	Correct	4 ms	3880 KB	Output is correct
27	Correct	4 ms	3880 KB	Output is correct
28	Correct	5 ms	3880 KB	Output is correct
29	Correct	8 ms	3880 KB	Output is correct
30	Correct	4 ms	3880 KB	Output is correct
31	Correct	5 ms	3880 KB	Output is correct
32	Correct	4 ms	3880 KB	Output is correct
33	Correct	8 ms	4104 KB	Output is correct
34	Correct	7 ms	4112 KB	Output is correct
35	Correct	15 ms	4508 KB	Output is correct
36	Correct	5 ms	4508 KB	Output is correct
37	Correct	17 ms	5664 KB	Output is correct
38	Correct	19 ms	5824 KB	Output is correct
39	Correct	20 ms	6088 KB	Output is correct
40	Correct	20 ms	6320 KB	Output is correct
41	Correct	20 ms	6632 KB	Output is correct
42	Correct	12 ms	6632 KB	Output is correct
43	Correct	9 ms	6632 KB	Output is correct
44	Correct	11 ms	6632 KB	Output is correct
45	Correct	29 ms	10204 KB	Output is correct
46	Correct	27 ms	10288 KB	Output is correct

Subtask #5
43.0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	10288 KB	Output is correct
2	Correct	3 ms	10288 KB	Output is correct
3	Correct	3 ms	10288 KB	Output is correct
4	Correct	3 ms	10288 KB	Output is correct
5	Correct	3 ms	10288 KB	Output is correct
6	Correct	3 ms	10288 KB	Output is correct
7	Correct	3 ms	10288 KB	Output is correct
8	Correct	3 ms	10288 KB	Output is correct
9	Correct	3 ms	10288 KB	Output is correct
10	Correct	3 ms	10288 KB	Output is correct
11	Correct	5 ms	10288 KB	Output is correct
12	Correct	3 ms	10288 KB	Output is correct
13	Correct	3 ms	10288 KB	Output is correct
14	Correct	4 ms	10288 KB	Output is correct
15	Correct	4 ms	10288 KB	Output is correct
16	Correct	4 ms	10288 KB	Output is correct
17	Correct	5 ms	10288 KB	Output is correct
18	Correct	4 ms	10288 KB	Output is correct
19	Correct	4 ms	10288 KB	Output is correct
20	Correct	5 ms	10288 KB	Output is correct
21	Correct	4 ms	10288 KB	Output is correct
22	Correct	3 ms	10288 KB	Output is correct
23	Correct	4 ms	10288 KB	Output is correct
24	Correct	5 ms	10288 KB	Output is correct
25	Correct	4 ms	10288 KB	Output is correct
26	Correct	4 ms	10288 KB	Output is correct
27	Correct	4 ms	10288 KB	Output is correct
28	Correct	5 ms	10288 KB	Output is correct
29	Correct	6 ms	10288 KB	Output is correct
30	Correct	4 ms	10288 KB	Output is correct
31	Correct	5 ms	10288 KB	Output is correct
32	Correct	10 ms	10288 KB	Output is correct
33	Correct	8 ms	10288 KB	Output is correct
34	Correct	7 ms	10288 KB	Output is correct
35	Correct	17 ms	10288 KB	Output is correct
36	Correct	5 ms	10288 KB	Output is correct
37	Correct	17 ms	10288 KB	Output is correct
38	Correct	21 ms	10288 KB	Output is correct
39	Correct	20 ms	10288 KB	Output is correct
40	Correct	20 ms	10288 KB	Output is correct
41	Correct	19 ms	10288 KB	Output is correct
42	Correct	9 ms	10288 KB	Output is correct
43	Correct	11 ms	10288 KB	Output is correct
44	Correct	11 ms	10288 KB	Output is correct
45	Correct	29 ms	13008 KB	Output is correct
46	Correct	28 ms	13220 KB	Output is correct
47	Correct	44 ms	17780 KB	Output is correct
48	Correct	20 ms	17780 KB	Output is correct
49	Correct	17 ms	17780 KB	Output is correct
50	Correct	14 ms	17780 KB	Output is correct
51	Correct	35 ms	17780 KB	Output is correct
52	Correct	35 ms	17780 KB	Output is correct
53	Correct	17 ms	17780 KB	Output is correct
54	Correct	6 ms	17780 KB	Output is correct
55	Correct	7 ms	17780 KB	Output is correct
56	Correct	223 ms	17780 KB	Output is correct
57	Correct	23 ms	19120 KB	Output is correct
58	Correct	12 ms	19120 KB	Output is correct
59	Correct	13 ms	19120 KB	Output is correct
60	Correct	15 ms	19120 KB	Output is correct
61	Correct	15 ms	19120 KB	Output is correct
62	Correct	82 ms	19120 KB	Output is correct
63	Correct	83 ms	34868 KB	Output is correct
64	Correct	97 ms	43532 KB	Output is correct
65	Correct	125 ms	53796 KB	Output is correct
66	Correct	220 ms	80704 KB	Output is correct
67	Correct	196 ms	80948 KB	Output is correct

답안 #77029

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 43.0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
43.0 / 43.0