Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using ll = long long;
- using ull = unsigned long long;
- const ll MAXN = 1e5 + 1;
- bool used[MAXN] {false};
- vector<set<int>> v;
- ll c[MAXN][MAXN];
- void dfs(int edge) {
- used[edge] = true;
- for (auto u : v[edge])
- if (!used[u]) {
- dfs(u);
- }
- }
- void solve() {
- ios::sync_with_stdio(false);
- cin.tie(NULL);
- int n, m;
- cin >> n >> m;
- v.resize(m);
- for (int i = 0; i < m; i++) {
- int a, b;
- ll c1;
- cin >> a >> b >> c1;
- a--, b--;
- v[a].insert(b);
- v[b].insert(a);
- c[a][b] = c1;
- }
- int q;
- cin >> q;
- for (int i = 0; i < q; i++) {
- int key, a, b;
- ll c1;
- cin >> key;
- if (key == 1) {
- cin >> a >> b >> c1;
- v[a].insert(b);
- v[b].insert(a);
- c[a][b] = c1;
- }
- if (key == 2) {
- cin >> a >> b;
- v[a].erase(b);
- c[a][b] = -1; // отмена рейса, cost = -1
- }
- if (key == 3) {
- cin >> a >> b;
- //поиск кратчайшего пути // длина - не более 2
- }
- }
- }
- int main() {
- solve();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement