oj.uz

답안 #762353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762353 2023-06-21T10:35:00 Z phoebe 길고양이 (JOI20_stray) C++17
86 / 100
 41 ms 16844 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, 
is_backtracking = 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 : 0);
            }
            last = next;
            return next;
        }
        if (is_backtracking){
            last = bruh.back(); bruh.pop_back();
            if (bruh.empty()) found_direction = true;
            return last;
        }
        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){
                        is_backtracking = true;
                        last = bruh.back(); bruh.pop_back();
                        return -1;
                    }
                    last = (y[0] ? 0 : 1);
                    bruh.push_back(last);
                    return last;
                }
                else{ // completed
                    if (cnt == 1){
                        is_backtracking = true;
                        last = bruh.back(); bruh.pop_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();
                        is_backtracking = true;
                        last = bruh.back(); bruh.pop_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 32 ms 15848 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 25 ms 15172 KB Output is correct
4 Correct 35 ms 16844 KB Output is correct
5 Correct 35 ms 16828 KB Output is correct
6 Correct 27 ms 15584 KB Output is correct
7 Correct 28 ms 15532 KB Output is correct
8 Correct 33 ms 16312 KB Output is correct
9 Correct 33 ms 16176 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 15848 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 25 ms 15172 KB Output is correct
4 Correct 35 ms 16844 KB Output is correct
5 Correct 35 ms 16828 KB Output is correct
6 Correct 27 ms 15584 KB Output is correct
7 Correct 28 ms 15532 KB Output is correct
8 Correct 33 ms 16312 KB Output is correct
9 Correct 33 ms 16176 KB Output is correct
10 Correct 28 ms 13804 KB Output is correct
11 Correct 26 ms 13624 KB Output is correct
12 Correct 26 ms 13676 KB Output is correct
13 Correct 26 ms 13692 KB Output is correct
14 Correct 27 ms 13892 KB Output is correct
15 Correct 30 ms 14304 KB Output is correct
16 Correct 32 ms 16288 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13396 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 23 ms 12972 KB Output is correct
4 Correct 41 ms 14520 KB Output is correct
5 Correct 33 ms 14612 KB Output is correct
6 Correct 27 ms 13352 KB Output is correct
7 Correct 27 ms 13364 KB Output is correct
8 Correct 31 ms 13996 KB Output is correct
9 Correct 32 ms 13988 KB Output is correct
10 Correct 34 ms 13608 KB Output is correct
11 Correct 28 ms 13696 KB Output is correct
12 Correct 28 ms 13732 KB Output is correct
13 Correct 28 ms 13824 KB Output is correct
14 Correct 30 ms 14052 KB Output is correct
15 Correct 31 ms 14144 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13396 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 23 ms 12972 KB Output is correct
4 Correct 41 ms 14520 KB Output is correct
5 Correct 33 ms 14612 KB Output is correct
6 Correct 27 ms 13352 KB Output is correct
7 Correct 27 ms 13364 KB Output is correct
8 Correct 31 ms 13996 KB Output is correct
9 Correct 32 ms 13988 KB Output is correct
10 Correct 34 ms 13608 KB Output is correct
11 Correct 28 ms 13696 KB Output is correct
12 Correct 28 ms 13732 KB Output is correct
13 Correct 28 ms 13824 KB Output is correct
14 Correct 30 ms 14052 KB Output is correct
15 Correct 31 ms 14144 KB Output is correct
16 Correct 25 ms 11856 KB Output is correct
17 Correct 25 ms 11908 KB Output is correct
18 Correct 25 ms 11740 KB Output is correct
19 Correct 25 ms 11796 KB Output is correct
20 Correct 27 ms 12372 KB Output is correct
21 Correct 28 ms 12076 KB Output is correct
22 Correct 28 ms 14136 KB Output is correct
23 Correct 27 ms 11948 KB Output is correct
24 Correct 26 ms 11876 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 27 ms 11544 KB Output is correct
2 Correct 27 ms 12576 KB Output is correct
3 Correct 1 ms 1028 KB Output is correct
4 Correct 20 ms 11388 KB Output is correct
5 Correct 31 ms 13776 KB Output is correct
6 Correct 30 ms 13532 KB Output is correct
7 Correct 26 ms 12560 KB Output is correct
8 Correct 26 ms 13216 KB Output is correct
9 Correct 31 ms 14036 KB Output is correct
10 Correct 31 ms 13960 KB Output is correct
11 Correct 30 ms 14020 KB Output is correct
12 Correct 30 ms 14072 KB Output is correct
13 Correct 31 ms 14092 KB Output is correct
14 Correct 30 ms 13900 KB Output is correct
15 Correct 30 ms 13844 KB Output is correct
16 Correct 31 ms 13868 KB Output is correct
17 Correct 28 ms 13648 KB Output is correct
18 Correct 30 ms 13708 KB Output is correct
19 Correct 28 ms 13748 KB Output is correct
20 Correct 28 ms 13764 KB Output is correct
21 Correct 28 ms 13656 KB Output is correct
22 Correct 28 ms 13744 KB Output is correct
23 Correct 24 ms 11704 KB Output is correct
24 Correct 25 ms 11692 KB Output is correct
25 Correct 25 ms 12096 KB Output is correct
26 Correct 25 ms 12032 KB Output is correct
27 Correct 27 ms 12892 KB Output is correct
28 Correct 31 ms 12992 KB Output is correct
29 Correct 28 ms 12868 KB Output is correct
30 Correct 27 ms 12956 KB Output is correct
31 Correct 26 ms 11712 KB Output is correct
32 Correct 25 ms 11716 KB Output is correct
33 Correct 26 ms 12104 KB Output is correct
34 Correct 27 ms 12108 KB Output is correct
35 Correct 30 ms 12720 KB Output is correct
36 Correct 27 ms 12772 KB Output is correct
37 Correct 27 ms 12784 KB Output is correct
38 Correct 27 ms 12772 KB Output is correct
39 Correct 30 ms 12752 KB Output is correct
40 Correct 27 ms 12712 KB Output is correct
41 Correct 28 ms 13168 KB Output is correct
42 Correct 30 ms 13232 KB Output is correct
43 Correct 33 ms 13328 KB Output is correct
44 Correct 31 ms 13384 KB Output is correct
45 Correct 28 ms 13420 KB Output is correct
46 Correct 31 ms 13376 KB Output is correct
47 Correct 41 ms 12608 KB Output is correct
48 Correct 27 ms 12524 KB Output is correct
49 Correct 27 ms 12592 KB Output is correct
50 Correct 27 ms 12700 KB Output is correct
51 Correct 24 ms 11856 KB Output is correct
52 Correct 25 ms 11892 KB Output is correct
53 Correct 26 ms 11900 KB Output is correct
54 Correct 25 ms 11852 KB Output is correct
55 Correct 26 ms 11820 KB Output is correct
56 Correct 26 ms 11784 KB Output is correct
57 Correct 27 ms 11948 KB Output is correct
58 Correct 27 ms 11948 KB Output is correct
59 Correct 26 ms 11892 KB Output is correct
60 Correct 25 ms 11840 KB Output is correct

Subtask #7
0 / 9.0

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