# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915813 | andrei_iorgulescu | Shell (info1cup18_shell) | C++14 | 207 ms | 58236 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;
#define int long long
int modulo = 1e9 + 7;
int n,m,p,drum[1000005];
vector<int>g[1000005];
int dp[1000005],cine[1000005];
bool viz[1000005];
void dfs(int nod)
{
if (nod == n)
dp[nod] = 1,cine[nod] = p,viz[nod] = true;
else
{
viz[nod] = true;
cine[nod] = 1e9;
if (g[nod].size() == 0)
return;
for (auto vecin : g[nod])
if (!viz[vecin])
dfs(vecin);
int mn = 1e9;
for (auto vecin : g[nod])
mn = min(mn,cine[vecin]);
cine[nod] = mn;
if (mn < 1e9 and drum[mn - 1] == nod)
# | 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... |