답안 #43930 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43930	2018-03-28T10:32:27 Z	Kerim	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1000 ms	6776 KB

skyscraper

#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int arr[MAXN],dis[MAXN];
vector<int>adj[MAXN];
map<PII,bool>vis;
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		if(vis[{u,v}])
			continue;
		vis[{u,v}]=1;
		adj[u].pb(v);arr[i]=u;
	}
	priority_queue<pair<int,int> >q;
	q.push(mp(0,arr[1]));
	for(int i=0;i<n;i++)
		dis[i]=INF;
		dis[arr[1]]=0;
	while(!q.empty()){
		int val=-q.top().ff;
		int nd=q.top().ss;
		q.pop();
		if(dis[nd]!=val)
			continue;
		tr(it,adj[nd]){
			int cost=*it;
			int blok=max(nd/(*it),(n-nd-1)/(*it));
			for(int i=1;i<=blok;i++){
				//~ if(nd-cost*i<0 and nd+cost*i>=n)
					//~ break;
				if(nd-cost*i>=0 and umin(dis[nd-cost*i],dis[nd]+i))
					q.push(mp(-dis[nd-cost*i],nd-cost*i));
				if(nd+cost*i<n and umin(dis[nd+cost*i],dis[nd]+i))
					q.push(mp(-dis[nd+cost*i],nd+cost*i));	
			}
		}	
	}
	if(dis[arr[2]]==INF)
		dis[arr[2]]=-1;
	printf("%d\n",dis[arr[2]]);
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:40:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for(int i=0;i<n;i++)
  ^~~
skyscraper.cpp:42:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   dis[arr[1]]=0;
   ^~~
skyscraper.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&u,&v);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Correct	3 ms	2680 KB	Output is correct
3	Correct	3 ms	2732 KB	Output is correct
4	Correct	3 ms	2784 KB	Output is correct
5	Correct	3 ms	2816 KB	Output is correct
6	Correct	3 ms	2816 KB	Output is correct
7	Correct	3 ms	2872 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2896 KB	Output is correct
2	Correct	3 ms	2896 KB	Output is correct
3	Correct	3 ms	2916 KB	Output is correct
4	Correct	3 ms	2916 KB	Output is correct
5	Correct	3 ms	2916 KB	Output is correct
6	Correct	4 ms	2916 KB	Output is correct
7	Correct	4 ms	2916 KB	Output is correct
8	Correct	4 ms	2924 KB	Output is correct
9	Correct	4 ms	2924 KB	Output is correct
10	Correct	4 ms	2924 KB	Output is correct
11	Correct	5 ms	3052 KB	Output is correct
12	Correct	4 ms	3052 KB	Output is correct
13	Correct	4 ms	3052 KB	Output is correct
14	Correct	5 ms	3068 KB	Output is correct
15	Correct	4 ms	3068 KB	Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5372 KB	Output is correct
2	Correct	4 ms	5372 KB	Output is correct
3	Correct	4 ms	5372 KB	Output is correct
4	Correct	4 ms	5372 KB	Output is correct
5	Correct	4 ms	5372 KB	Output is correct
6	Correct	3 ms	5372 KB	Output is correct
7	Correct	3 ms	5372 KB	Output is correct
8	Correct	3 ms	5372 KB	Output is correct
9	Correct	3 ms	5372 KB	Output is correct
10	Correct	4 ms	5372 KB	Output is correct
11	Correct	6 ms	5372 KB	Output is correct
12	Correct	4 ms	5372 KB	Output is correct
13	Correct	4 ms	5372 KB	Output is correct
14	Correct	5 ms	5372 KB	Output is correct
15	Correct	5 ms	5372 KB	Output is correct
16	Correct	4 ms	5372 KB	Output is correct
17	Correct	5 ms	5372 KB	Output is correct
18	Correct	4 ms	5372 KB	Output is correct
19	Correct	4 ms	5372 KB	Output is correct
20	Correct	22 ms	5372 KB	Output is correct
21	Correct	4 ms	5372 KB	Output is correct
22	Correct	4 ms	5372 KB	Output is correct
23	Correct	4 ms	5372 KB	Output is correct
24	Correct	5 ms	5372 KB	Output is correct
25	Correct	6 ms	5372 KB	Output is correct
26	Correct	4 ms	5372 KB	Output is correct
27	Correct	4 ms	5372 KB	Output is correct
28	Correct	5 ms	5372 KB	Output is correct
29	Correct	5 ms	5372 KB	Output is correct
30	Correct	5 ms	5372 KB	Output is correct
31	Correct	5 ms	5372 KB	Output is correct
32	Correct	4 ms	5372 KB	Output is correct
33	Correct	6 ms	5372 KB	Output is correct
34	Correct	9 ms	5372 KB	Output is correct
35	Correct	30 ms	5372 KB	Output is correct
36	Correct	7 ms	5372 KB	Output is correct
37	Correct	23 ms	5372 KB	Output is correct
38	Correct	34 ms	5376 KB	Output is correct
39	Correct	33 ms	5376 KB	Output is correct
40	Correct	34 ms	5376 KB	Output is correct
41	Correct	35 ms	5376 KB	Output is correct
42	Correct	9 ms	5376 KB	Output is correct
43	Correct	9 ms	5376 KB	Output is correct
44	Correct	27 ms	5376 KB	Output is correct
45	Correct	31 ms	5376 KB	Output is correct
46	Correct	34 ms	5376 KB	Output is correct
47	Correct	46 ms	5752 KB	Output is correct
48	Correct	25 ms	5752 KB	Output is correct
49	Correct	29 ms	5752 KB	Output is correct
50	Correct	16 ms	5752 KB	Output is correct
51	Correct	56 ms	6776 KB	Output is correct
52	Correct	55 ms	6776 KB	Output is correct
53	Correct	44 ms	6776 KB	Output is correct
54	Correct	5 ms	6776 KB	Output is correct
55	Correct	6 ms	6776 KB	Output is correct
56	Execution timed out	1086 ms	6776 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #43930

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 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
0 / 43.0