oj.uz

Submission #1050397

# Submission time Handle Problem Language Result Execution time Memory
1050397 2024-08-09T09:04:50 Z Arp Train (APIO24_train) C++17
0 / 100
 1000 ms 11108 KB 
#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const i64 inf = 1e18;

vector<int> b;

struct item{
	i64 cost;
	int wh;
	item(i64 _cost = 0,int _wh = 0){
		cost = _cost;
		wh = _wh;
	}
	bool operator > (const item & i) const{
		if(i.cost == cost){
			return (wh == 0 ? 0 : b[i.wh - 1]) < (wh == 0 ? 0 : b[wh - 1]);
		}
		return i.cost < cost;		
	}
};

i64 solve(int N, int M, int W, std::vector<int> T,
	vector<int> X, vector<int> Y,
	vector<int> A, vector<int> B, vector<int> C,
	vector<int> L, vector<int> R){

	b = B;

		assert(W == 0);

		vector<vector<int>> adj(N);
		for(int i = 0;i < M;i++){
			adj[X[i]].push_back(i);
		}

		vector<i64> dist(M + 1,inf);

		priority_queue<item,vector<item>,greater<item>> pq;	
		dist[0] = 0;

		pq.push(item(0,0));
		// pq.push(item(1,0,0,0));

		while(!pq.empty()){
			auto top = pq.top();
			pq.pop();

			i64 cost = top.cost;
			int wh = top.wh;
			int u = (wh == 0 ? 0 : Y[wh - 1]);
			int time = B[wh - 1];

			if(dist[wh] != cost){
				continue;
			}

			for(int v : adj[u]){
				if(A[v] >= time && dist[v + 1] > cost + C[v]){
					pq.push(item(cost + C[v],v + 1));
					dist[v + 1] = C[v] + cost;
				}
			}

		}
		i64 ans = inf;
		for(int i = 1;i <= M;i++){
			if(Y[i - 1] == N - 1){
				ans = min(ans,dist[i]);
			}
		}
		if(ans == inf) return -1;
		else return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7180 KB Correct.
2 Correct 50 ms 10596 KB Correct.
3 Correct 0 ms 348 KB Correct.
4 Correct 6 ms 3396 KB Correct.
5 Correct 0 ms 348 KB Correct.
6 Correct 95 ms 7396 KB Correct.
7 Correct 0 ms 348 KB Correct.
8 Execution timed out 1095 ms 11108 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7180 KB Correct.
2 Correct 50 ms 10596 KB Correct.
3 Correct 0 ms 348 KB Correct.
4 Correct 6 ms 3396 KB Correct.
5 Correct 0 ms 348 KB Correct.
6 Correct 95 ms 7396 KB Correct.
7 Correct 0 ms 348 KB Correct.
8 Execution timed out 1095 ms 11108 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -