제출 #513299

#제출 시각아이디문제언어결과실행 시간메모리
5132998e7Stray Cat (JOI20_stray)C++17
5 / 100
55 ms15232 KiB
#include "Anthony.h" #include <vector> #include <bits/stdc++.h> #define maxn 20005 #define pii pair<int, int> using namespace std; namespace { vector<int> adj[maxn]; int arr[6] = {0, 0, 1, 0, 1, 1}; const int inf = 8e7; }; vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) { for (int i = 0;i < M;i++) adj[U[i]].push_back(V[i]), adj[V[i]].push_back(U[i]); queue<int> que; que.push(0); vector<int> X(M), d(N, inf); d[0] = 0; while (que.size()) { //cout << "zisk" << endl; int cur = que.front();que.pop(); for (int v:adj[cur]) { if (d[cur] + 1 < d[v]) { d[v] = d[cur] + 1; que.push(v); } } } for (int i = 0; i < M; ++i) { if (d[U[i]] > d[V[i]]) swap(U[i], V[i]); X[i] = d[U[i]] % 2; } return X; }
#include "Catherine.h" #include <vector> #include "assert.h" using namespace std; namespace { int A, B; int prv = 0; }; void Init(int A, int B) { ::A = A; ::B = B; } int Move(vector<int> y) { if (!y[0] && !y[1]) return -1; if (y[prv ^ 1]) { prv ^= 1; return prv; } else { return prv; } } /* 7 6 3 6 1 0 2 0 4 1 2 1 3 1 5 4 6 */

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

Anthony.cpp:9:6: warning: '{anonymous}::arr' defined but not used [-Wunused-variable]
    9 |  int arr[6] = {0, 0, 1, 0, 1, 1};
      |      ^~~
#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...