제출 #670326

#제출 시각아이디문제언어결과실행 시간메모리
670326MilosMilutinovicJail (JOI22_jail)C++14
0 / 100
1398 ms16884 KiB
#include <iostream> #include <algorithm> #include<cmath> #include<cstring> #include<cstdio> #include<cstdlib> #include<vector> #include<iomanip> #include<ctime> #include<set> #include<map> #include<queue> #include<stack> #include<bitset> #include<cassert> #define pb push_back #define mk make_pair using namespace std; int n,m,go[120005][22],dep[120005],s[505],t[505],dfn[120005],dfo[120005],T; vector<int> g[120005]; void dfs(int v,int pr) { dep[v]=dep[pr]+1;go[v][0]=pr;dfn[v]=++T; for(int u:g[v])if(u!=pr)dfs(u,v); dfo[v]=T; } int lca(int u,int v) { if(dep[u]<dep[v])swap(u,v); for(int i=19;i>=0;i--)if(dep[go[u][i]]>=dep[v])u=go[u][i]; if(u==v)return u; for(int i=19;i>=0;i--)if(go[u][i]!=go[v][i])u=go[u][i],v=go[v][i]; return go[u][0]; } int deg[120005];vector<int> e[120005]; void init() { T=0; for(int i=1;i<=120000;i++)g[i].clear(),dep[i]=0; for(int i=1;i<=120000;i++)for(int j=0;j<20;j++)go[i][j]=0; for(int i=1;i<=500;i++)deg[i]=0,e[i].clear(); } void adde(int x,int y){deg[y]++;e[x].pb(y);} bool in(int x,int y){return dfn[x]<=dfn[y]&&dfo[y]<=dfo[x];} bool on(int x,int y,int z){int l=lca(x,y);return in(l,z)&&(in(z,x)||in(z,y));} int qu[505],qsz; void solve() { init();scanf("%d",&n); for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),g[u].pb(v),g[v].pb(u); dfs(1,0); for(int i=1;i<=n;i++)for(int j=1;j<20;j++)go[i][j]=go[go[i][j-1]][j-1]; scanf("%d",&m); for(int i=1;i<=m;i++)scanf("%d%d",&s[i],&t[i]); for(int i=1;i<=m;i++)for(int j=1;j<=m;j++)if(i!=j&&on(s[i],t[i],s[j]))adde(j,i); qsz=0;for(int i=1;i<=m;i++)if(deg[i]==0)qu[++qsz]=i; for(int i=1;i<=qsz;i++)for(int j:e[qu[i]]){ deg[j]--; if(deg[j]==0)qu[++qsz]=j; assert(deg[j]>=0); } bool ok=1;for(int i=1;i<=m;i++)ok&=(deg[i]==0); printf(ok?"Yes\n":"No\n"); } int main() { int t;scanf("%d",&t); while(t--)solve(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

jail.cpp: In function 'void solve()':
jail.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |  init();scanf("%d",&n);
      |         ~~~~~^~~~~~~~~
jail.cpp:50:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |  for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),g[u].pb(v),g[v].pb(u);
      |                          ~~~~~^~~~~~~~~~~~~~
jail.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |  scanf("%d",&m);
      |  ~~~~~^~~~~~~~~
jail.cpp:54:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |  for(int i=1;i<=m;i++)scanf("%d%d",&s[i],&t[i]);
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~
jail.cpp: In function 'int main()':
jail.cpp:67:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |  int t;scanf("%d",&t);
      |        ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...