oj.uz

Submission #925457

# Submission time Handle Problem Language Result Execution time Memory
925457 2024-02-11T16:46:23 Z adaawf Stray Cat (JOI20_stray) C++14
15 / 100
 3000 ms 16776 KB 
//#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
    vector<pair<int, int>> g[20005];
    int f[20005], dx[] = {1, 0, 1, 0, 0, 1}, dd[20005];
    vector<int> res;
    void dfs(int x, int p) {
        int c = 0;
        for (auto w : g[x]) {
            if (w.second == p) continue;
            c++;
            if (c == 1) {
                for (auto w : g[x]) {
                    if (w.second == p) continue;
                    res[w.second] = dx[f[x]];
                    f[w.first] = (f[x] + 1) % 6;
                    dfs(w.first, w.second);
                }
            }
            else {
                for (auto w : g[x]) {
                    if (w.second == p) continue;
                    if (p == -1) res[w.second] = 0;
                    else res[w.second] = res[p] ^ 1;
                    if (res[w.second] == 1) f[w.first] = 1;
                    else f[w.first] = 2;
                    dfs(w.first, w.second);
                }
            }
        }
    }
    void bfs() {
        queue<int> q;
        q.push(0);
        memset(dd, 0, sizeof dd);
        dd[0] = 1;
        int d = 0;
        while (!q.empty()) {
            int h = q.size();
            for (int i = 0; i < h; i++) {
                int p = q.front();
                q.pop();
                f[p] = d;
                for (auto w : g[p]) {
                    if (dd[w.first] == 0) {
                        dd[w.first] = 1;
                        q.push(w.first);
                    }
                }
            }
            d++;
        }
    }
}
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
	res.resize(M);
	for (int i = 0; i < M; i++) {
		g[U[i]].push_back({V[i], i});
		g[V[i]].push_back({U[i], i});
	}
	if (A == 2) {
		for (int i = 0; i < N; i++) f[i] = 0;
		dfs(0, -1);
	}
	else {
		bfs();
		for (int i = 0; i < M; i++) {
			res[i] = min(f[U[i]], f[V[i]]) % 3;
		}
	}
	return res;
}

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
    int A, B, s = 1, flag = 0, k = 0, c = 0, dd[35];
    vector<int> v(5, 0);
}
void Init(int a, int b) {
    A = a;
    B = b;
}
int Move(vector<int> y) {
    dd[5] = dd[18] = dd[25] = dd[12] = dd[22] = dd[11] = 1;
  	if (A == 2) {
		if (s != 0) {
			s = 0;
			if (y[0] + y[1] != 2) {
				if (min(y[0], y[1]) == 0) {
                    if (y[0] < y[1]) k = 1;
                    else k = 0;
				}
				else {
                    if (y[0] > y[1]) k = 1;
                    else k = 0;
				}
				return k;
			}
			else {
				flag = 1;
                if (y[0] < y[1]) k = 1;
                else k = 0;
				y[k]--;
                if (y[0] < y[1]) v[c++] = 1;
                else v[c++] = 0;
				v[c++] = k;
				return k;
			}
		}
		else {
			if (flag == 0) {
				if (min(y[0], y[1]) == 0) {
                    if (y[0] < y[1]) k = 1;
                    else k = 0;
				}
				else k ^= 1;
				return k;
			}
			else {
				if (y[0] + y[1] != 1) {
					flag = c = 0;
					if (min(y[0], y[1]) == 0) return -1;
                    k ^= 1;
                    return k;
				}
                if (y[0] < y[1]) k = 1;
                else k = 0;
                v[c++] = k;
                if (c == 5) {
                    flag = 0;
                    int d = 0;
                    for (int i = 0; i < 5; i++) d += v[i] * (1 << i);
                    if (dd[d] == 0) {
                        return k;
                    }
                    k = v[3];
                    return -1;
                }
                return k;
			}
		}
  	}
	else {
		vector<int> v;
		for (int i = 0; i < 3; i++) {
            if (y[i] != 0) {
                v.push_back(i);
            }
		}
		if (v.size() == 1) {
            return v[0];
		}
        if (v[0] == 0) {
            if (v[1] == 1) return 0;
            return 2;
        }
        return 1;
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15496 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 30 ms 15072 KB Output is correct
4 Correct 37 ms 16776 KB Output is correct
5 Correct 37 ms 16696 KB Output is correct
6 Correct 26 ms 15480 KB Output is correct
7 Correct 34 ms 15468 KB Output is correct
8 Correct 34 ms 16088 KB Output is correct
9 Correct 32 ms 16256 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 15496 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 30 ms 15072 KB Output is correct
4 Correct 37 ms 16776 KB Output is correct
5 Correct 37 ms 16696 KB Output is correct
6 Correct 26 ms 15480 KB Output is correct
7 Correct 34 ms 15468 KB Output is correct
8 Correct 34 ms 16088 KB Output is correct
9 Correct 32 ms 16256 KB Output is correct
10 Correct 25 ms 13744 KB Output is correct
11 Correct 25 ms 13508 KB Output is correct
12 Correct 25 ms 13672 KB Output is correct
13 Correct 30 ms 13684 KB Output is correct
14 Correct 26 ms 13860 KB Output is correct
15 Correct 28 ms 14204 KB Output is correct
16 Correct 32 ms 16192 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 13388 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 27 ms 13008 KB Output is correct
4 Correct 32 ms 14548 KB Output is correct
5 Correct 36 ms 14712 KB Output is correct
6 Correct 26 ms 13176 KB Output is correct
7 Correct 31 ms 13156 KB Output is correct
8 Correct 31 ms 13908 KB Output is correct
9 Correct 30 ms 13852 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 30 ms 14164 KB Output is correct
12 Correct 33 ms 13676 KB Output is correct
13 Correct 30 ms 13648 KB Output is correct
14 Correct 30 ms 13936 KB Output is correct
15 Correct 31 ms 13944 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 13388 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 27 ms 13008 KB Output is correct
4 Correct 32 ms 14548 KB Output is correct
5 Correct 36 ms 14712 KB Output is correct
6 Correct 26 ms 13176 KB Output is correct
7 Correct 31 ms 13156 KB Output is correct
8 Correct 31 ms 13908 KB Output is correct
9 Correct 30 ms 13852 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 30 ms 14164 KB Output is correct
12 Correct 33 ms 13676 KB Output is correct
13 Correct 30 ms 13648 KB Output is correct
14 Correct 30 ms 13936 KB Output is correct
15 Correct 31 ms 13944 KB Output is correct
16 Correct 24 ms 11620 KB Output is correct
17 Correct 23 ms 11640 KB Output is correct
18 Correct 27 ms 11728 KB Output is correct
19 Correct 28 ms 11636 KB Output is correct
20 Correct 30 ms 12408 KB Output is correct
21 Correct 26 ms 12152 KB Output is correct
22 Correct 30 ms 14192 KB Output is correct
23 Correct 25 ms 11896 KB Output is correct
24 Correct 32 ms 11888 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1568 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 83 ms 1600 KB Output is correct
4 Correct 2 ms 1564 KB Output is correct
5 Correct 2 ms 1560 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1560 KB Output is correct
8 Correct 2 ms 1772 KB Output is correct
9 Correct 1 ms 1568 KB Output is correct
10 Correct 2 ms 1560 KB Output is correct
11 Correct 1 ms 1560 KB Output is correct
12 Execution timed out 3039 ms 1112 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3038 ms 2140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3052 ms 2140 KB Time limit exceeded
2 Halted 0 ms 0 KB -