oj.uz

Submission #217573

# Submission time Handle Problem Language Result Execution time Memory
217573 2020-03-30T09:24:32 Z Toadologist Stray Cat (JOI20_stray) C++14
100 / 100
 76 ms 16964 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#ifdef DEBUG
#define display(x) cerr << #x << " = " << x << endl;
#define displaya(a, st, n)\
	{cerr << #a << " = {";\
	for(int qwq = (st); qwq <= (n); ++qwq) {\
		if(qwq == (st)) cerr << a[qwq];\
		else cerr << ", " << a[qwq];\
	} cerr << "}" << endl;}
#define displayv(v) displaya(v, 0, (int)(v).size() - 1)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define display(x) ;
#define displaya(a, st, n) ;
#define displayv(v) ;
#define eprintf(...) if(0) fprintf(stderr, "...")
#endif
template<typename T> bool chmin(T &a, const T &b) { return a > b ? a = b, true : false; }
template<typename T> bool chmax(T &a, const T &b) { return a < b ? a = b, true : false; }
template<typename A, typename B>
ostream& operator << (ostream& out, const pair<A, B> &p) {
	return out << '(' << p.first << ", " << p.second << ')';
}

namespace {
}  // namespace

std::vector<int> Mark(int n, int m, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
	std::vector<int> X(m);
	vector< vector<pii> > G(n, vector<pii>());
	
	for(int i = 0; i < m; ++i)
		G[U[i]].emplace_back(V[i], i),
		G[V[i]].emplace_back(U[i], i);
	
	vector<int> d(n, n + 1);
	d[0] = 0;
	queue<int> Q;
	Q.push(0);
	while(Q.size()) {
		int u = Q.front(); Q.pop();
		for(auto p : G[u]) 
			if(chmin(d[p.first], d[u] + 1))
				Q.push(p.first);
	}
	
	if(A >= 3) {
		for(int i = 0; i < m; ++i) {
			X[i] = min(d[U[i]], d[V[i]]) % 3;
		}
	} else {
		assert(A == 2);
		assert(m == n - 1);
		
		string eigen = "001011";
		function<void(int, int, int, int)> color = [&](int u, int fa, int col, int i) {
			int des = G[u].size() - !!(fa != -1);
			
			int ncol = col, ni = i;
			if(des >= 2) {
				ncol = col ^ 1;
				if(ncol == 0) ni = 0; else ni = 2;
			} else {
				ni = (i + 1) % 6;
				ncol = eigen[ni] - '0';
			}
			
			for(auto p : G[u]) if(p.first != fa) {
				X[p.second] = ncol;
				color(p.first, u, ncol, ni);
			}
		};
		
		color(0, -1, 0, -1);
		
	}
	displayv(X);
	return X;
}
#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#ifdef DEBUG
#define display(x) cerr << #x << " = " << x << endl;
#define displaya(a, st, n)\
	{cerr << #a << " = {";\
	for(int qwq = (st); qwq <= (n); ++qwq) {\
		if(qwq == (st)) cerr << a[qwq];\
		else cerr << ", " << a[qwq];\
	} cerr << "}" << endl;}
#define displayv(v) displaya(v, 0, (int)(v).size() - 1)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define display(x) ;
#define displaya(a, st, n) ;
#define displayv(v) ;
#define eprintf(...) if(0) fprintf(stderr, "...")
#endif
template<typename T> bool chmin(T &a, const T &b) { return a > b ? a = b, true : false; }
template<typename T> bool chmax(T &a, const T &b) { return a < b ? a = b, true : false; }
template<typename A, typename B>
ostream& operator << (ostream& out, const pair<A, B> &p) {
	return out << '(' << p.first << ", " << p.second << ')';
}

using bs = basic_string<int>;

namespace {

int A, B;
int step = 0;
bs p;

int stable = 0;
string s;
string far = "001011001011";
string near = "110100110100";

}  // namespace

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

int Move(std::vector<int> y) {
	displayv(y);
	++step;
	if(A >= 3) {
		if(p.size()) y[p.back()]++;
		displayv(y);
		int ch = -1;
		
		if(y[0] && !y[2]) ch = 0;
		else if(y[1] && !y[0]) ch = 1;
		else if(y[2] && !y[1]) ch = 2;
		else assert(false);
		p.push_back(ch);
		return ch;
	} else {
		assert(A == 2);
		if(s.size()) y[s.back() - '0']++;
		
		int ch = -1;
		
		if(y[0] + y[1] == 1) {
			if(y[0]) ch = 0; else ch = 1;
			
			stable = true;
			s.push_back('0' + ch);
			if(s.size() > 1) ch = -1;
		} else if(y[0] + y[1] >= 3) {
			if(y[0] == 1) ch = 0;
			else if(y[1] == 1) ch = 1;
			else assert(false);
			
			stable = true;
			s.push_back('0' + ch);
			if(s.size() >= 2 && ch == s[s.size() - 2] - '0') ch = -1;
		} else { // on a chain
			if(s.size()) y[s.back() - '0']--;
			if(stable) {
				if(y[0]) ch = 0; else ch = 1;
				s.push_back('0' + ch);
			} else if(step == 1) {
				if(y[0]) ch = 0;
				else ch = 1;
				y[ch]--;
				if(y[0]) s.push_back('0');
				else s.push_back('1');
				s.push_back('0' + ch);
			} else {
				if(y[0]) ch = 0;
				else ch = 1;
				s.push_back('0' + ch);
				
				if(near.find(s) != string::npos && far.find(s) == string::npos)
					stable = true;
				else if(near.find(s) == string::npos && far.find(s) != string::npos) {
					eprintf("turn around\n");
					s.push_back(s[s.size() - 2]);
					ch = -1;
					stable = true;
				}
				
			}
		}
		display(ch);
		display(stable);
		return ch;
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15744 KB Output is correct
2 Correct 8 ms 784 KB Output is correct
3 Correct 47 ms 15020 KB Output is correct
4 Correct 67 ms 16964 KB Output is correct
5 Correct 75 ms 16716 KB Output is correct
6 Correct 55 ms 15596 KB Output is correct
7 Correct 54 ms 15560 KB Output is correct
8 Correct 62 ms 16396 KB Output is correct
9 Correct 73 ms 16332 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15744 KB Output is correct
2 Correct 8 ms 784 KB Output is correct
3 Correct 47 ms 15020 KB Output is correct
4 Correct 67 ms 16964 KB Output is correct
5 Correct 75 ms 16716 KB Output is correct
6 Correct 55 ms 15596 KB Output is correct
7 Correct 54 ms 15560 KB Output is correct
8 Correct 62 ms 16396 KB Output is correct
9 Correct 73 ms 16332 KB Output is correct
10 Correct 52 ms 13492 KB Output is correct
11 Correct 50 ms 13660 KB Output is correct
12 Correct 51 ms 13396 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 51 ms 13784 KB Output is correct
15 Correct 56 ms 14196 KB Output is correct
16 Correct 62 ms 16352 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13276 KB Output is correct
2 Correct 10 ms 776 KB Output is correct
3 Correct 45 ms 12928 KB Output is correct
4 Correct 65 ms 14924 KB Output is correct
5 Correct 64 ms 14684 KB Output is correct
6 Correct 52 ms 13304 KB Output is correct
7 Correct 54 ms 13532 KB Output is correct
8 Correct 59 ms 14104 KB Output is correct
9 Correct 59 ms 14104 KB Output is correct
10 Correct 59 ms 13976 KB Output is correct
11 Correct 60 ms 13832 KB Output is correct
12 Correct 55 ms 13780 KB Output is correct
13 Correct 55 ms 13860 KB Output is correct
14 Correct 59 ms 14108 KB Output is correct
15 Correct 62 ms 14184 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13276 KB Output is correct
2 Correct 10 ms 776 KB Output is correct
3 Correct 45 ms 12928 KB Output is correct
4 Correct 65 ms 14924 KB Output is correct
5 Correct 64 ms 14684 KB Output is correct
6 Correct 52 ms 13304 KB Output is correct
7 Correct 54 ms 13532 KB Output is correct
8 Correct 59 ms 14104 KB Output is correct
9 Correct 59 ms 14104 KB Output is correct
10 Correct 59 ms 13976 KB Output is correct
11 Correct 60 ms 13832 KB Output is correct
12 Correct 55 ms 13780 KB Output is correct
13 Correct 55 ms 13860 KB Output is correct
14 Correct 59 ms 14108 KB Output is correct
15 Correct 62 ms 14184 KB Output is correct
16 Correct 46 ms 11724 KB Output is correct
17 Correct 51 ms 11816 KB Output is correct
18 Correct 49 ms 11640 KB Output is correct
19 Correct 55 ms 11760 KB Output is correct
20 Correct 55 ms 12356 KB Output is correct
21 Correct 51 ms 12144 KB Output is correct
22 Correct 56 ms 14172 KB Output is correct
23 Correct 49 ms 11780 KB Output is correct
24 Correct 50 ms 11748 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1100 KB Output is correct
2 Correct 10 ms 792 KB Output is correct
3 Correct 10 ms 1136 KB Output is correct
4 Correct 11 ms 1040 KB Output is correct
5 Correct 10 ms 1088 KB Output is correct
6 Correct 10 ms 1212 KB Output is correct
7 Correct 10 ms 1080 KB Output is correct
8 Correct 10 ms 1208 KB Output is correct
9 Correct 10 ms 1208 KB Output is correct
10 Correct 10 ms 1080 KB Output is correct
11 Correct 10 ms 1048 KB Output is correct
12 Correct 10 ms 1040 KB Output is correct
13 Correct 10 ms 1108 KB Output is correct
14 Correct 10 ms 912 KB Output is correct
15 Correct 10 ms 1096 KB Output is correct
16 Correct 11 ms 1244 KB Output is correct
17 Correct 10 ms 1048 KB Output is correct
18 Correct 11 ms 1088 KB Output is correct
19 Correct 10 ms 1120 KB Output is correct
20 Correct 10 ms 1040 KB Output is correct
21 Correct 10 ms 1040 KB Output is correct
22 Correct 12 ms 1116 KB Output is correct
23 Correct 14 ms 1376 KB Output is correct
24 Correct 10 ms 1096 KB Output is correct
25 Correct 10 ms 1048 KB Output is correct
26 Correct 10 ms 1124 KB Output is correct
27 Correct 10 ms 1112 KB Output is correct
28 Correct 10 ms 1116 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 11576 KB Output is correct
2 Correct 59 ms 13112 KB Output is correct
3 Correct 10 ms 788 KB Output is correct
4 Correct 45 ms 11372 KB Output is correct
5 Correct 65 ms 15072 KB Output is correct
6 Correct 61 ms 14812 KB Output is correct
7 Correct 53 ms 14160 KB Output is correct
8 Correct 55 ms 14100 KB Output is correct
9 Correct 62 ms 14812 KB Output is correct
10 Correct 62 ms 14940 KB Output is correct
11 Correct 62 ms 14816 KB Output is correct
12 Correct 70 ms 14668 KB Output is correct
13 Correct 61 ms 14924 KB Output is correct
14 Correct 61 ms 14796 KB Output is correct
15 Correct 61 ms 14932 KB Output is correct
16 Correct 76 ms 15160 KB Output is correct
17 Correct 60 ms 14652 KB Output is correct
18 Correct 60 ms 14540 KB Output is correct
19 Correct 64 ms 14432 KB Output is correct
20 Correct 61 ms 14420 KB Output is correct
21 Correct 60 ms 14672 KB Output is correct
22 Correct 59 ms 14548 KB Output is correct
23 Correct 50 ms 11600 KB Output is correct
24 Correct 53 ms 11540 KB Output is correct
25 Correct 51 ms 12108 KB Output is correct
26 Correct 53 ms 12216 KB Output is correct
27 Correct 55 ms 13260 KB Output is correct
28 Correct 57 ms 13164 KB Output is correct
29 Correct 56 ms 13140 KB Output is correct
30 Correct 56 ms 13212 KB Output is correct
31 Correct 50 ms 11484 KB Output is correct
32 Correct 49 ms 11768 KB Output is correct
33 Correct 51 ms 12076 KB Output is correct
34 Correct 59 ms 12108 KB Output is correct
35 Correct 56 ms 13088 KB Output is correct
36 Correct 56 ms 13196 KB Output is correct
37 Correct 55 ms 12948 KB Output is correct
38 Correct 57 ms 13084 KB Output is correct
39 Correct 57 ms 13100 KB Output is correct
40 Correct 56 ms 13012 KB Output is correct
41 Correct 57 ms 13848 KB Output is correct
42 Correct 57 ms 13780 KB Output is correct
43 Correct 63 ms 13780 KB Output is correct
44 Correct 62 ms 14076 KB Output is correct
45 Correct 60 ms 13860 KB Output is correct
46 Correct 60 ms 13868 KB Output is correct
47 Correct 57 ms 12832 KB Output is correct
48 Correct 53 ms 12668 KB Output is correct
49 Correct 52 ms 12628 KB Output is correct
50 Correct 55 ms 12816 KB Output is correct
51 Correct 56 ms 11812 KB Output is correct
52 Correct 55 ms 11824 KB Output is correct
53 Correct 53 ms 11660 KB Output is correct
54 Correct 52 ms 11800 KB Output is correct
55 Correct 50 ms 11816 KB Output is correct
56 Correct 53 ms 11804 KB Output is correct
57 Correct 52 ms 11680 KB Output is correct
58 Correct 51 ms 11836 KB Output is correct
59 Correct 51 ms 11848 KB Output is correct
60 Correct 54 ms 11972 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 11572 KB Output is correct
2 Correct 53 ms 12988 KB Output is correct
3 Correct 9 ms 792 KB Output is correct
4 Correct 53 ms 11328 KB Output is correct
5 Correct 66 ms 14900 KB Output is correct
6 Correct 67 ms 14796 KB Output is correct
7 Correct 52 ms 13916 KB Output is correct
8 Correct 52 ms 13916 KB Output is correct
9 Correct 64 ms 15020 KB Output is correct
10 Correct 61 ms 14812 KB Output is correct
11 Correct 62 ms 14812 KB Output is correct
12 Correct 61 ms 14808 KB Output is correct
13 Correct 63 ms 14932 KB Output is correct
14 Correct 62 ms 15056 KB Output is correct
15 Correct 64 ms 14800 KB Output is correct
16 Correct 61 ms 14812 KB Output is correct
17 Correct 62 ms 14688 KB Output is correct
18 Correct 62 ms 14656 KB Output is correct
19 Correct 57 ms 14548 KB Output is correct
20 Correct 57 ms 14548 KB Output is correct
21 Correct 60 ms 14920 KB Output is correct
22 Correct 60 ms 14420 KB Output is correct
23 Correct 50 ms 11600 KB Output is correct
24 Correct 49 ms 11556 KB Output is correct
25 Correct 53 ms 12212 KB Output is correct
26 Correct 51 ms 12204 KB Output is correct
27 Correct 56 ms 13132 KB Output is correct
28 Correct 64 ms 13256 KB Output is correct
29 Correct 56 ms 13216 KB Output is correct
30 Correct 57 ms 13140 KB Output is correct
31 Correct 50 ms 11596 KB Output is correct
32 Correct 72 ms 11692 KB Output is correct
33 Correct 54 ms 12212 KB Output is correct
34 Correct 52 ms 12068 KB Output is correct
35 Correct 56 ms 13100 KB Output is correct
36 Correct 56 ms 13012 KB Output is correct
37 Correct 61 ms 13220 KB Output is correct
38 Correct 55 ms 12892 KB Output is correct
39 Correct 55 ms 13088 KB Output is correct
40 Correct 56 ms 13092 KB Output is correct
41 Correct 60 ms 13996 KB Output is correct
42 Correct 59 ms 13836 KB Output is correct
43 Correct 57 ms 13868 KB Output is correct
44 Correct 56 ms 13872 KB Output is correct
45 Correct 60 ms 13860 KB Output is correct
46 Correct 56 ms 13824 KB Output is correct
47 Correct 54 ms 12816 KB Output is correct
48 Correct 54 ms 12784 KB Output is correct
49 Correct 56 ms 12804 KB Output is correct
50 Correct 55 ms 12832 KB Output is correct
51 Correct 49 ms 11808 KB Output is correct
52 Correct 50 ms 11808 KB Output is correct
53 Correct 50 ms 11812 KB Output is correct
54 Correct 52 ms 11656 KB Output is correct
55 Correct 51 ms 11600 KB Output is correct
56 Correct 50 ms 11652 KB Output is correct
57 Correct 50 ms 11712 KB Output is correct
58 Correct 53 ms 11704 KB Output is correct
59 Correct 50 ms 11816 KB Output is correct
60 Correct 51 ms 11860 KB Output is correct