oj.uz

Submission #208806

# Submission time Handle Problem Language Result Execution time Memory
208806 2020-03-12T08:04:00 Z YJU Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 71248 KB 
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=3e4+5;
const ll INF=(1LL<<30);
const ld pi=3.14159265359;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()
 
 
ll n,m,b[N],p[N],x,y,dis[N];
vector<ll> P[N],tmp;
vector<pll> v[N];
vector<vector<ll> > lis;
priority_queue<pll,vector<pll>,greater<pll> > pq;
 
int main(){
	scanf("%d%d",&n,&m);
	REP(i,m){
		scanf("%d%d",&b[i],&p[i]);
		P[p[i]].pb(b[i]);
	}
	for(ll step=1;step<N;++step){
		if(!SZ(P[step]))continue;
		lis.clear();lis.resize(step);
		tmp.clear();
		sort(P[step].begin(),P[step].end());
		for(auto i:P[step]){
			lis[i%step].pb(i);
			tmp.pb(i%step);
		}
		sort(tmp.begin(),tmp.end());
		tmp.resize(unique(tmp.begin(),tmp.end())-tmp.begin());
		for(ll i:tmp){
			//sort(lis[i].begin(),lis[i].end());
			for(ll j=1;j<SZ(lis[i]);++j){
				x=lis[i][j-1],y=lis[i][j];
				for(ll ii=x;ii<=y;ii+=step){
					if(ii!=x)v[x].pb(mp(ii,(ii-x)/step));
					if(ii!=y)v[y].pb(mp(ii,(y-ii)/step));
				}
			}
			for(ll ii=lis[i].back()+step;ii<N;ii+=step)x=lis[i].back(),v[x].pb(mp(ii,(ii-x)/step));
			for(ll ii=lis[i][0]-step;ii>=0;ii-=step)x=lis[i][0],v[x].pb(mp(ii,(x-ii)/step));
		}
	}
	REP(i,N)dis[i]=INF;
	pq.push(mp(dis[b[0]]=0,b[0]));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(dis[x]<y)continue;
		for(pll j:v[x])if(dis[j.X]>dis[x]+j.Y)pq.push(mp(dis[j.X]=dis[x]+j.Y,j.X));
	}
	cout<<(dis[b[1]]==INF?-1:dis[b[1]])<<"\n";
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:28: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:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&b[i],&p[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2676 KB Output is correct
2 Correct 9 ms 2420 KB Output is correct
3 Correct 7 ms 2168 KB Output is correct
4 Correct 6 ms 2040 KB Output is correct
5 Correct 12 ms 2996 KB Output is correct
6 Correct 11 ms 2932 KB Output is correct
7 Correct 9 ms 2420 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2676 KB Output is correct
2 Correct 9 ms 2420 KB Output is correct
3 Correct 7 ms 2168 KB Output is correct
4 Correct 6 ms 2040 KB Output is correct
5 Correct 12 ms 2996 KB Output is correct
6 Correct 11 ms 2928 KB Output is correct
7 Correct 9 ms 2420 KB Output is correct
8 Correct 13 ms 3060 KB Output is correct
9 Correct 18 ms 3576 KB Output is correct
10 Correct 35 ms 7184 KB Output is correct
11 Correct 55 ms 15336 KB Output is correct
12 Correct 17 ms 3312 KB Output is correct
13 Correct 10 ms 2556 KB Output is correct
14 Correct 97 ms 22876 KB Output is correct
15 Correct 98 ms 23004 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2676 KB Output is correct
2 Correct 9 ms 2420 KB Output is correct
3 Correct 7 ms 2168 KB Output is correct
4 Correct 7 ms 2040 KB Output is correct
5 Correct 14 ms 2996 KB Output is correct
6 Correct 11 ms 3060 KB Output is correct
7 Correct 9 ms 2420 KB Output is correct
8 Correct 13 ms 3060 KB Output is correct
9 Correct 18 ms 3452 KB Output is correct
10 Correct 35 ms 7184 KB Output is correct
11 Correct 55 ms 15332 KB Output is correct
12 Correct 18 ms 3312 KB Output is correct
13 Correct 10 ms 2548 KB Output is correct
14 Correct 95 ms 22876 KB Output is correct
15 Correct 98 ms 22880 KB Output is correct
16 Correct 15 ms 7156 KB Output is correct
17 Correct 38 ms 8956 KB Output is correct
18 Correct 11 ms 3192 KB Output is correct
19 Correct 9 ms 2680 KB Output is correct
20 Correct 10 ms 2552 KB Output is correct
21 Correct 11 ms 3444 KB Output is correct
22 Correct 10 ms 2936 KB Output is correct
23 Correct 20 ms 4024 KB Output is correct
24 Correct 26 ms 4760 KB Output is correct
25 Correct 20 ms 3572 KB Output is correct
26 Correct 21 ms 3604 KB Output is correct
27 Correct 19 ms 3692 KB Output is correct
28 Correct 18 ms 5492 KB Output is correct
29 Correct 57 ms 12236 KB Output is correct
30 Correct 25 ms 5872 KB Output is correct
31 Correct 32 ms 7664 KB Output is correct
32 Correct 25 ms 6164 KB Output is correct
33 Correct 96 ms 22640 KB Output is correct
34 Correct 98 ms 22640 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2676 KB Output is correct
2 Correct 9 ms 2424 KB Output is correct
3 Correct 6 ms 2168 KB Output is correct
4 Correct 6 ms 2040 KB Output is correct
5 Correct 12 ms 2992 KB Output is correct
6 Correct 11 ms 3060 KB Output is correct
7 Correct 9 ms 2548 KB Output is correct
8 Correct 13 ms 3060 KB Output is correct
9 Correct 18 ms 3452 KB Output is correct
10 Correct 36 ms 7184 KB Output is correct
11 Correct 54 ms 15336 KB Output is correct
12 Correct 17 ms 3312 KB Output is correct
13 Correct 10 ms 2548 KB Output is correct
14 Correct 98 ms 22876 KB Output is correct
15 Correct 97 ms 22948 KB Output is correct
16 Correct 16 ms 7152 KB Output is correct
17 Correct 38 ms 8960 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 8 ms 2680 KB Output is correct
20 Correct 10 ms 2552 KB Output is correct
21 Correct 11 ms 3444 KB Output is correct
22 Correct 9 ms 2936 KB Output is correct
23 Correct 20 ms 4024 KB Output is correct
24 Correct 26 ms 4760 KB Output is correct
25 Correct 21 ms 3572 KB Output is correct
26 Correct 20 ms 3604 KB Output is correct
27 Correct 18 ms 3696 KB Output is correct
28 Correct 18 ms 5492 KB Output is correct
29 Correct 59 ms 12236 KB Output is correct
30 Correct 26 ms 5872 KB Output is correct
31 Correct 32 ms 7664 KB Output is correct
32 Correct 25 ms 6160 KB Output is correct
33 Correct 96 ms 22636 KB Output is correct
34 Correct 101 ms 22768 KB Output is correct
35 Correct 91 ms 26420 KB Output is correct
36 Correct 40 ms 8056 KB Output is correct
37 Correct 92 ms 31128 KB Output is correct
38 Correct 99 ms 30256 KB Output is correct
39 Correct 95 ms 30360 KB Output is correct
40 Correct 95 ms 29840 KB Output is correct
41 Correct 96 ms 30256 KB Output is correct
42 Correct 27 ms 4108 KB Output is correct
43 Correct 24 ms 4088 KB Output is correct
44 Correct 16 ms 3188 KB Output is correct
45 Correct 219 ms 71248 KB Output is correct
46 Correct 225 ms 71144 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2676 KB Output is correct
2 Correct 9 ms 2420 KB Output is correct
3 Correct 7 ms 2168 KB Output is correct
4 Correct 6 ms 2040 KB Output is correct
5 Correct 12 ms 2996 KB Output is correct
6 Correct 11 ms 2932 KB Output is correct
7 Correct 9 ms 2420 KB Output is correct
8 Correct 13 ms 3060 KB Output is correct
9 Correct 18 ms 3452 KB Output is correct
10 Correct 35 ms 7184 KB Output is correct
11 Correct 56 ms 15336 KB Output is correct
12 Correct 17 ms 3440 KB Output is correct
13 Correct 10 ms 2556 KB Output is correct
14 Correct 97 ms 22876 KB Output is correct
15 Correct 97 ms 22996 KB Output is correct
16 Correct 16 ms 7156 KB Output is correct
17 Correct 38 ms 8960 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 10 ms 2936 KB Output is correct
20 Correct 10 ms 2552 KB Output is correct
21 Correct 11 ms 3444 KB Output is correct
22 Correct 10 ms 2936 KB Output is correct
23 Correct 20 ms 3896 KB Output is correct
24 Correct 25 ms 4760 KB Output is correct
25 Correct 21 ms 3572 KB Output is correct
26 Correct 22 ms 3604 KB Output is correct
27 Correct 18 ms 3700 KB Output is correct
28 Correct 18 ms 5488 KB Output is correct
29 Correct 57 ms 12236 KB Output is correct
30 Correct 24 ms 5868 KB Output is correct
31 Correct 32 ms 7664 KB Output is correct
32 Correct 24 ms 6164 KB Output is correct
33 Correct 97 ms 22640 KB Output is correct
34 Correct 96 ms 22640 KB Output is correct
35 Correct 84 ms 26424 KB Output is correct
36 Correct 39 ms 8052 KB Output is correct
37 Correct 92 ms 31128 KB Output is correct
38 Correct 96 ms 30256 KB Output is correct
39 Correct 98 ms 30384 KB Output is correct
40 Correct 98 ms 29844 KB Output is correct
41 Correct 97 ms 30256 KB Output is correct
42 Correct 26 ms 4108 KB Output is correct
43 Correct 25 ms 4088 KB Output is correct
44 Correct 16 ms 3064 KB Output is correct
45 Correct 228 ms 71244 KB Output is correct
46 Correct 221 ms 71144 KB Output is correct
47 Correct 95 ms 23220 KB Output is correct
48 Execution timed out 1081 ms 7744 KB Time limit exceeded
49 Halted 0 ms 0 KB -