# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
829953 | vqpahmad | Stray Cat (JOI20_stray) | C++14 | 0 ms | 0 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>
#include "Anthony.h"
using namespace std;
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 7;
const int N = 1e6 + 15;
const ll inf = 1e18;
namespace {
int X[N];
vector<pii> adj[N];
} // namespace
void dfs(int node, int par, int cur){
for (auto it : adj[node]){
if (it.F == node) continue;
X[it.S] = (cur+1)%3;
dfs(it.F, node, X[it.S]);
}
}
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
vector<int> x(M);
for (int i=0;i<M;i++){
adj[U[i]].pb({V[i],i});
adj[V[i]].pb({U[i],i});
}
dfs(1,0,-1);
for (int i=0;i<M;i++){
x[i] = X[i];
}
return x;
}
namespace {
int A, B;
int variable_example = 0;
} // namespace
void Init(int A, int B) {
::A = A;
::B = B;
}
int Move(std::vector<int> y) {
if (y[0]&&y[1]) return 0;
if (y[1]&&y[2]) return 1;
if (y[2]&&y[0]) return 2;
}