oj.uz

답안 #590858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590858 2022-07-06T12:24:00 Z Namnamseo 길고양이 (JOI20_stray) C++17
4 / 100
 63 ms 24348 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 == 2);

    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 40 ms 15804 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 36 ms 15136 KB Output is correct
4 Correct 63 ms 16944 KB Output is correct
5 Correct 48 ms 16904 KB Output is correct
6 Correct 36 ms 15600 KB Output is correct
7 Correct 34 ms 15644 KB Output is correct
8 Correct 48 ms 16200 KB Output is correct
9 Correct 45 ms 16240 KB Output is correct

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15804 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 36 ms 15136 KB Output is correct
4 Correct 63 ms 16944 KB Output is correct
5 Correct 48 ms 16904 KB Output is correct
6 Correct 36 ms 15600 KB Output is correct
7 Correct 34 ms 15644 KB Output is correct
8 Correct 48 ms 16200 KB Output is correct
9 Correct 45 ms 16240 KB Output is correct
10 Correct 37 ms 13668 KB Output is correct
11 Runtime error 44 ms 24348 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13472 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 27 ms 12976 KB Output is correct
4 Correct 43 ms 14720 KB Output is correct
5 Correct 43 ms 14708 KB Output is correct
6 Correct 34 ms 13372 KB Output is correct
7 Correct 37 ms 13392 KB Output is correct
8 Correct 41 ms 14012 KB Output is correct
9 Correct 48 ms 13932 KB Output is correct
10 Correct 46 ms 13696 KB Output is correct
11 Correct 37 ms 13748 KB Output is correct
12 Correct 39 ms 13720 KB Output is correct
13 Correct 37 ms 13760 KB Output is correct
14 Correct 52 ms 14060 KB Output is correct
15 Correct 41 ms 14092 KB Output is correct

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13472 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 27 ms 12976 KB Output is correct
4 Correct 43 ms 14720 KB Output is correct
5 Correct 43 ms 14708 KB Output is correct
6 Correct 34 ms 13372 KB Output is correct
7 Correct 37 ms 13392 KB Output is correct
8 Correct 41 ms 14012 KB Output is correct
9 Correct 48 ms 13932 KB Output is correct
10 Correct 46 ms 13696 KB Output is correct
11 Correct 37 ms 13748 KB Output is correct
12 Correct 39 ms 13720 KB Output is correct
13 Correct 37 ms 13760 KB Output is correct
14 Correct 52 ms 14060 KB Output is correct
15 Correct 41 ms 14092 KB Output is correct
16 Correct 35 ms 12084 KB Output is correct
17 Runtime error 36 ms 20544 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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