# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852642 | alexdd | Restore Array (RMI19_restore) | C++17 | 1 ms | 348 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;
ifstream fin("input.in");
#define cin fin
int cnt0[5005];
vector<pair<int,int>> con[5005];
int n,m;
void calc_cnt0()
{
deque<int> dq;
dq.push_back(0);
while(!dq.empty())
{
int nod = dq.front();
dq.pop_front();
for(auto x:con[nod])
{
int adj = x.first;
if(cnt0[adj] < cnt0[nod] + x.second && adj!=0)
{
cnt0[adj] = cnt0[nod] + x.second;
dq.push_back(adj);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m;
# | 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... |