# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198592 | Akashi | Restore Array (RMI19_restore) | C++14 | 382 ms | 952 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;
const int INF = 1e9;
int n, m;
struct edge{
int x, y, c;
};
vector <edge> v;
void add_edge(int x, int y, int c){
v.push_back({x, y, c});
}
int d[5005];
queue <int> q;
bool bellman(){
for(int i = 1; i <= n ; ++i) d[i] = INF;
d[0] = 0;
for(int i = 1; i <= n + 1 ; ++i)
for(auto it : v) d[it.y] = min(d[it.y], d[it.x] + it.c);
for(auto it : v)
if(d[it.y] > d[it.x] + it.c) return 0;
return 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... |