# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873350 | Yahia_Emara | Logičari (COCI21_logicari) | C++17 | 156 ms | 44052 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 pb push_back
#define ctoi(x) int(x-'0')
#define cdv(x,y) (((x)+(y)-1)/(y))
#define LOOP(n) for(int rp=0;rp<(n);rp++)
#define sz(x) int(x.size())
#define dbg(x) cout << (#x) << " : " << x << endl;
#define sq(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef long double dl;
const int SZ=2e5+7;
int n,dp[SZ][2][2][2][2],X,Y;
bool vs[SZ];
vector<int>G[SZ],g[SZ];
void dfs(int x,int pr=-1){
vs[x]=1;
for(auto&i:G[x]){
if(i==pr)continue;
if(vs[i])X=x,Y=i;
else dfs(i,x),g[x].pb(i),g[i].pb(x);
}
}
int solve(int nd,int pr,int b,int c,int u,int e){
if(nd==Y){
if(e+b!=1)return 1e9;
if(c+u>1)return 1e9;
c+=u;
}
if(pr!=-1&&sz(g[nd])==1){
# | 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... |