oj.uz

Submission #883787

# Submission time Handle Problem Language Result Execution time Memory
883787 2023-12-06T03:41:51 Z marvinthang Stray Cat (JOI20_stray) C++17
15 / 100
 37 ms 16732 KB 
/*************************************
*    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);
	}
	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 = cur_mask = 0;
			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) 
			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:88:1: warning: control reaches end of non-void function [-Wreturn-type]
   88 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 15232 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 23 ms 14712 KB Output is correct
4 Correct 34 ms 16732 KB Output is correct
5 Correct 37 ms 16552 KB Output is correct
6 Correct 27 ms 15408 KB Output is correct
7 Correct 27 ms 15432 KB Output is correct
8 Correct 37 ms 16196 KB Output is correct
9 Correct 33 ms 16228 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 15232 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 23 ms 14712 KB Output is correct
4 Correct 34 ms 16732 KB Output is correct
5 Correct 37 ms 16552 KB Output is correct
6 Correct 27 ms 15408 KB Output is correct
7 Correct 27 ms 15432 KB Output is correct
8 Correct 37 ms 16196 KB Output is correct
9 Correct 33 ms 16228 KB Output is correct
10 Correct 25 ms 13480 KB Output is correct
11 Correct 25 ms 13512 KB Output is correct
12 Correct 29 ms 13452 KB Output is correct
13 Correct 27 ms 13444 KB Output is correct
14 Correct 26 ms 13784 KB Output is correct
15 Correct 28 ms 14020 KB Output is correct
16 Correct 32 ms 16212 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12684 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 22 ms 12384 KB Output is correct
4 Correct 32 ms 14692 KB Output is correct
5 Correct 36 ms 14608 KB Output is correct
6 Correct 26 ms 13128 KB Output is correct
7 Correct 26 ms 13132 KB Output is correct
8 Correct 31 ms 14040 KB Output is correct
9 Correct 37 ms 13888 KB Output is correct
10 Correct 28 ms 13668 KB Output is correct
11 Correct 30 ms 13628 KB Output is correct
12 Correct 28 ms 13640 KB Output is correct
13 Correct 28 ms 13608 KB Output is correct
14 Correct 34 ms 13916 KB Output is correct
15 Correct 33 ms 13912 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12684 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 22 ms 12384 KB Output is correct
4 Correct 32 ms 14692 KB Output is correct
5 Correct 36 ms 14608 KB Output is correct
6 Correct 26 ms 13128 KB Output is correct
7 Correct 26 ms 13132 KB Output is correct
8 Correct 31 ms 14040 KB Output is correct
9 Correct 37 ms 13888 KB Output is correct
10 Correct 28 ms 13668 KB Output is correct
11 Correct 30 ms 13628 KB Output is correct
12 Correct 28 ms 13640 KB Output is correct
13 Correct 28 ms 13608 KB Output is correct
14 Correct 34 ms 13916 KB Output is correct
15 Correct 33 ms 13912 KB Output is correct
16 Correct 24 ms 11540 KB Output is correct
17 Correct 25 ms 11576 KB Output is correct
18 Correct 26 ms 11472 KB Output is correct
19 Correct 25 ms 11460 KB Output is correct
20 Correct 27 ms 12496 KB Output is correct
21 Correct 26 ms 12040 KB Output is correct
22 Correct 32 ms 14144 KB Output is correct
23 Correct 26 ms 11860 KB Output is correct
24 Correct 25 ms 11688 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1052 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 1 ms 1148 KB Output is correct
4 Correct 1 ms 1056 KB Output is correct
5 Correct 2 ms 1048 KB Output is correct
6 Correct 2 ms 1048 KB Output is correct
7 Correct 2 ms 1040 KB Output is correct
8 Correct 2 ms 1136 KB Output is correct
9 Correct 2 ms 1048 KB Output is correct
10 Correct 2 ms 1056 KB Output is correct
11 Correct 1 ms 1056 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 1 ms 1056 KB Output is correct
14 Correct 1 ms 1140 KB Output is correct
15 Correct 0 ms 1056 KB Output is correct
16 Correct 1 ms 1048 KB Output is correct
17 Correct 2 ms 1056 KB Output is correct
18 Correct 0 ms 1060 KB Output is correct
19 Correct 1 ms 1060 KB Output is correct
20 Correct 2 ms 1044 KB Output is correct
21 Correct 2 ms 1152 KB Output is correct
22 Correct 2 ms 1060 KB Output is correct
23 Correct 1 ms 1048 KB Output is correct
24 Correct 1 ms 1056 KB Output is correct
25 Incorrect 2 ms 1064 KB Wrong Answer [6]
26 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 10624 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 10896 KB Output is correct
2 Incorrect 25 ms 12384 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -