# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
809919 | andecaandeci | Longest beautiful sequence (IZhO17_subsequence) | C++17 | 6043 ms | 15660 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>
#define ll long long
#define fi first
#define sec second
#define pb push_back
#define int long long
#define pqueue priority_queue
#define pii pair<int,int>
#define supercepat ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
//GA AC GA LAKI
using namespace std;
int tc,n,tp,rt;
int a[100005],k[100005];
vector<int> adj[100005],adj2[100005];
int dis[100005];
int vis[100005];
vector<int> ans;
int day;
void backtrack(int x){
ans.pb(x);
for(auto i : adj2[x]){
if(dis[i]==dis[x]-1){
backtrack(i);
break;
}
}
}
void dfs(int x){
vis[x]=day;
for(auto i : adj[x]){
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... |