oj.uz

답안 #623187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623187 2022-08-05T09:55:53 Z Dremix10 Sky Walking (IOI19_walk) C++17
0 / 100
 4000 ms 143316 KB 
#include "walk.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define all(x) (x).begin(),(x).end()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = "<<x.F<<"-"<<x.S<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto v : x)cerr<<v.F<<"-"<<v.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
	#define pp(x) {}
    #define pv(x) {}
    #define ppv(x) {}
#endif
const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;

struct ano{
	int x,who;
	ll d;

	bool operator<(const ano &x)const{
		return d > x.d;
	}
};

long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
	int n = x.size();
	int m = l.size();

	vector<vector<int> > a(n+m+1);

	int i,j;
	vector<vector<pi> > in(n),out(n);
	for(j=0;j<m;j++){
		in[l[j]].push_back({y[j],n+j});
		out[r[j]].push_back({y[j],n+j});
	}
	set<pi> st;
	for(i=0;i<n;i++){
		for(auto &x : in[i])st.insert(x);

		for(auto &x : st){
			if(x.F > h[i])break;
			j = x.S;
			a[i].push_back(j);
			a[j].push_back(i);
		}

		for(auto &x : out[i])st.erase(x);
	}
	//if(n > 50)assert(0);
	priority_queue<ano> q;
	
	vector<__gnu_pbds::gp_hash_table<int,ll> > d(n+m+1,__gnu_pbds::gp_hash_table<int,ll>());
	//vector<pl> dd(n+m,{INF,INF});
	
	q.push({s,n+m,0});

	int cnter=0;
	for(i=0;i<n+m;i++){
		for(auto &v : a[i]){
			d[i][v] = INF;
			cnter++;
		}
	}
	if(n>50)
		assert(cnter <= (m*10*2));
	d[s][n+m] = 0;
	y.push_back(0);
	//dd[s] = {0,h[s]};
	int cost;
	ll gg;
	ano temp;
	while(!q.empty()){
		temp = q.top();
		q.pop();
		gg = d[temp.x][temp.who];

		if(temp.d > gg)continue;
		
		

		if(temp.x >= n){
			for(auto &v : a[temp.x]){
				if(v == temp.who)continue;
				
				cost = abs(x[temp.who] - x[v]);

				
				if(d[v][temp.x] > gg + cost){
					d[v][temp.x] = gg + cost;
					d[temp.x][v] = gg + cost;
					q.push({v,temp.x,gg+cost});
				}
			}
		}
		else{
			/// not sky
			for(auto &v : a[temp.x]){
				if(v == temp.who)continue;
			
				cost = abs(y[temp.who-n] - y[v-n]);
				d[temp.x][v] = gg + cost;
				if(d[v][temp.x] > gg + cost){
					d[v][temp.x] = gg + cost;
					d[temp.x][v] = gg + cost;
					q.push({v,temp.x,gg+cost});
				}
			}
		}
	}
	ll ans = INF;
	for(auto v : a[g]){
		ans = min(ans,d[g][v]+y[v-n]);
	}
	if(ans == INF)ans = -1;
	return ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 4025 ms 143316 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 106 ms 31536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 106 ms 31536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -