Submission #1087992

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1087992	2024-09-13 16:30:58	vuavisao	Valley (BOI19_valley)	C++14	100 / 100	106 ms	38996 KiB

valley

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = (int) 1e5 + 10;
const long long INF = (long long) 1e18;
int n, numStores, q, escape;
tuple<int, int, int> edges[N];
int positionStore[N];
namespace sub12 {
  bool check() {
    return (1ll * n * q <= (long long) 1e7);
  }
  
  vector<vector<pair<int, int>>> g;
  long long dist[N];
  void solve() {
    g.resize(n + 1);
    while (q -- > 0) {
      for (int u = 1; u <= n; ++ u) {
        g[u].clear();
        dist[u] = INF;
      }
      int path, curPosition; cin >> path >> curPosition;
      for (int i = 1; i <= n - 1; ++ i) {
        if (i == path) continue;
        int u = get<0>(edges[i]), v = get<1>(edges[i]), w = get<2>(edges[i]);
        g[u].push_back(make_pair(v, w));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 27 / 27
• Subtask 3: 23 / 23
• Subtask 4: 41 / 41