oj.uz

Submission #761520

# Submission time Handle Problem Language Result Execution time Memory
761520 2023-06-19T21:52:46 Z aihay Sky Walking (IOI19_walk) C++14
10 / 100
 4000 ms 540340 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define F first
#define S second
#define PB push_back
#define FR(i,a,b) for(int i=(a);i<(b);i++)
#define FOR(i,n) FR(i,0,n)
#define SZ(x) int(x.size())
const LL MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;

int n,m,s,g,x[100010],h[100010],l[100010],r[100010],y[100010],idxx;
LL cst[1000010],xx;
vector<int> v[5000010];
map<pair<LL,LL>,int> mp;
pair<LL,LL> inter[5000010];
LL dijk(){
	for(int i=0;i<idxx;i++)
		cst[i]=MAAX;
	priority_queue<pair<LL,int>> pq;
	pq.push({0,mp[{x[s],0}]});
	while(pq.size()&&xx<1e7){
		xx++;
		LL cost=-pq.top().F;
		int idx=pq.top().S;
		pq.pop();
		if(cost>cst[idx])
			continue;
		cst[idx]=cost;
		if(idx==mp[{x[g],0}])
			break;
		for(int i=0;i<v[idx].size();i++){
			xx++;
			int x1=inter[idx].F,x2=inter[v[idx][i]].F;
			int y1=inter[idx].S,y2=inter[v[idx][i]].S;
			LL ncst=cost+abs(x2-x1)+abs(y2-y1);
			int nidx=v[idx][i];
			if(ncst<cst[nidx]){
				cst[nidx]=ncst;
				pq.push({-ncst,nidx});
			}
		}
	}
	if(cst[mp[{x[g],0}]]==MAAX)
		cst[mp[{x[g],0}]]=-1;
	return cst[mp[{x[g],0}]];
}
map<int,vector<int>> vec;
LL min_distance(vector<int> X,vector<int> H,vector<int> L,vector<int> R,vector<int> Y,int S,int G){
	n=X.size();
	m=L.size();
	s=S,g=G;
	for(int i=0;i<n;i++){
		x[i]=X[i];
		h[i]=H[i];
		vec[x[i]].PB(0);
	}
	mp[{x[s],0}]=idxx++;
	inter[0]={x[s],0};
	mp[{x[g],0}]=idxx++;
	inter[1]={x[g],0};
	for(int i=0;i<n;i++){
		if(mp[{x[i],0}]==0){
			mp[{x[i],0}]=idxx++;
			inter[idxx-1]={x[i],0};
		}
	}
	for(int i=0;i<m;i++){
		l[i]=L[i];
		r[i]=R[i];
		y[i]=Y[i];
		int lst=-1;
		for(int j=l[i];j<=r[i];j++){
			if(h[j]<y[i])
				continue;
			if(mp[{x[j],y[i]}]==0){
				mp[{x[j],y[i]}]=idxx++;
				inter[idxx-1]={x[j],y[i]};
			}
			if(~lst){
				v[mp[{x[lst],y[i]}]].PB(mp[{x[j],y[i]}]);
				v[mp[{x[j],y[i]}]].PB(mp[{x[lst],y[i]}]);
			}
			vec[x[j]].PB(y[i]);
			lst=j;
		}
	}
	for(int i=0;i<n;i++){
		sort(vec[x[i]].begin(),vec[x[i]].end());
		for(int j=1;j<vec[x[i]].size();j++){
			v[mp[{x[i],vec[x[i]][j]}]].PB(mp[{x[i],vec[x[i]][j-1]}]);
			v[mp[{x[i],vec[x[i]][j-1]}]].PB(mp[{x[i],vec[x[i]][j]}]);
		}
	}
	return dijk();
}

Compilation message

walk.cpp: In function 'LL dijk()':
walk.cpp:34:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |   for(int i=0;i<v[idx].size();i++){
      |               ~^~~~~~~~~~~~~~
walk.cpp: In function 'LL min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:92:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   for(int j=1;j<vec[x[i]].size();j++){
      |               ~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117668 KB Output is correct
2 Correct 54 ms 117680 KB Output is correct
3 Correct 55 ms 117708 KB Output is correct
4 Correct 64 ms 117708 KB Output is correct
5 Correct 54 ms 117712 KB Output is correct
6 Correct 63 ms 117712 KB Output is correct
7 Correct 55 ms 117792 KB Output is correct
8 Correct 54 ms 117784 KB Output is correct
9 Correct 54 ms 117708 KB Output is correct
10 Correct 54 ms 117828 KB Output is correct
11 Correct 54 ms 117704 KB Output is correct
12 Correct 54 ms 117756 KB Output is correct
13 Correct 56 ms 117860 KB Output is correct
14 Correct 54 ms 117756 KB Output is correct
15 Correct 54 ms 117624 KB Output is correct
16 Correct 55 ms 117660 KB Output is correct
17 Correct 55 ms 117836 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117664 KB Output is correct
2 Correct 56 ms 117696 KB Output is correct
3 Correct 1391 ms 210552 KB Output is correct
4 Correct 1819 ms 232076 KB Output is correct
5 Correct 1430 ms 217836 KB Output is correct
6 Correct 1632 ms 208364 KB Output is correct
7 Correct 1413 ms 217952 KB Output is correct
8 Correct 1716 ms 234836 KB Output is correct
9 Correct 1666 ms 214160 KB Output is correct
10 Correct 2470 ms 267708 KB Output is correct
11 Correct 794 ms 173908 KB Output is correct
12 Correct 669 ms 169792 KB Output is correct
13 Correct 2229 ms 252912 KB Output is correct
14 Correct 2649 ms 168152 KB Output is correct
15 Correct 1733 ms 169776 KB Output is correct
16 Correct 753 ms 168924 KB Output is correct
17 Correct 730 ms 167320 KB Output is correct
18 Execution timed out 4094 ms 152696 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 130984 KB Output is correct
2 Execution timed out 4113 ms 540340 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 130984 KB Output is correct
2 Execution timed out 4113 ms 540340 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117668 KB Output is correct
2 Correct 54 ms 117680 KB Output is correct
3 Correct 55 ms 117708 KB Output is correct
4 Correct 64 ms 117708 KB Output is correct
5 Correct 54 ms 117712 KB Output is correct
6 Correct 63 ms 117712 KB Output is correct
7 Correct 55 ms 117792 KB Output is correct
8 Correct 54 ms 117784 KB Output is correct
9 Correct 54 ms 117708 KB Output is correct
10 Correct 54 ms 117828 KB Output is correct
11 Correct 54 ms 117704 KB Output is correct
12 Correct 54 ms 117756 KB Output is correct
13 Correct 56 ms 117860 KB Output is correct
14 Correct 54 ms 117756 KB Output is correct
15 Correct 54 ms 117624 KB Output is correct
16 Correct 55 ms 117660 KB Output is correct
17 Correct 55 ms 117836 KB Output is correct
18 Correct 55 ms 117664 KB Output is correct
19 Correct 56 ms 117696 KB Output is correct
20 Correct 1391 ms 210552 KB Output is correct
21 Correct 1819 ms 232076 KB Output is correct
22 Correct 1430 ms 217836 KB Output is correct
23 Correct 1632 ms 208364 KB Output is correct
24 Correct 1413 ms 217952 KB Output is correct
25 Correct 1716 ms 234836 KB Output is correct
26 Correct 1666 ms 214160 KB Output is correct
27 Correct 2470 ms 267708 KB Output is correct
28 Correct 794 ms 173908 KB Output is correct
29 Correct 669 ms 169792 KB Output is correct
30 Correct 2229 ms 252912 KB Output is correct
31 Correct 2649 ms 168152 KB Output is correct
32 Correct 1733 ms 169776 KB Output is correct
33 Correct 753 ms 168924 KB Output is correct
34 Correct 730 ms 167320 KB Output is correct
35 Execution timed out 4094 ms 152696 KB Time limit exceeded
36 Halted 0 ms 0 KB -