oj.uz

Submission #212356

# Submission time Handle Problem Language Result Execution time Memory
212356 2020-03-22T18:19:29 Z JustasZ Stray Cat (JOI20_stray) C++14
15 / 100
 88 ms 17476 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e4 + 100;
const int mod = 1e9 + 7;

namespace {

	int n, m, A, B;
	vector<int>U, V, label, adj[maxn];
	void solve1() {
		queue<int>Q;
		vector<int>dist(n, mod);
		dist[0] = 0;
		Q.push(0);

		while (sz(Q)) {
			int v = Q.front();
			Q.pop();
			for (int to : adj[v]) {
				if (dist[to] > dist[v] + 1) {
					dist[to] = dist[v] + 1;
					Q.push(to);
				}
			}
		}

		for (int i = 0; i < m; i++) {
			label[i] = min(dist[V[i]], dist[U[i]]) % 3;
		}
	}

	void solve2() {

	}

	vector<int> solve(int N, int M, int AA, int BB, vector<int>UU, vector<int>VV) {
		n = N, m = M, A = AA, B = BB;
		U = UU, V = VV;
		label.resize(m);
		for (int i = 0; i < m; i++) {
			adj[U[i]].pb(V[i]);
			adj[V[i]].pb(U[i]);
		}
		if (A >= 3) {
			solve1();
		} else {
			solve2();
		}
		return label;
	}

}  // namespace

vector<int>Mark(int N, int M, int A, int B, vector<int>U, vector<int>V) {
	return solve(N, M, A, B, U, V);
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e4 + 100;
const int mod = 1e9 + 7;

namespace {

	int A, B;
	int variable_example = 0;

}  // namespace

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

int Move(vector<int> y) {
	if (A >= 3) {
		for (int i = 0; i < 3; i++) {
			if (y[i] > 0 && y[(i + 1) % 3] > 0) {
				return i;
			}
		}
		for (int i = 0; i < 3; i++) {
			if (y[i] > 0) {
				return i;
			}
		}
		return -1;
	} else {

	}
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
Catherine.cpp: At global scope:
Catherine.cpp:19:6: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
  int variable_example = 0;
      ^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 16172 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 60 ms 15632 KB Output is correct
4 Correct 87 ms 17476 KB Output is correct
5 Correct 76 ms 17356 KB Output is correct
6 Correct 69 ms 16072 KB Output is correct
7 Correct 63 ms 16156 KB Output is correct
8 Correct 84 ms 16856 KB Output is correct
9 Correct 76 ms 16844 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 16172 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 60 ms 15632 KB Output is correct
4 Correct 87 ms 17476 KB Output is correct
5 Correct 76 ms 17356 KB Output is correct
6 Correct 69 ms 16072 KB Output is correct
7 Correct 63 ms 16156 KB Output is correct
8 Correct 84 ms 16856 KB Output is correct
9 Correct 76 ms 16844 KB Output is correct
10 Correct 60 ms 14024 KB Output is correct
11 Correct 81 ms 14228 KB Output is correct
12 Correct 63 ms 14152 KB Output is correct
13 Correct 77 ms 14028 KB Output is correct
14 Correct 56 ms 14320 KB Output is correct
15 Correct 71 ms 14848 KB Output is correct
16 Correct 79 ms 17060 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 13908 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 72 ms 13496 KB Output is correct
4 Correct 88 ms 15300 KB Output is correct
5 Correct 74 ms 15188 KB Output is correct
6 Correct 66 ms 13788 KB Output is correct
7 Correct 68 ms 14012 KB Output is correct
8 Correct 60 ms 14604 KB Output is correct
9 Correct 73 ms 14540 KB Output is correct
10 Correct 73 ms 14512 KB Output is correct
11 Correct 69 ms 14500 KB Output is correct
12 Correct 79 ms 14356 KB Output is correct
13 Correct 75 ms 14492 KB Output is correct
14 Correct 65 ms 14668 KB Output is correct
15 Correct 81 ms 14748 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 13908 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 72 ms 13496 KB Output is correct
4 Correct 88 ms 15300 KB Output is correct
5 Correct 74 ms 15188 KB Output is correct
6 Correct 66 ms 13788 KB Output is correct
7 Correct 68 ms 14012 KB Output is correct
8 Correct 60 ms 14604 KB Output is correct
9 Correct 73 ms 14540 KB Output is correct
10 Correct 73 ms 14512 KB Output is correct
11 Correct 69 ms 14500 KB Output is correct
12 Correct 79 ms 14356 KB Output is correct
13 Correct 75 ms 14492 KB Output is correct
14 Correct 65 ms 14668 KB Output is correct
15 Correct 81 ms 14748 KB Output is correct
16 Correct 57 ms 12364 KB Output is correct
17 Correct 52 ms 12316 KB Output is correct
18 Correct 65 ms 12212 KB Output is correct
19 Correct 54 ms 12268 KB Output is correct
20 Correct 62 ms 12876 KB Output is correct
21 Correct 53 ms 12620 KB Output is correct
22 Correct 75 ms 14804 KB Output is correct
23 Correct 56 ms 12356 KB Output is correct
24 Correct 52 ms 12364 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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