oj.uz

답안 #943121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943121 2024-03-11T08:30:44 Z MilosMilutinovic Escape Route (JOI21_escape_route) C++17
5 / 100
 9000 ms 171520 KB 
#include "escape_route.h"
#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

const ll inf=(ll)1e18;
int n,tot;
int v[100005],nxt[100005],h[95];
ll s,c[100005],b[100005],res[3000005];
vector<pair<ll,int>> qs[95][95];
pair<ll,ll> d[95];

void addedge(int x,int y,ll w,ll t){
	v[++tot]=y; c[tot]=w; b[tot]=t; nxt[tot]=h[x]; h[x]=tot;
	v[++tot]=x; c[tot]=w; b[tot]=t; nxt[tot]=h[y]; h[y]=tot;
}

pair<ll,ll> dijkstra(int u,int v,ll t){
	for(int i=0;i<n;i++) d[i]=mp(inf,0ll);
	d[u]=mp(0,t);
	set<pair<pair<ll,ll>,int>> st;
	st.emplace(mp(d[u],u));
	while(!st.empty()){
		auto it=st.begin();
		int x=it->se;
		st.erase(it);
		for(int p=h[x];p;p=nxt[p]){
			pair<ll,ll> nd;
			if(d[x].se+c[p]<=b[p]){
				nd.fi=d[x].fi;
				nd.se=d[x].se+c[p];
			}else{
				nd.fi=d[x].fi+1;
				nd.se=c[p];
			}
			if(nd<d[::v[p]]){
				if(d[::v[p]].fi!=inf) st.erase(st.find(mp(d[::v[p]],::v[p])));
				d[::v[p]]=nd;
				st.insert(mp(d[::v[p]],::v[p]));
			}
		}
	}
	return d[v];
}

vector<ll> calculate_necessary_time(
	int N,int M,ll S,int Q,vector<int> A,vector<int> B,
	vector<ll> L,vector<ll> C,vector<int> U,
	vector<int> V,vector<ll> T){
	n=N; s=S;
	for(int i=0;i<M;i++) addedge(A[i],B[i],L[i],C[i]);
	for(int i=0;i<Q;i++){
		qs[U[i]][V[i]].pb(mp(T[i],i));
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			for(auto&p:qs[i][j]){
				pair<ll,ll> tm=dijkstra(i,j,p.fi);
				res[p.se]=tm.fi*s+tm.se-p.fi;
			}
		}
	}
	vector<ll> ret;
	for(int i=0;i<Q;i++) ret.pb(res[i]);
	return ret;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 67400 KB Output is correct
2 Correct 21 ms 67416 KB Output is correct
3 Correct 39 ms 67420 KB Output is correct
4 Correct 10 ms 67672 KB Output is correct
5 Correct 16 ms 67672 KB Output is correct
6 Correct 12 ms 67420 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 9093 ms 171520 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 67400 KB Output is correct
2 Correct 21 ms 67416 KB Output is correct
3 Correct 39 ms 67420 KB Output is correct
4 Correct 10 ms 67672 KB Output is correct
5 Correct 16 ms 67672 KB Output is correct
6 Correct 12 ms 67420 KB Output is correct
7 Execution timed out 9093 ms 171520 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 67400 KB Output is correct
2 Correct 21 ms 67416 KB Output is correct
3 Correct 39 ms 67420 KB Output is correct
4 Correct 10 ms 67672 KB Output is correct
5 Correct 16 ms 67672 KB Output is correct
6 Correct 12 ms 67420 KB Output is correct
7 Execution timed out 9093 ms 171520 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 67400 KB Output is correct
2 Correct 21 ms 67416 KB Output is correct
3 Correct 39 ms 67420 KB Output is correct
4 Correct 10 ms 67672 KB Output is correct
5 Correct 16 ms 67672 KB Output is correct
6 Correct 12 ms 67420 KB Output is correct
7 Execution timed out 9093 ms 171520 KB Time limit exceeded
8 Halted 0 ms 0 KB -