Submission #829616

#TimeUsernameProblemLanguageResultExecution timeMemory
829616MODDIStray Cat (JOI20_stray)C++14
0 / 100
9 ms3068 KiB
#include "Anthony.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vl; namespace { } // namespace std::vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) { vi arr(M, -1); vector<vector<pii>> G(N, vector<pii>()); for(int i = 0; i < M; i++){ int u = U[i], v = V[i]; G[u].pb({v, i}); G[v].pb({u, i}); } vi dist(N, N); dist[0] = 0; queue<int> q; q.push(0); while(!q.empty()){ int v = q.front(); q.pop(); for(pii next : G[v]){ if(dist[next.first] == N){ dist[next.first] = 1 + dist[v]; q.push(next.first); } } } if(A >= 3){ for(int i = 0; i < M; i++){ arr[i] = min(dist[U[i]], dist[V[i]]) % 3; } } else return arr; }
#include "Catherine.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int,int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vl; namespace { int A; bool bambooPart; vector<int> colors; bool GoingUp(vector<int> s) { vector<int> t = {1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0}; // reverse(t.begin(), t.end()); for (int i = 0; i + (int)s.size() <= (int)t.size(); i++) { bool ok = true; for (int j = 0; j < (int)s.size(); j++) ok &= s[j] == t[i + j]; if (ok) return true; } return false; } } // namespace void Init(int A, int B) { ::A = A; ::bambooPart = true; ::colors = vector<int>(); } int Move(std::vector<int> y) { if (::A > 2) { int c = 0; while(c < 3) { if (y[c] > 0 && y[(c + 2) % 3] == 0) break; c++; } assert(c < 3); return c; } }

Compilation message (stderr)

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:16:41: warning: control reaches end of non-void function [-Wreturn-type]
   16 |   vector<vector<pii>> G(N, vector<pii>());
      |                                         ^

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^
Catherine.cpp: At global scope:
Catherine.cpp:17:6: warning: 'bool {anonymous}::GoingUp(std::vector<int>)' defined but not used [-Wunused-function]
   17 | bool GoingUp(vector<int> s) {
      |      ^~~~~~~
#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...