# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
893365 | fdnfksd | Airplane (NOI23_airplane) | C++14 | 378 ms | 41724 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 TASKNAME "codeforce"
#define pb push_back
#define pli pair<ll,ll>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxn=4e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll d[3][maxn];
ll n;
vector<ll>g[maxn];
ll a[maxn];
void dij(ll t,ll s)
{
for(int i=1;i<=n;i++) d[t][i]=inf;
d[t][s]=0;
priority_queue<pli,vector<pli>,greater<pli>>pq;
pq.push({d[t][s],s});
while(!pq.empty())
{
ll u=pq.top().se;
pq.pop();
for(int v:g[u])
{
if(d[t][v]>max(d[t][u]+1,a[v]))
{
# | 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... |