# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90121 | Harvey_Rollens | Evacuation plan (IZhO18_plan) | C++17 | 4091 ms | 56148 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 ll long long
#define ld long double
#define st string
#define fr first
#define se second
const ll mod=998244353;
using namespace std;
vector<pair<ll, ll> > v[100010];
priority_queue<pair<ll, ll> > q;
ll a[100010], n, m, k, ans=0;
map<ll, ll> dp[100200], us;
void dej(ll xx)
{
for(ll i=1; i<=n; i++)
dp[xx][i]=1e10;
dp[xx][xx]=0;
q.push({xx, dp[xx][xx]});
while(!q.empty())
{
ll x=q.top().fr, s=q.top().se;
q.pop();
if(s>dp[xx][x])
continue;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |