oj.uz

Submission #883774

# Submission time Handle Problem Language Result Execution time Memory
883774 2023-12-06T02:46:02 Z marvinthang Stray Cat (JOI20_stray) C++17
15 / 100
 36 ms 16708 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;
			}
		}
	}
	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;
}

void Init(int A, int B) {
	::A = A;
}

int Move(vector<int> y) {
	if (A >= 3) {
		REP(i, 3) if (y[i] && !y[(i + 2) % 3]) return i;
	}
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 15128 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 24 ms 14632 KB Output is correct
4 Correct 33 ms 16692 KB Output is correct
5 Correct 34 ms 16708 KB Output is correct
6 Correct 26 ms 15448 KB Output is correct
7 Correct 26 ms 15428 KB Output is correct
8 Correct 31 ms 16200 KB Output is correct
9 Correct 34 ms 16240 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 15128 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 24 ms 14632 KB Output is correct
4 Correct 33 ms 16692 KB Output is correct
5 Correct 34 ms 16708 KB Output is correct
6 Correct 26 ms 15448 KB Output is correct
7 Correct 26 ms 15428 KB Output is correct
8 Correct 31 ms 16200 KB Output is correct
9 Correct 34 ms 16240 KB Output is correct
10 Correct 25 ms 13492 KB Output is correct
11 Correct 26 ms 13504 KB Output is correct
12 Correct 25 ms 13512 KB Output is correct
13 Correct 25 ms 13512 KB Output is correct
14 Correct 26 ms 13768 KB Output is correct
15 Correct 27 ms 14008 KB Output is correct
16 Correct 30 ms 16220 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 12668 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 22 ms 12336 KB Output is correct
4 Correct 36 ms 14624 KB Output is correct
5 Correct 31 ms 14684 KB Output is correct
6 Correct 28 ms 13152 KB Output is correct
7 Correct 26 ms 13144 KB Output is correct
8 Correct 30 ms 13936 KB Output is correct
9 Correct 28 ms 13892 KB Output is correct
10 Correct 26 ms 13640 KB Output is correct
11 Correct 30 ms 13656 KB Output is correct
12 Correct 27 ms 13660 KB Output is correct
13 Correct 28 ms 13644 KB Output is correct
14 Correct 28 ms 13904 KB Output is correct
15 Correct 28 ms 13872 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 12668 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 22 ms 12336 KB Output is correct
4 Correct 36 ms 14624 KB Output is correct
5 Correct 31 ms 14684 KB Output is correct
6 Correct 28 ms 13152 KB Output is correct
7 Correct 26 ms 13144 KB Output is correct
8 Correct 30 ms 13936 KB Output is correct
9 Correct 28 ms 13892 KB Output is correct
10 Correct 26 ms 13640 KB Output is correct
11 Correct 30 ms 13656 KB Output is correct
12 Correct 27 ms 13660 KB Output is correct
13 Correct 28 ms 13644 KB Output is correct
14 Correct 28 ms 13904 KB Output is correct
15 Correct 28 ms 13872 KB Output is correct
16 Correct 24 ms 11604 KB Output is correct
17 Correct 23 ms 11620 KB Output is correct
18 Correct 24 ms 11508 KB Output is correct
19 Correct 27 ms 11608 KB Output is correct
20 Correct 26 ms 12176 KB Output is correct
21 Correct 26 ms 11984 KB Output is correct
22 Correct 27 ms 14420 KB Output is correct
23 Correct 34 ms 11864 KB Output is correct
24 Correct 26 ms 11596 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1052 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 10364 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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