oj.uz

Submission #953544

# Submission time Handle Problem Language Result Execution time Memory
953544 2024-03-26T06:38:10 Z Trisanu_Das Robot (JOI21_ho_t4) C++17
34 / 100
 3000 ms 469212 KB 
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define all(a) begin(a), end(a)
#define F first
#define S second
using namespace std;
 
using ll = long long;
 
struct Edge {
  int to, c;
  ll p;
};
 
int const N = 100005;
 
int n, m;
vector<vector<Edge>> adj;
set<pair<int, int>> bio;
ll cost[2 * N];
 
struct Item {
  ll cur_cost;
  int ver;
  int par;
  bool friend operator>(Item const &lhs, Item const &rhs) {
	return lhs.cur_cost > rhs.cur_cost;
  }
};
 
void load() {
  cin >> n >> m;
  adj.resize(n);
  for (int i = 0; i < m; ++i) {
	int u, v, c, p;
	cin >> u >> v >> c >> p;
	--u; -- v;
	adj[u].pb({v, c, p});
	adj[v].pb({u, c, p});
  }
}
 
ll solve() {
  priority_queue<Item, vector<Item>, greater<>> pq;
  pq.push({0, 0, -1});
  while (!pq.empty()) {
	auto [cur_cost, ver, par] = pq.top();
	if (ver == n - 1) return cur_cost;
	pq.pop();
	if (bio.count({par, ver})) continue;
	bio.emplace(par, ver);
	for (auto [u, col, price] : adj[ver]) {
	  if (par == u) continue;
	  cost[col] += price;
	}
	for (auto [u, col, price] : adj[ver]) {
	  if (!bio.count({-1, u})) pq.push({cur_cost + cost[col] - price, u, -1});
	  if (!bio.count({ver, u})) pq.push({cur_cost + price, u, ver});
	}
	for (auto [u, col, price] : adj[ver]) cost[col] = 0;
  }
  return -1;
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  load();
  cout << solve() << '\n';
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 279 ms 18792 KB Output is correct
10 Correct 181 ms 10696 KB Output is correct
11 Correct 8 ms 2808 KB Output is correct
12 Correct 118 ms 10928 KB Output is correct
13 Correct 320 ms 67736 KB Output is correct
14 Correct 313 ms 66404 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 7 ms 860 KB Output is correct
17 Correct 5 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 1712 KB Output is correct
20 Correct 3 ms 728 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 27744 KB Output is correct
2 Correct 144 ms 10052 KB Output is correct
3 Correct 46 ms 12528 KB Output is correct
4 Correct 60 ms 9664 KB Output is correct
5 Execution timed out 3044 ms 469212 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 279 ms 18792 KB Output is correct
10 Correct 181 ms 10696 KB Output is correct
11 Correct 8 ms 2808 KB Output is correct
12 Correct 118 ms 10928 KB Output is correct
13 Correct 320 ms 67736 KB Output is correct
14 Correct 313 ms 66404 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 7 ms 860 KB Output is correct
17 Correct 5 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 1712 KB Output is correct
20 Correct 3 ms 728 KB Output is correct
21 Correct 248 ms 27744 KB Output is correct
22 Correct 144 ms 10052 KB Output is correct
23 Correct 46 ms 12528 KB Output is correct
24 Correct 60 ms 9664 KB Output is correct
25 Execution timed out 3044 ms 469212 KB Time limit exceeded
26 Halted 0 ms 0 KB -