# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699468 | Cross_Ratio | Olympic Bus (JOI20_ho_t4) | C++14 | 189 ms | 5580 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>
#define int long long
using namespace std;
const int INF = 1e18;
int dis[205][205];
array<int, 4> Edge[50005];
vector<array<int, 3>> adj1[205];
int dist[205];
bool vis[205];
int adj[205][205];
int opt[205];
signed main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, M;
cin >> N >> M;
int i, j;
clock_t st = clock();
for(i=0;i<N;i++) {
for(j=0;j<N;j++) dis[i][j] = INF;
dis[i][i] = 0;
}
for(i=0;i<M;i++) {
int a, b, c, d;
//a = rand()%N+1, b = rand()%N+1, c = rand(), d = rand();
cin >> a >> b >> c >> d;
Edge[i] = {a-1, b-1, c, d};
dis[a-1][b-1] = min(dis[a-1][b-1], c);
}
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... |