# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174667 | Muhammet | Bridges (APIO19_bridges) | C++17 | 55 ms | 48968 KiB |
#include "bits/stdc++.h"
using namespace std;
const int N = 1e3 + 5;
vector <int> v[N], vis;
multiset <int> mp[N][N];
int ans;
void dfs(int x, int w) {
vis[x] = true;
ans++;
for(auto i : v[x]) {
if(!vis[i] and *mp[x][i].rbegin() >= w) {
dfs(i, w);
}
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector <int> u1(m+1), u2(m+1), d(m+1);
for(int i = 1; i <= m; i++) {
cin >> u1[i] >> u2[i] >> d[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |