# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
649183 | gggkik | Space Pirate (JOI14_space_pirate) | C++14 | 468 ms | 820 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;
#define ll long long
const int M = 3010;
int E[M], n;
vector<int> R[M];
ll k;
ll ans[M];
int ck[M], in_cycle[M];
vector<vector<int>> cycle;
void find_cycle(int x){
vector<int> V;
while(!ck[x]) {
ck[x] = 1;
V.push_back(x);
x = E[x];
}
int p = find(V.begin(),V.end(),x) - V.begin();
if(p>=V.size()) return;
cycle.push_back({});
for(int i = p;i<V.size();i++) {
in_cycle[V[i]]=1;
cycle.back().push_back(V[i]);
}
}
void dfs(int x,ll dist,int dep, vector<int> &L){ //
ck[x] = 1;
L.push_back(x);
//fi[v] 가 나에게 온다면?
ans[L[(L.size() - (dist%L.size()))%L.size()]]++;
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... |