oj.uz

Submission #1012860

# Submission time Handle Problem Language Result Execution time Memory
1012860 2024-07-02T18:15:10 Z Ivo_12 Stray Cat (JOI20_stray) C++17
20 / 100
 37 ms 17448 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) {
					if(dis[sus] > dis[cur]) q.push(sus);
					oznake[edges[cur][i].S] = (pat[zap[cur]] + 1) % 2;
					zap[sus] = (pat[zap[cur]] + 1) % 2;
				}
			}
		}
	}
	
	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 pat[6] = {0, 1, 0, 0, 1, 1};

void init( int a, int b ) {
	ga = a;
	gb = b;
	l[0] = 0;
	l[1] = 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;
	}
	
	if(v[0] == 0 && v[1] == 0) return -1;
	if(v[0] == 0 && v[1] > 1) {
		return -1;
	}
	if(v[0] > 1 && v[1] == 0) {
		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(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] = 1;
		l[0] = 0;
		return 1;
	}
	l[1] = 0;
	l[0] = 1;
	return 0;
	
}

}  // namespace

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

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

Compilation message

Catherine.cpp:18:5: warning: '{anonymous}::pat' defined but not used [-Wunused-variable]
   18 | int pat[6] = {0, 1, 0, 0, 1, 1};
      |     ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16012 KB Output is correct
2 Correct 1 ms 1548 KB Output is correct
3 Correct 20 ms 15480 KB Output is correct
4 Correct 37 ms 17448 KB Output is correct
5 Correct 33 ms 16980 KB Output is correct
6 Correct 23 ms 15828 KB Output is correct
7 Correct 24 ms 15796 KB Output is correct
8 Correct 29 ms 16484 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 23 ms 16012 KB Output is correct
2 Correct 1 ms 1548 KB Output is correct
3 Correct 20 ms 15480 KB Output is correct
4 Correct 37 ms 17448 KB Output is correct
5 Correct 33 ms 16980 KB Output is correct
6 Correct 23 ms 15828 KB Output is correct
7 Correct 24 ms 15796 KB Output is correct
8 Correct 29 ms 16484 KB Output is correct
9 Correct 30 ms 16508 KB Output is correct
10 Correct 24 ms 13960 KB Output is correct
11 Correct 23 ms 13900 KB Output is correct
12 Correct 27 ms 13956 KB Output is correct
13 Correct 24 ms 13948 KB Output is correct
14 Correct 24 ms 14276 KB Output is correct
15 Correct 30 ms 14348 KB Output is correct
16 Correct 34 ms 16556 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13436 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 13308 KB Output is correct
4 Correct 31 ms 14972 KB Output is correct
5 Correct 30 ms 14972 KB Output is correct
6 Correct 25 ms 13448 KB Output is correct
7 Correct 36 ms 13328 KB Output is correct
8 Correct 32 ms 14232 KB Output is correct
9 Correct 27 ms 14216 KB Output is correct
10 Correct 26 ms 13960 KB Output is correct
11 Correct 30 ms 13952 KB Output is correct
12 Correct 26 ms 14064 KB Output is correct
13 Correct 27 ms 13872 KB Output is correct
14 Correct 30 ms 14216 KB Output is correct
15 Correct 34 ms 14388 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13436 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 13308 KB Output is correct
4 Correct 31 ms 14972 KB Output is correct
5 Correct 30 ms 14972 KB Output is correct
6 Correct 25 ms 13448 KB Output is correct
7 Correct 36 ms 13328 KB Output is correct
8 Correct 32 ms 14232 KB Output is correct
9 Correct 27 ms 14216 KB Output is correct
10 Correct 26 ms 13960 KB Output is correct
11 Correct 30 ms 13952 KB Output is correct
12 Correct 26 ms 14064 KB Output is correct
13 Correct 27 ms 13872 KB Output is correct
14 Correct 30 ms 14216 KB Output is correct
15 Correct 34 ms 14388 KB Output is correct
16 Correct 30 ms 11804 KB Output is correct
17 Correct 22 ms 11888 KB Output is correct
18 Correct 30 ms 11908 KB Output is correct
19 Correct 26 ms 11992 KB Output is correct
20 Correct 25 ms 12672 KB Output is correct
21 Correct 25 ms 12412 KB Output is correct
22 Correct 31 ms 14444 KB Output is correct
23 Correct 22 ms 12044 KB Output is correct
24 Correct 23 ms 12160 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1568 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 2 ms 1560 KB Output is correct
4 Correct 1 ms 1556 KB Output is correct
5 Correct 1 ms 1568 KB Output is correct
6 Correct 1 ms 1560 KB Output is correct
7 Correct 1 ms 1568 KB Output is correct
8 Correct 2 ms 1568 KB Output is correct
9 Correct 1 ms 1572 KB Output is correct
10 Correct 1 ms 1560 KB Output is correct
11 Correct 2 ms 1560 KB Output is correct
12 Correct 1 ms 1564 KB Output is correct
13 Correct 2 ms 1568 KB Output is correct
14 Correct 1 ms 1548 KB Output is correct
15 Correct 2 ms 1568 KB Output is correct
16 Correct 1 ms 1568 KB Output is correct
17 Correct 2 ms 1560 KB Output is correct
18 Correct 1 ms 1568 KB Output is correct
19 Correct 2 ms 1568 KB Output is correct
20 Correct 1 ms 1568 KB Output is correct
21 Correct 1 ms 1568 KB Output is correct
22 Correct 1 ms 1560 KB Output is correct
23 Correct 1 ms 1572 KB Output is correct
24 Correct 1 ms 1568 KB Output is correct
25 Correct 0 ms 1568 KB Output is correct
26 Correct 1 ms 1556 KB Output is correct
27 Correct 1 ms 1560 KB Output is correct
28 Correct 2 ms 1564 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 11960 KB Output is correct
2 Correct 30 ms 12352 KB Output is correct
3 Correct 0 ms 1296 KB Output is correct
4 Correct 22 ms 11656 KB Output is correct
5 Correct 26 ms 13184 KB Output is correct
6 Correct 33 ms 13220 KB Output is correct
7 Incorrect 26 ms 12416 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 11900 KB Output is correct
2 Correct 24 ms 12172 KB Output is correct
3 Correct 1 ms 1296 KB Output is correct
4 Correct 18 ms 11652 KB Output is correct
5 Correct 26 ms 13212 KB Output is correct
6 Correct 31 ms 13188 KB Output is correct
7 Incorrect 23 ms 12412 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -