# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414936 | Pro_ktmr | Stray Cat (JOI20_stray) | C++17 | 74 ms | 21360 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;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
namespace sol1{
vector<int> a = {0, 0, 1, 0, 1, 1};
vector<pair<int,int>> e[100000];
vector<int> ret;
void dfs(int n, int p, int b, int k){
//cout << n << " " << p << " " << b << " " << k << endl;
rep(i, e[n].size()){
if(e[n][i].first == p) continue;
if(e[n].size() >= 3){
if(b == 0){
ret[e[n][i].second] = 1;
dfs(e[n][i].first, n, 1, 2);
}
else{
ret[e[n][i].second] = 0;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |