oj.uz

답안 #762362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762362 2023-06-21T10:42:00 Z phoebe 길고양이 (JOI20_stray) C++17
86 / 100
 43 ms 16588 KB 
#include <bits/stdc++.h>
#include "Anthony.h"
using namespace std;

#define pii pair<int, int>
#define F first
#define S second

static const int maxn = 2e4 + 10;
static int n, m, a, b, 
seq[] = {0, 1, 0, 1, 1, 0},
dist[maxn];
static vector<pii> adj[maxn];
static vector<int> x;

void mark1(){
    fill(dist, dist + n, -1);
    queue<int> q; 
    q.push(0); dist[0] = 0;
    while (!q.empty()){
        int v = q.front(); q.pop();
        for (auto k : adj[v]){
            int u = k.F, i = k.S;
            if (dist[u] != -1) continue;
            dist[u] = dist[v] + 1;
            q.push(u);
        }
    }
}

void mark2(int v, int p, int last_idx){
    int cnt_children = 0, next_idx;
    for (auto k : adj[v]){
        int u = k.F, i = k.S;
        if (u != p) cnt_children++;
    }
    if (cnt_children <= 1){ // line
        next_idx = (last_idx == 5 ? 0 : last_idx + 1);
    }
    else{ // multiple children
        next_idx = (seq[last_idx] == 0 ? 1 : 0);
    }
    for (auto k : adj[v]){
        int u = k.F, i = k.S;
        if (u == p) continue;
        x[i] = seq[next_idx];
        mark2(u, v, next_idx);
    }
}

vector<int> Mark(int N, int M, int A, int B, 
vector<int> U, vector<int> V){
    n = N, m = M, a = A, b = B;
    x.resize(m, -1);
    for (int i = 0; i < m; i++){
        adj[U[i]].push_back({V[i], i});
        adj[V[i]].push_back({U[i], i});
    }
    if (a >= 3){ // type 1: bfs tree; 2 -> 1 -> 0
        mark1();
        for (int v = 0; v < n; v++){
            for (auto k : adj[v]){
                int u = k.F, i = k.S;
                if (dist[u] < dist[v]) x[i] = dist[u] % 3;
                else x[i] = dist[v] % 3;
            }
        }
    }
    else{
        mark2(0, 0, 0);
        // for (int v = 0; v < n; v++){
        //     cout << v << endl;
        //     for (auto k : adj[v]){
        //         cout << "to " << k.F << ": " << x[k.S] << endl;
        //     }
        //     cout << endl;
        //     cout << endl;
        // }
    }
    return x;
}
#include <bits/stdc++.h>
#include "Catherine.h"
using namespace std;

#define pii pair<int, int>
#define F first
#define S second

static const int maxn = 2e4 + 10;
static int n, m, a, b, last = -1,
seq[] = {0, 1, 0, 1, 1, 0};
static bool is_type_1, found_direction = false;
static vector<int> bruh;

void Init(int A, int B){
    a = A, b = B;
    if (a >= 3) is_type_1 = true;
    else is_type_1 = false;
}

int Move(vector<int> y){
    if (is_type_1){
        // for (auto k : y) cout << k << ' '; cout << endl;
        for (int i = 0; i < a; i++){
            int next = (i == 0 ? 2 : i - 1);
            if (y[i] > 0 && y[next] == 0) return i;
        }
        return -1;
    }
    else{
        if (found_direction){
            int cnt = y[0] + y[1] + 1, next;
            if (cnt >= 3){ // not line
                y[last]++;
                next = (y[0] < y[1] ? 0 : 1);
            }
            else{ // is line
                next = (y[0] ? 0 : 1);
            }
            last = next;
            return next;
        }
        else{
            vector<int> x = y;
            if (last != -1) x[last]++;
            int cnt = x[0] + x[1], next;
            if (cnt >= 3){ // not line
                found_direction = true;
                next = (x[0] < x[1] ? 0 : 1);
                last = next;
                return next;
            }
            else{
                if (last == -1){ // first one
                    if (cnt == 1){
                        found_direction = true;
                        last = (y[0] ? 0 : 1);
                    }
                    else if (y[0] == 2){
                        bruh.push_back(0);
                        last = 0;
                    }
                    else if (y[0] == 1){
                        bruh.push_back(0);
                        last = 1;
                    }
                    else if (y[0] == 0){
                        bruh.push_back(1);
                        last = 1;
                    }
                    // cout << last << endl;
                    bruh.push_back(last);
                    return last;
                }
                else if (bruh.size() <= 3){
                    if (cnt == 1){
                        found_direction = true;
                        last = bruh.back(); 
                        return -1;
                    }
                    last = (y[0] ? 0 : 1);
                    bruh.push_back(last);
                    return last;
                }
                else{ // completed
                    if (cnt == 1){
                        found_direction = true;
                        last = bruh.back(); 
                        return -1;
                    }
                    bruh.push_back(y[0] ? 0 : 1);
                    // for (auto k : bruh) cout << k << ' '; cout << endl;
                    bool is_right = false;
                    for (int start = 0; start < 6; start++){
                        bool pos = true;
                        for (int i = 0; i < 5; i++){
                            if (bruh[i] != seq[(start - i + 6) % 6]) pos = false;
                        }
                        if (pos) is_right = true;
                    }
                    if (is_right){
                        // cout << "right" << endl;
                        found_direction = true;
                        last = bruh.back();
                        return last;
                    }
                    else{
                        // cout << "bruh" << endl;
                        bruh.pop_back();
                        found_direction = true;
                        last = bruh.back();
                        return -1;
                    }
                }
            }
        }
    }
    return -1;
}

Compilation message

Anthony.cpp: In function 'void mark1()':
Anthony.cpp:23:26: warning: unused variable 'i' [-Wunused-variable]
   23 |             int u = k.F, i = k.S;
      |                          ^
Anthony.cpp: In function 'void mark2(int, int, int)':
Anthony.cpp:34:22: warning: unused variable 'i' [-Wunused-variable]
   34 |         int u = k.F, i = k.S;
      |                      ^

Catherine.cpp:10:15: warning: 'm' defined but not used [-Wunused-variable]
   10 | static int n, m, a, b, last = -1,
      |               ^
Catherine.cpp:10:12: warning: 'n' defined but not used [-Wunused-variable]
   10 | static int n, m, a, b, last = -1,
      |            ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15660 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 27 ms 14892 KB Output is correct
4 Correct 40 ms 16544 KB Output is correct
5 Correct 34 ms 16588 KB Output is correct
6 Correct 27 ms 15248 KB Output is correct
7 Correct 28 ms 15412 KB Output is correct
8 Correct 33 ms 15956 KB Output is correct
9 Correct 37 ms 15920 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15660 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 27 ms 14892 KB Output is correct
4 Correct 40 ms 16544 KB Output is correct
5 Correct 34 ms 16588 KB Output is correct
6 Correct 27 ms 15248 KB Output is correct
7 Correct 28 ms 15412 KB Output is correct
8 Correct 33 ms 15956 KB Output is correct
9 Correct 37 ms 15920 KB Output is correct
10 Correct 26 ms 13420 KB Output is correct
11 Correct 27 ms 13352 KB Output is correct
12 Correct 28 ms 13356 KB Output is correct
13 Correct 25 ms 13472 KB Output is correct
14 Correct 27 ms 13696 KB Output is correct
15 Correct 30 ms 14012 KB Output is correct
16 Correct 31 ms 16104 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13160 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 24 ms 12676 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 43 ms 14296 KB Output is correct
6 Correct 32 ms 13108 KB Output is correct
7 Correct 25 ms 13160 KB Output is correct
8 Correct 28 ms 13680 KB Output is correct
9 Correct 42 ms 13684 KB Output is correct
10 Correct 28 ms 13528 KB Output is correct
11 Correct 31 ms 13360 KB Output is correct
12 Correct 35 ms 13380 KB Output is correct
13 Correct 27 ms 13420 KB Output is correct
14 Correct 28 ms 13800 KB Output is correct
15 Correct 30 ms 13660 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13160 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 24 ms 12676 KB Output is correct
4 Correct 33 ms 14328 KB Output is correct
5 Correct 43 ms 14296 KB Output is correct
6 Correct 32 ms 13108 KB Output is correct
7 Correct 25 ms 13160 KB Output is correct
8 Correct 28 ms 13680 KB Output is correct
9 Correct 42 ms 13684 KB Output is correct
10 Correct 28 ms 13528 KB Output is correct
11 Correct 31 ms 13360 KB Output is correct
12 Correct 35 ms 13380 KB Output is correct
13 Correct 27 ms 13420 KB Output is correct
14 Correct 28 ms 13800 KB Output is correct
15 Correct 30 ms 13660 KB Output is correct
16 Correct 23 ms 11608 KB Output is correct
17 Correct 28 ms 11616 KB Output is correct
18 Correct 28 ms 11416 KB Output is correct
19 Correct 33 ms 11436 KB Output is correct
20 Correct 37 ms 12092 KB Output is correct
21 Correct 28 ms 11884 KB Output is correct
22 Correct 28 ms 13960 KB Output is correct
23 Correct 32 ms 11552 KB Output is correct
24 Correct 24 ms 11608 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11180 KB Output is correct
2 Correct 27 ms 12396 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 24 ms 11052 KB Output is correct
5 Correct 33 ms 13560 KB Output is correct
6 Correct 37 ms 13584 KB Output is correct
7 Correct 26 ms 12684 KB Output is correct
8 Correct 30 ms 12688 KB Output is correct
9 Correct 41 ms 13488 KB Output is correct
10 Correct 43 ms 13544 KB Output is correct
11 Correct 32 ms 13500 KB Output is correct
12 Correct 35 ms 13528 KB Output is correct
13 Correct 30 ms 13536 KB Output is correct
14 Correct 38 ms 13528 KB Output is correct
15 Correct 30 ms 13532 KB Output is correct
16 Correct 32 ms 13600 KB Output is correct
17 Correct 33 ms 13236 KB Output is correct
18 Correct 32 ms 13180 KB Output is correct
19 Correct 28 ms 13144 KB Output is correct
20 Correct 28 ms 13236 KB Output is correct
21 Correct 40 ms 13244 KB Output is correct
22 Correct 27 ms 13284 KB Output is correct
23 Correct 24 ms 11228 KB Output is correct
24 Correct 25 ms 11176 KB Output is correct
25 Correct 25 ms 11528 KB Output is correct
26 Correct 30 ms 12080 KB Output is correct
27 Correct 34 ms 12424 KB Output is correct
28 Correct 28 ms 12460 KB Output is correct
29 Correct 30 ms 12424 KB Output is correct
30 Correct 28 ms 12392 KB Output is correct
31 Correct 26 ms 11696 KB Output is correct
32 Correct 30 ms 11248 KB Output is correct
33 Correct 26 ms 12020 KB Output is correct
34 Correct 30 ms 11748 KB Output is correct
35 Correct 27 ms 12260 KB Output is correct
36 Correct 32 ms 12796 KB Output is correct
37 Correct 27 ms 12628 KB Output is correct
38 Correct 28 ms 12176 KB Output is correct
39 Correct 27 ms 12852 KB Output is correct
40 Correct 34 ms 12212 KB Output is correct
41 Correct 27 ms 13024 KB Output is correct
42 Correct 30 ms 13276 KB Output is correct
43 Correct 33 ms 12908 KB Output is correct
44 Correct 30 ms 12968 KB Output is correct
45 Correct 28 ms 13300 KB Output is correct
46 Correct 30 ms 13352 KB Output is correct
47 Correct 35 ms 12608 KB Output is correct
48 Correct 28 ms 12608 KB Output is correct
49 Correct 28 ms 12552 KB Output is correct
50 Correct 27 ms 12628 KB Output is correct
51 Correct 32 ms 11840 KB Output is correct
52 Correct 31 ms 11932 KB Output is correct
53 Correct 37 ms 11792 KB Output is correct
54 Correct 25 ms 11892 KB Output is correct
55 Correct 26 ms 11836 KB Output is correct
56 Correct 31 ms 11860 KB Output is correct
57 Correct 37 ms 11952 KB Output is correct
58 Correct 26 ms 11980 KB Output is correct
59 Correct 26 ms 11836 KB Output is correct
60 Correct 25 ms 11832 KB Output is correct

Subtask #7
0 / 9.0

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