/*************************************
* author: marvinthang *
* created: 06.12.2023 09:33:05 *
*************************************/
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
namespace {
}
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
vector <vector <int>> adj(N);
REP(i, M) {
adj[U[i]].push_back(i);
adj[V[i]].push_back(i);
}
vector <int> res(M);
if (A >= 3) {
queue <int> q;
q.push(0);
vector <int> dist(N, -1);
dist[0] = 0;
while (!q.empty()){
int u = q.front(); q.pop();
for (int i: adj[u]) {
int v = U[i] ^ V[i] ^ u;
if (dist[v] == -1) {
dist[v] = dist[u] + 1;
q.push(v);
}
if (dist[v] == dist[u] + 1) res[i] = dist[v] % 3;
else if (dist[v] == dist[u]) res[i] = (dist[u] + 1) % 3;
}
}
} else {
int pattern = 11; // 001011
function<void(int, int, int)> dfs = [&] (int u, int par, int t) {
if (adj[u].size() >= 3) {
if (t >= 0) t = -1;
for (int i: adj[u]) {
int v = U[i] ^ V[i] ^ u;
if (v == par) {
res[i] = 2 + t;
continue;
}
res[i] = -1 - t;
dfs(v, u, -3 - t);
}
} else {
t = max(t, 0);
for (int i: adj[u]) {
int v = U[i] ^ V[i] ^ u;
if (v == par) continue;
res[i] = BIT(pattern, t);
dfs(v, u, (t + 1) % 6);
}
}
};
dfs(0, 0, 0);
}
cout << res << '\n';
return res;
}
#include "Catherine.h"
/*************************************
* author: marvinthang *
* created: 06.12.2023 09:38:51 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
namespace {
int A, cur_mask, len, last;
set <int> exist[7];
}
void Init(int A, int B) {
::A = A;
vector <int> pattern {0, 0, 1, 0, 1, 1};
pattern.insert(pattern.end(), ALL(pattern));
exist[0].insert(0);
REP(i, 6) {
int mask = 0;
REP(j, 6) {
mask = mask << 1 | pattern[i + j];
exist[j + 1].insert(mask);
}
}
cur_mask = len = 0;
last = -1;
}
int Move(vector<int> y) {
if (A >= 3) {
REP(i, 3) if (y[i] && !y[(i + 2) % 3]) return i;
} else {
if (y[0] + y[1] + (last >= 0) >= 3) {
len = 6;
if (!y[0] || !y[1]) return -1;
if (last == -1) return last = y[1] == 1;
return last = !last;
}
if (y[0] + y[1] + (last >= 0) == 1) {
len = 6;
return last >= 0 ? -1 : last = y[1] == 1;
}
REP(i, 2) if (y[i]) {
cur_mask = cur_mask << 1 | i;
if (len < 6 && !exist[++len].count(cur_mask)) {
len = 6;
return -1;
}
return last = i;
}
}
}
Compilation message
Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:90:1: warning: control reaches end of non-void function [-Wreturn-type]
90 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
2716 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
2716 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
11 ms |
2792 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
11 ms |
2792 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
788 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
10 ms |
2768 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
10 ms |
2780 KB |
Program didn't exit properly, or you printed something to stdout. |
| 2 |
Halted |
0 ms |
0 KB |
- |
