# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503456 | 79brue | 철도 요금 (JOI16_ho_t3) | C++14 | 119 ms | 18968 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge{
int s, e, x;
Edge(){}
Edge(int s, int e, int x): s(s), e(e), x(x){}
};
int n, m, q;
bool edgeValid[200002];
Edge arr[200002];
vector<Edge> link[200002];
int dist[200002];
int ans;
int indeg[200002];
bool edgeVisited[200002];
void bfs(){
vector<bool> visited (n+10);
visited[1] = 1;
queue<int> que; que.push(1);
while(!que.empty()){
int x = que.front(); que.pop();
for(auto y: link[x]){
if(visited[y.e]) continue;
visited[y.e] = 1;
Compilation message (stderr)
# | 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... |