# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28625 | 슈퍼스타 tlwpdus (#68) | Alternative Mart (FXCUP2_mart) | C++11 | 4843 ms | 144360 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;
typedef pair<int,int> pii;
int n, m, k, q;
vector<int> mart;
vector<pii> lis[50010];
map<pii,int> fin;
pii rin[2200000];
int p;
int dis[2200000];
int cnt[50010];
vector<int> what[50010];
vector<pii> gd[50010];
int msv = 12;
void dijk() {
int i, j;
priority_queue<pii> pq;
for (i=0;i<2200000;i++) dis[i] = 987654321;
for (i=0;i<k;i++) {
fin[pii(mart[i],mart[i])] = p;
rin[p] = pii(mart[i],mart[i]);
dis[p] = 0;
pq.push(pii(0,p));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |