oj.uz

답안 #762100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762100 2023-06-20T19:58:26 Z aihay Sky Walking (IOI19_walk) C++14
24 / 100
 4000 ms 796176 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#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;
pair<int,int> srtb[100010];
pair<int,pair<int,int>> srts[100010];
LL cst[1000010];
vector<int> v[5000010];
map<pair<int,int>,int> mp;
map<int,int> comp;
int dcomp[100010];
pair<int,int> 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()){
		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++){
			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];
		comp[x[i]]=i;
		h[i]=H[i];
		vec[x[i]].PB(0);
		srtb[i]={-h[i],x[i]};
	}
	sort(srtb,srtb+n);
	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++){
		srtb[i].F*=-1;
		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];
		if(r[i]-l[i]>100)
			srts[i]={-y[i],{x[l[i]],x[r[i]]}};
		else{
			srts[i]={1,{-1,-1}};
			int lst=-1;
			for(int j=l[i];j<=r[i];j++){
				if(h[j]<y[i])
					continue;
				int xx=mp[{x[j],y[i]}];
				if(xx==0){
					mp[{x[j],y[i]}]=xx=idxx++;
					inter[idxx-1]={x[j],y[i]};
					vec[x[j]].PB(y[i]);
				}
				if(~lst){
					v[lst].PB(xx);
					v[xx].PB(lst);
				}
				lst=xx;
			}
		}
	}
	sort(srts,srts+m);
	set<int> curst;
	int idx=0;
	for(int i=0;i<m;i++){
		if(srts[i].F==1)
			break;
		srts[i].F=-srts[i].F;
		while(idx<n&&srtb[idx].F>=srts[i].F)
			curst.insert(srtb[idx++].S);
		int lst=-1;
		for(set<int>::iterator j=curst.lower_bound(srts[i].S.F);j!=curst.end()&&(*j)<=srts[i].S.S;j++){
			int xx=mp[{(*j),srts[i].F}];
			if(xx==0){
				mp[{(*j),srts[i].F}]=xx=idxx++;
				inter[idxx-1]={(*j),srts[i].F};
				vec[(*j)].PB(srts[i].F);
			}
			if(~lst){
				v[lst].PB(xx);
				v[xx].PB(lst);
			}
			lst=xx;
		}
	}
	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:40:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   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:131:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |   for(int j=1;j<vec[x[i]].size();j++){
      |               ~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117736 KB Output is correct
2 Correct 53 ms 117636 KB Output is correct
3 Correct 56 ms 117704 KB Output is correct
4 Correct 56 ms 117708 KB Output is correct
5 Correct 58 ms 117812 KB Output is correct
6 Correct 60 ms 117716 KB Output is correct
7 Correct 56 ms 117708 KB Output is correct
8 Correct 57 ms 117712 KB Output is correct
9 Correct 54 ms 117680 KB Output is correct
10 Correct 56 ms 117856 KB Output is correct
11 Correct 54 ms 117784 KB Output is correct
12 Correct 56 ms 117760 KB Output is correct
13 Correct 63 ms 117724 KB Output is correct
14 Correct 55 ms 117668 KB Output is correct
15 Correct 64 ms 117744 KB Output is correct
16 Correct 56 ms 117688 KB Output is correct
17 Correct 55 ms 117832 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 117628 KB Output is correct
2 Correct 54 ms 117692 KB Output is correct
3 Correct 1152 ms 208008 KB Output is correct
4 Correct 1691 ms 233848 KB Output is correct
5 Correct 1266 ms 224916 KB Output is correct
6 Correct 1155 ms 216092 KB Output is correct
7 Correct 1255 ms 224980 KB Output is correct
8 Correct 1441 ms 230936 KB Output is correct
9 Correct 1321 ms 216336 KB Output is correct
10 Correct 2308 ms 267996 KB Output is correct
11 Correct 829 ms 176064 KB Output is correct
12 Correct 705 ms 175792 KB Output is correct
13 Correct 2082 ms 253644 KB Output is correct
14 Correct 579 ms 178824 KB Output is correct
15 Correct 643 ms 180332 KB Output is correct
16 Correct 651 ms 178136 KB Output is correct
17 Correct 668 ms 172716 KB Output is correct
18 Correct 482 ms 175552 KB Output is correct
19 Correct 82 ms 120780 KB Output is correct
20 Correct 299 ms 148232 KB Output is correct
21 Correct 600 ms 167756 KB Output is correct
22 Correct 638 ms 175204 KB Output is correct
23 Correct 789 ms 187736 KB Output is correct
24 Correct 665 ms 177704 KB Output is correct
25 Correct 671 ms 171340 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 130380 KB Output is correct
2 Execution timed out 4083 ms 796176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 130380 KB Output is correct
2 Execution timed out 4083 ms 796176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117736 KB Output is correct
2 Correct 53 ms 117636 KB Output is correct
3 Correct 56 ms 117704 KB Output is correct
4 Correct 56 ms 117708 KB Output is correct
5 Correct 58 ms 117812 KB Output is correct
6 Correct 60 ms 117716 KB Output is correct
7 Correct 56 ms 117708 KB Output is correct
8 Correct 57 ms 117712 KB Output is correct
9 Correct 54 ms 117680 KB Output is correct
10 Correct 56 ms 117856 KB Output is correct
11 Correct 54 ms 117784 KB Output is correct
12 Correct 56 ms 117760 KB Output is correct
13 Correct 63 ms 117724 KB Output is correct
14 Correct 55 ms 117668 KB Output is correct
15 Correct 64 ms 117744 KB Output is correct
16 Correct 56 ms 117688 KB Output is correct
17 Correct 55 ms 117832 KB Output is correct
18 Correct 54 ms 117628 KB Output is correct
19 Correct 54 ms 117692 KB Output is correct
20 Correct 1152 ms 208008 KB Output is correct
21 Correct 1691 ms 233848 KB Output is correct
22 Correct 1266 ms 224916 KB Output is correct
23 Correct 1155 ms 216092 KB Output is correct
24 Correct 1255 ms 224980 KB Output is correct
25 Correct 1441 ms 230936 KB Output is correct
26 Correct 1321 ms 216336 KB Output is correct
27 Correct 2308 ms 267996 KB Output is correct
28 Correct 829 ms 176064 KB Output is correct
29 Correct 705 ms 175792 KB Output is correct
30 Correct 2082 ms 253644 KB Output is correct
31 Correct 579 ms 178824 KB Output is correct
32 Correct 643 ms 180332 KB Output is correct
33 Correct 651 ms 178136 KB Output is correct
34 Correct 668 ms 172716 KB Output is correct
35 Correct 482 ms 175552 KB Output is correct
36 Correct 82 ms 120780 KB Output is correct
37 Correct 299 ms 148232 KB Output is correct
38 Correct 600 ms 167756 KB Output is correct
39 Correct 638 ms 175204 KB Output is correct
40 Correct 789 ms 187736 KB Output is correct
41 Correct 665 ms 177704 KB Output is correct
42 Correct 671 ms 171340 KB Output is correct
43 Correct 170 ms 130380 KB Output is correct
44 Execution timed out 4083 ms 796176 KB Time limit exceeded
45 Halted 0 ms 0 KB -