oj.uz

답안 #590859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590859 2022-07-06T12:25:54 Z Namnamseo 길고양이 (JOI20_stray) C++17
4 / 100
 46 ms 17000 KB 
#include "Anthony.h"
#include <bitset>
#include <vector>
using namespace std;
using vi=vector<int>;

namespace {
const int maxn = int(2e4) + 10;

int n;

struct Edge { int l, r; } ev[maxn];
vector<int> es[maxn];
int par[maxn], pei[maxn];
int lev[maxn];
int col[maxn];

void bfs() {
    static int q[maxn];
    static bitset<maxn> vis;
    int f = 0, t = 1; vis.set(0);
    while (f < t) {
        int x = q[f++];
        for (int ei : es[x]) {
            int y = ev[ei].l + ev[ei].r - x;
            if (vis[y]) continue;
            vis.set(y);
            par[y] = x; pei[y] = ei; lev[y] = lev[x]+1;
            q[t++] = y;
        }
    }
}

vi Case1(int N, int M, vi U, vi V) {
    n = N;
    for (int i=0; i<M; ++i) {
        ev[i] = {U[i], V[i]};
        es[U[i]].push_back(i);
        es[V[i]].push_back(i);
    }
    bfs();

    static int pec[maxn];
    for (int i=0; i<M; ++i) {
        int a = ev[i].l, b = ev[i].r;
        if (lev[a] == lev[b]) {
            col[i] = max(lev[a], lev[b])%3;
            ++pec[a]; ++pec[b];
        } else {
            col[i] = min(lev[a], lev[b])%3;
        }
    }
    return vi(col, col+M);
}

}  // namespace

vi Mark(int N, int M, int A, int B, vi U, vi V) {
    if (B == 0) return Case1(N, M, U, V);
    return {};
}

#include "Catherine.h"
#include <cassert>
#include <vector>
using namespace std;
using vi=vector<int>;

namespace {
int A, B;

int Move1(vi &y) {
    int oc = 0;
    for (int i=0; i<3; ++i) if (y[i] == 1) ++oc;
    if (oc == 1) for (int i=0; i<3; ++i) if (y[i] == 1) return i;
    assert(oc != 3);

    int tmp = 0;
    for (int i=0; i<3; ++i) if (y[i] == 1) tmp += i;
    tmp += 2;
    tmp *= 2;
    return tmp % 3;
}

}  // namespace

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

int Move(vi y) {
    if (B == 0) return Move1(y);
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15788 KB Output is correct
2 Correct 0 ms 1028 KB Output is correct
3 Correct 28 ms 15112 KB Output is correct
4 Correct 45 ms 16888 KB Output is correct
5 Correct 43 ms 17000 KB Output is correct
6 Correct 35 ms 15628 KB Output is correct
7 Correct 35 ms 15576 KB Output is correct
8 Correct 44 ms 16348 KB Output is correct
9 Correct 46 ms 16448 KB Output is correct

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15788 KB Output is correct
2 Correct 0 ms 1028 KB Output is correct
3 Correct 28 ms 15112 KB Output is correct
4 Correct 45 ms 16888 KB Output is correct
5 Correct 43 ms 17000 KB Output is correct
6 Correct 35 ms 15628 KB Output is correct
7 Correct 35 ms 15576 KB Output is correct
8 Correct 44 ms 16348 KB Output is correct
9 Correct 46 ms 16448 KB Output is correct
10 Correct 32 ms 13816 KB Output is correct
11 Incorrect 34 ms 13768 KB Wrong Answer [5]
12 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 13380 KB Output is correct
2 Correct 1 ms 1016 KB Output is correct
3 Correct 33 ms 12860 KB Output is correct
4 Correct 40 ms 14744 KB Output is correct
5 Correct 41 ms 14768 KB Output is correct
6 Correct 32 ms 13412 KB Output is correct
7 Correct 32 ms 13424 KB Output is correct
8 Correct 37 ms 13992 KB Output is correct
9 Correct 41 ms 14044 KB Output is correct
10 Correct 35 ms 13668 KB Output is correct
11 Correct 35 ms 13828 KB Output is correct
12 Correct 35 ms 13852 KB Output is correct
13 Correct 37 ms 13784 KB Output is correct
14 Correct 44 ms 14040 KB Output is correct
15 Correct 39 ms 14024 KB Output is correct

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 13380 KB Output is correct
2 Correct 1 ms 1016 KB Output is correct
3 Correct 33 ms 12860 KB Output is correct
4 Correct 40 ms 14744 KB Output is correct
5 Correct 41 ms 14768 KB Output is correct
6 Correct 32 ms 13412 KB Output is correct
7 Correct 32 ms 13424 KB Output is correct
8 Correct 37 ms 13992 KB Output is correct
9 Correct 41 ms 14044 KB Output is correct
10 Correct 35 ms 13668 KB Output is correct
11 Correct 35 ms 13828 KB Output is correct
12 Correct 35 ms 13852 KB Output is correct
13 Correct 37 ms 13784 KB Output is correct
14 Correct 44 ms 14040 KB Output is correct
15 Correct 39 ms 14024 KB Output is correct
16 Correct 28 ms 11828 KB Output is correct
17 Incorrect 34 ms 11836 KB Wrong Answer [5]
18 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1072 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1284 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1288 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -