# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981075 | Abito | Swapping Cities (APIO20_swap) | C++17 | 2048 ms | 38212 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 "swap.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define ep insert
#define pb push_back
using namespace std;
const int NN=1e3+5;
int n,m,dis[NN][NN];
vector<pair<int,int>> adj[NN];
bool vis[NN][NN];
void dijkstra(int X,int Y){
memset(dis,-1,sizeof(dis));
memset(vis,0,sizeof(vis));
dis[X][Y]=0;
priority_queue<vector<int>> pq;
pq.push({0,X,Y});
while (!pq.empty()){
int i=pq.top()[1],j=pq.top()[2];
pq.pop();
if (vis[i][j]) continue;
vis[i][j]=1;
for (auto u:adj[i]){
if (u.F==j) continue;
int d=max(dis[i][j],u.S);
if (d<dis[u.F][j] || dis[u.F][j]<0){
dis[u.F][j]=d;
pq.push({-d,u.F,j});
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |