oj.uz

Submission #1012827

# Submission time Handle Problem Language Result Execution time Memory
1012827 2024-07-02T16:21:03 Z Ivo_12 Stray Cat (JOI20_stray) C++17
15 / 100
 42 ms 17504 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];
queue < int > q;

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 {
		
	}
	
	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;

void init( int a, int b ) {
	ga = a;
	gb = b;
}

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;
	}
	
	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 27 ms 16440 KB Output is correct
2 Correct 0 ms 1300 KB Output is correct
3 Correct 21 ms 15588 KB Output is correct
4 Correct 32 ms 17504 KB Output is correct
5 Correct 42 ms 17436 KB Output is correct
6 Correct 26 ms 16220 KB Output is correct
7 Correct 27 ms 16072 KB Output is correct
8 Correct 34 ms 17016 KB Output is correct
9 Correct 36 ms 16916 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 16440 KB Output is correct
2 Correct 0 ms 1300 KB Output is correct
3 Correct 21 ms 15588 KB Output is correct
4 Correct 32 ms 17504 KB Output is correct
5 Correct 42 ms 17436 KB Output is correct
6 Correct 26 ms 16220 KB Output is correct
7 Correct 27 ms 16072 KB Output is correct
8 Correct 34 ms 17016 KB Output is correct
9 Correct 36 ms 16916 KB Output is correct
10 Correct 23 ms 14408 KB Output is correct
11 Correct 30 ms 14224 KB Output is correct
12 Correct 26 ms 14300 KB Output is correct
13 Correct 24 ms 14320 KB Output is correct
14 Correct 24 ms 14928 KB Output is correct
15 Correct 26 ms 14928 KB Output is correct
16 Correct 34 ms 17160 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13864 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 25 ms 13388 KB Output is correct
4 Correct 32 ms 15308 KB Output is correct
5 Correct 37 ms 15448 KB Output is correct
6 Correct 26 ms 14068 KB Output is correct
7 Correct 30 ms 13896 KB Output is correct
8 Correct 36 ms 14604 KB Output is correct
9 Correct 30 ms 14780 KB Output is correct
10 Correct 26 ms 14424 KB Output is correct
11 Correct 26 ms 14424 KB Output is correct
12 Correct 34 ms 14168 KB Output is correct
13 Correct 26 ms 14432 KB Output is correct
14 Correct 31 ms 14684 KB Output is correct
15 Correct 34 ms 14684 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13864 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 25 ms 13388 KB Output is correct
4 Correct 32 ms 15308 KB Output is correct
5 Correct 37 ms 15448 KB Output is correct
6 Correct 26 ms 14068 KB Output is correct
7 Correct 30 ms 13896 KB Output is correct
8 Correct 36 ms 14604 KB Output is correct
9 Correct 30 ms 14780 KB Output is correct
10 Correct 26 ms 14424 KB Output is correct
11 Correct 26 ms 14424 KB Output is correct
12 Correct 34 ms 14168 KB Output is correct
13 Correct 26 ms 14432 KB Output is correct
14 Correct 31 ms 14684 KB Output is correct
15 Correct 34 ms 14684 KB Output is correct
16 Correct 20 ms 12436 KB Output is correct
17 Correct 24 ms 12444 KB Output is correct
18 Correct 22 ms 12376 KB Output is correct
19 Correct 24 ms 12368 KB Output is correct
20 Correct 28 ms 13156 KB Output is correct
21 Correct 27 ms 12704 KB Output is correct
22 Correct 30 ms 14736 KB Output is correct
23 Correct 26 ms 12664 KB Output is correct
24 Correct 24 ms 12416 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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