# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12809 | qja0950 | Dreaming (IOI13_dreaming) | C++98 | 105 ms | 8696 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 "dreaming.h"
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 101101
typedef long long ll;
vector< pair<int, int> > V[MAX_N];
vector<int> RadSort;
queue<int> Q;
int Check[MAX_N];
int Dis[MAX_N];
int N, M, L;
int Ans;
int Find_Last(int first, int checkp) {
ll LastDis = -1;
int LastInd = -1;
Check[first] = checkp;
Dis[first] = 0;
while(!Q.empty()) Q.pop();
Q.push(first);
while(!Q.empty()) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |