oj.uz

Submission #1012930

# Submission time Handle Problem Language Result Execution time Memory
1012930 2024-07-02T20:18:41 Z Ivo_12 Stray Cat (JOI20_stray) C++17
15 / 100
 37 ms 17024 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pii pair < int, int >
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

using namespace std;

namespace {

const int N = 2e4+10, M = 2e4+10, A = 4;

vector < pii > edges[N];
vector < int > oznake;
int dis[N];
int zap[N];
queue < int > q;

int pat[6] = {0, 1, 0, 0, 1, 1};

vector < int > mark( int n, int m, int a, int b, vector < int > t1, vector < int > t2 ) {
	for(int i = 0; i < m; i++) {
		edges[t1[i]].pb(mp(t2[i], i));
		edges[t2[i]].pb(mp(t1[i], i));
		oznake.pb(-1);
	}
	dis[0] = 1;
	q.push(0);
	int cur;
	int sus;
	while(!q.empty()) {
		cur = q.front();
		q.pop();
		for(int i = 0; i < (int) edges[cur].size(); i++) {
			sus = edges[cur][i].F;
			if(dis[sus] == 0) {
				q.push(sus);
				dis[sus] = dis[cur]+1;
			}
		}
	}
	if(a>=3) {
		q.push(0);
		while(!q.empty()) {
			cur = q.front();
			q.pop();
			for(int i = 0; i < (int) edges[cur].size(); i++) {
				sus = edges[cur][i].F;
				if(oznake[edges[cur][i].S] == -1) {
					if(dis[sus] > dis[cur]) q.push(sus);
					oznake[edges[cur][i].S] = (dis[cur] - 1) % 3;
				}
			}
		}
	}
	else {
		q.push(0);
		while(!q.empty()) {
			cur = q.front();
			q.pop();
			for(int i = 0; i < (int) edges[cur].size(); i++) {
				sus = edges[cur][i].F;
				if(oznake[edges[cur][i].S] == -1 && (int) edges[cur].size() > 2) {
					if(dis[sus] > dis[cur]) q.push(sus);
					oznake[edges[cur][i].S] = (pat[zap[cur]%6] + 1) % 2;
					zap[sus] = (pat[zap[cur]] + 1) % 2;
				}
				if(oznake[edges[cur][i].S] == -1 && ((int) ((int) edges[cur].size() == 2 && cur != 0) || ((int) edges[cur].size() == 1 && cur == 0))) {
					if(dis[sus] > dis[cur]) q.push(sus);
					oznake[edges[cur][i].S] = pat[(zap[cur] + 1)%6];
					zap[sus] = zap[cur] + 1;
				}
			}
		}
	}
	
	return oznake;
}

}  // 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);
  return ::mark(N, M, A, B, U, V);
}
#include "Catherine.h"
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pii pair < int, int >
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

using namespace std;

namespace {

int ga, gb;
int l[2];

int revpatt[6] = {1, 1, 0, 0, 1, 0};
vector < int > patt[6];
vector < int > ori;
int pokusaj;


void init( int a, int b ) {
	ga = a;
	gb = b;
	l[0] = 0;
	l[1] = 0;
	for(int i = 0; i < 6; i++) {
		for(int j = 0; j < 5; j++) {
			patt[i].pb(revpatt[(j+i)%6]);
		}
	}
	pokusaj = 0;
}

int move( vector < int > v ) {
	
	if(::ga>=3) {
		if(v[0] && v[1]) return 0;
		if(v[2] && v[0]) return 2;
		if(v[1] && v[2]) return 1;
		if(!(v[0] || v[1])) return 2;
		if(!(v[2] || v[0])) return 1;
		if(!(v[1] || v[2])) return 0;
	}
	pokusaj++;
//	if(pokusaj == 1 && v[0] + v[1] == 2) {
//		if(v[0] == 1 && v[1] == 1) {
//			ori.pb(0);
//			ori.pb(1);
//			l[0] = 0;
//			l[1] = 1;
//			return 1;
//		}
//		if(v[0] == 2 && v[1] == 0) {
//			ori.pb(0);
//			ori.pb(0);
//			l[0] = 1;
//			l[1] = 0;
//			return 0;
//		}
//		if(v[0] == 0 && v[1] == 2) {
//			ori.pb(1);
//			ori.pb(1);
//			l[0] = 0;
//			l[1] = 1;
//			return 1;
//		}
//	}
//	else {
//		if((pokusaj == 2 || pokusaj == 3) && v[0] + v[1] == 1) {
//			ori.pb((int) (v[0] == 0));
//			l[0] = v[0] == 1;
//			l[1] = v[1] == 1;
//			return ((int) (v[0] == 0));
//		}
//		else {
//			if((pokusaj == 4) && v[0] + v[1] == 1) {
//				ori.pb((int) (v[0] == 0));
//				for(int i = 0; i < 6; i++) if(ori==patt[i]) return -1;
//				l[0] = v[0] == 1;
//				l[1] = v[1] == 1;
//				return (int) (v[0] == 0);
//			}
//			else pokusaj = 10;
//		}
//	}
	pokusaj = 10;
	if(v[0] == 0 && v[1] == 0) return -1;
	if(v[0] == 0 && v[1] > 1 && pokusaj != 1) {
		return -1;
	}
	if(v[0] > 1 && v[1] == 0 && pokusaj != 1) {
		return -1;
	}
	if(v[0] == 0 && v[1] == 1) {
		l[1] = 1;
		l[0] = 0;
		return 1;
	}
	if(v[0] == 1 && v[1] == 0) {
		l[1] = 0;
		l[0] = 1;
		return 0;
	}
	if(v[0] == 1 && v[1] > 1) {
		l[1] = 0;
		l[0] = 1;
		return 0;
	}
	if(v[0] > 1 && v[1] == 1) {
		l[1] = 1;
		l[0] = 0;
		return 1;
	}
	if(l[0]) {
		l[1] = 1;
		l[0] = 0;
		return 1;
	}
	if(l[1]) {
		l[1] = 0;
		l[0] = 1;
		return 0;
	}
	if(v[0] > v[1]) {
		l[1] = 0;
		l[0] = 1;
		return 0;
	}
	l[1] = 1;
	l[0] = 0;
	return 1;
	
}

}  // namespace

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

int Move(std::vector<int> y) {
	return ::move(y);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 16000 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 21 ms 15480 KB Output is correct
4 Correct 33 ms 17024 KB Output is correct
5 Correct 37 ms 16928 KB Output is correct
6 Correct 26 ms 15752 KB Output is correct
7 Correct 31 ms 15676 KB Output is correct
8 Correct 34 ms 16500 KB Output is correct
9 Correct 30 ms 16508 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 16000 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 21 ms 15480 KB Output is correct
4 Correct 33 ms 17024 KB Output is correct
5 Correct 37 ms 16928 KB Output is correct
6 Correct 26 ms 15752 KB Output is correct
7 Correct 31 ms 15676 KB Output is correct
8 Correct 34 ms 16500 KB Output is correct
9 Correct 30 ms 16508 KB Output is correct
10 Correct 27 ms 13956 KB Output is correct
11 Correct 22 ms 13964 KB Output is correct
12 Correct 24 ms 13920 KB Output is correct
13 Correct 26 ms 13956 KB Output is correct
14 Correct 24 ms 14036 KB Output is correct
15 Correct 26 ms 14460 KB Output is correct
16 Correct 36 ms 16688 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13580 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 13204 KB Output is correct
4 Correct 30 ms 14740 KB Output is correct
5 Correct 31 ms 14880 KB Output is correct
6 Correct 26 ms 13432 KB Output is correct
7 Correct 25 ms 13436 KB Output is correct
8 Correct 34 ms 14308 KB Output is correct
9 Correct 32 ms 14048 KB Output is correct
10 Correct 26 ms 13960 KB Output is correct
11 Correct 29 ms 13920 KB Output is correct
12 Correct 31 ms 13916 KB Output is correct
13 Correct 35 ms 13856 KB Output is correct
14 Correct 27 ms 14216 KB Output is correct
15 Correct 29 ms 14296 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13580 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 13204 KB Output is correct
4 Correct 30 ms 14740 KB Output is correct
5 Correct 31 ms 14880 KB Output is correct
6 Correct 26 ms 13432 KB Output is correct
7 Correct 25 ms 13436 KB Output is correct
8 Correct 34 ms 14308 KB Output is correct
9 Correct 32 ms 14048 KB Output is correct
10 Correct 26 ms 13960 KB Output is correct
11 Correct 29 ms 13920 KB Output is correct
12 Correct 31 ms 13916 KB Output is correct
13 Correct 35 ms 13856 KB Output is correct
14 Correct 27 ms 14216 KB Output is correct
15 Correct 29 ms 14296 KB Output is correct
16 Correct 22 ms 11900 KB Output is correct
17 Correct 20 ms 11864 KB Output is correct
18 Correct 23 ms 11908 KB Output is correct
19 Correct 25 ms 11908 KB Output is correct
20 Correct 23 ms 12680 KB Output is correct
21 Correct 26 ms 12268 KB Output is correct
22 Correct 28 ms 14464 KB Output is correct
23 Correct 25 ms 12140 KB Output is correct
24 Correct 25 ms 12316 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1556 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 1 ms 1572 KB Output is correct
4 Correct 1 ms 1552 KB Output is correct
5 Correct 1 ms 1560 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1568 KB Output is correct
8 Incorrect 1 ms 1568 KB Wrong Answer [4]
9 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 11784 KB Output is correct
2 Incorrect 22 ms 11712 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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