| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 995534 | bachhoangxuan | Spy 3 (JOI24_spy3) | C++17 | 58 ms | 5532 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 "Aoi.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pli pair<ll,int>
#define pii pair<int,int>
#define fi first
#define se second
namespace Aoi{
const int maxn = 10005;
const int maxm = 20005;
const ll inf = 1e18;
pli dist[maxn];
vector<pii> edge[maxn];
bool vis[maxn],del[maxm];
int lst[maxn],f[maxm];
string aoi(int N, int M, int Q, int K, vector<int> A, vector<int> B,
vector<ll> C, vector<int> T, vector<int> X){
for(int i=0;i<K;i++) del[X[i]]=true;
for(int i=0;i<M;i++){
edge[A[i]].push_back({B[i],i});
edge[B[i]].push_back({A[i],i});
}
for(int i=0;i<N;i++) dist[i]={inf,-1};
priority_queue<pli,vector<pli>,greater<pli>> pq;
dist[0]={0,-1};pq.push({0,0});
while(!pq.empty()){
auto [d,u]=pq.top();pq.pop();
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||