Submission #676670

#TimeUsernameProblemLanguageResultExecution timeMemory
676670DwightKSchruteStray Cat (JOI20_stray)C++17
0 / 100
34 ms14832 KiB
#include "Anthony.h" #include <bits/stdc++.h> using namespace std; typedef vector<int>vi; typedef vector<vi>vvi; #define pb push_back namespace { }; vi Mark(int N, int M, int A, int B,vi U, vi V) { vi mark(M); vvi g(N+1); for(int i=0; i<M;i ++){ g[U[i]].pb(V[i]); g[V[i]].pb(U[i]); } vi D(N+1,-1); queue<int>q; q.push(0); D[0]=0; while(q.size()){ int x=q.front(); q.pop(); for(int nbr:g[x]) if(D[nbr]==-1) D[nbr]=D[x]+1,q.push(nbr); } for(int i=0; i<M; i++) if(min(D[U[i]],D[V[i]])%2==0) mark[i]=1; return mark; }
#include "Catherine.h" #include <bits/stdc++.h> using namespace std; typedef vector<int>vi; typedef vector<vi>vvi; #define all(x) x.begin(),x.end() //I can retrieve information between moves namespace { int A, B; bool reached_leaf=0; int last=-1; }; void Init(int _A, int _B) { A=_A,B=_B; } int Move(vi y) { if(!accumulate(all(y),0)){ reached_leaf=1; return last=-1; } for(int i=0; i<y.size(); i++) if(y[i]==1 && y[i]!=last) return last=i; return last=-1; } /* 7 6 2 14 3 0 2 0 4 1 2 1 3 1 5 4 6 */

Compilation message (stderr)

Catherine.cpp: In function 'int Move(vi)':
Catherine.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0; i<y.size(); i++)
      |                  ~^~~~~~~~~
#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...