oj.uz

Submission #43934

# Submission time Handle Problem Language Result Execution time Memory
43934 2018-03-28T11:06:53 Z Kerim Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 765 ms 262144 KB 
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define MAXN 30009
#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;}
PII arr[MAXN];
int dis[MAXN];
vector<PII>adj[MAXN];
int s,t;
set<int>st[MAXN];
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(i==1)
			s=u;
		if(i==2)
			t=u;
		arr[i]=mp(u,v);	
	}
	sort(arr+1,arr+m+1);
	for(int i=m;i>=1;i--){
		int cur=1;
		int u=arr[i].ff,v=arr[i].ss;
		for(int j=u+v;j<n;j+=v){
			adj[u].pb(mp(j,cur));	
			//~ cout<<u<<" "<<j<<" "<<cur<<endl;
			if(st[j].count(v))
				break;
			//might be break condition
			cur++;
		}
		st[u].insert(v);
	}
	for(int i=1;i<=m;i++){
		int cur=1;
		int u=arr[i].ff,v=arr[i].ss;
		for(int j=u-v;j>=0;j-=v){
			//~ cout<<u<<" "<<j<<" "<<cur<<endl;
			adj[u].pb(mp(j,cur));	
			if(st[j].count(v))
				break;
			//might be break condition
			cur++;
		}
		st[u].insert(v);
	}
	priority_queue<pair<int,int> >q;
	q.push(mp(0,s));
	for(int i=0;i<n;i++)
		dis[i]=INF;
	dis[s]=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])
			if(umin(dis[it->ff],dis[nd]+it->ss))
				q.push(mp(-dis[it->ff],it->ff));
	}
	if(dis[t]==INF)
		dis[t]=-1;
	printf("%d\n",dis[t]);
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:31: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:34: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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2428 KB Output is correct
2 Correct 4 ms 2536 KB Output is correct
3 Correct 4 ms 2536 KB Output is correct
4 Correct 3 ms 2536 KB Output is correct
5 Correct 5 ms 2536 KB Output is correct
6 Correct 4 ms 2588 KB Output is correct
7 Correct 3 ms 2720 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4844 KB Output is correct
2 Correct 3 ms 4844 KB Output is correct
3 Correct 3 ms 4844 KB Output is correct
4 Correct 3 ms 4844 KB Output is correct
5 Correct 3 ms 4844 KB Output is correct
6 Correct 3 ms 4844 KB Output is correct
7 Correct 4 ms 4844 KB Output is correct
8 Correct 4 ms 4844 KB Output is correct
9 Correct 4 ms 4844 KB Output is correct
10 Correct 4 ms 4844 KB Output is correct
11 Correct 4 ms 4844 KB Output is correct
12 Correct 9 ms 4852 KB Output is correct
13 Correct 4 ms 4852 KB Output is correct
14 Correct 4 ms 4852 KB Output is correct
15 Correct 4 ms 4852 KB Output is correct
16 Correct 4 ms 4852 KB Output is correct
17 Correct 7 ms 4852 KB Output is correct
18 Correct 4 ms 4852 KB Output is correct
19 Correct 4 ms 4852 KB Output is correct
20 Correct 4 ms 4852 KB Output is correct
21 Correct 4 ms 4852 KB Output is correct
22 Correct 5 ms 4852 KB Output is correct
23 Correct 5 ms 4852 KB Output is correct
24 Correct 5 ms 4852 KB Output is correct
25 Correct 5 ms 4852 KB Output is correct
26 Correct 110 ms 35648 KB Output is correct
27 Correct 85 ms 35652 KB Output is correct
28 Correct 5 ms 35652 KB Output is correct
29 Correct 6 ms 35652 KB Output is correct
30 Correct 4 ms 35652 KB Output is correct
31 Correct 6 ms 35652 KB Output is correct
32 Correct 5 ms 35652 KB Output is correct
33 Correct 7 ms 35652 KB Output is correct
34 Correct 8 ms 35652 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 35652 KB Output is correct
2 Correct 4 ms 35652 KB Output is correct
3 Correct 4 ms 35652 KB Output is correct
4 Correct 4 ms 35652 KB Output is correct
5 Correct 4 ms 35652 KB Output is correct
6 Correct 4 ms 35652 KB Output is correct
7 Correct 3 ms 35652 KB Output is correct
8 Correct 4 ms 35652 KB Output is correct
9 Correct 3 ms 35652 KB Output is correct
10 Correct 4 ms 35652 KB Output is correct
11 Correct 6 ms 35652 KB Output is correct
12 Correct 9 ms 35652 KB Output is correct
13 Correct 4 ms 35652 KB Output is correct
14 Correct 5 ms 35652 KB Output is correct
15 Correct 4 ms 35652 KB Output is correct
16 Correct 4 ms 35652 KB Output is correct
17 Correct 6 ms 35652 KB Output is correct
18 Correct 4 ms 35652 KB Output is correct
19 Correct 4 ms 35652 KB Output is correct
20 Correct 4 ms 35652 KB Output is correct
21 Correct 5 ms 35652 KB Output is correct
22 Correct 5 ms 35652 KB Output is correct
23 Correct 5 ms 35652 KB Output is correct
24 Correct 6 ms 35652 KB Output is correct
25 Correct 6 ms 35652 KB Output is correct
26 Correct 94 ms 35652 KB Output is correct
27 Correct 89 ms 35744 KB Output is correct
28 Correct 5 ms 35744 KB Output is correct
29 Correct 7 ms 35744 KB Output is correct
30 Correct 4 ms 35744 KB Output is correct
31 Correct 6 ms 35744 KB Output is correct
32 Correct 6 ms 35744 KB Output is correct
33 Correct 9 ms 35744 KB Output is correct
34 Correct 8 ms 35744 KB Output is correct
35 Correct 34 ms 35744 KB Output is correct
36 Correct 10 ms 35744 KB Output is correct
37 Correct 34 ms 35744 KB Output is correct
38 Correct 35 ms 35744 KB Output is correct
39 Correct 43 ms 35744 KB Output is correct
40 Correct 33 ms 35744 KB Output is correct
41 Correct 47 ms 35744 KB Output is correct
42 Runtime error 765 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 262144 KB Output is correct
2 Correct 3 ms 262144 KB Output is correct
3 Correct 4 ms 262144 KB Output is correct
4 Correct 3 ms 262144 KB Output is correct
5 Correct 4 ms 262144 KB Output is correct
6 Correct 4 ms 262144 KB Output is correct
7 Correct 3 ms 262144 KB Output is correct
8 Correct 4 ms 262144 KB Output is correct
9 Correct 4 ms 262144 KB Output is correct
10 Correct 4 ms 262144 KB Output is correct
11 Correct 5 ms 262144 KB Output is correct
12 Correct 8 ms 262144 KB Output is correct
13 Correct 5 ms 262144 KB Output is correct
14 Correct 6 ms 262144 KB Output is correct
15 Correct 6 ms 262144 KB Output is correct
16 Correct 4 ms 262144 KB Output is correct
17 Correct 7 ms 262144 KB Output is correct
18 Correct 5 ms 262144 KB Output is correct
19 Correct 6 ms 262144 KB Output is correct
20 Correct 6 ms 262144 KB Output is correct
21 Correct 4 ms 262144 KB Output is correct
22 Correct 5 ms 262144 KB Output is correct
23 Correct 4 ms 262144 KB Output is correct
24 Correct 6 ms 262144 KB Output is correct
25 Correct 6 ms 262144 KB Output is correct
26 Correct 88 ms 262144 KB Output is correct
27 Correct 94 ms 262144 KB Output is correct
28 Correct 6 ms 262144 KB Output is correct
29 Correct 6 ms 262144 KB Output is correct
30 Correct 4 ms 262144 KB Output is correct
31 Correct 6 ms 262144 KB Output is correct
32 Correct 5 ms 262144 KB Output is correct
33 Correct 7 ms 262144 KB Output is correct
34 Correct 8 ms 262144 KB Output is correct
35 Correct 24 ms 262144 KB Output is correct
36 Correct 8 ms 262144 KB Output is correct
37 Correct 26 ms 262144 KB Output is correct
38 Correct 31 ms 262144 KB Output is correct
39 Correct 36 ms 262144 KB Output is correct
40 Correct 36 ms 262144 KB Output is correct
41 Correct 31 ms 262144 KB Output is correct
42 Runtime error 649 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -