oj.uz

Submission #762337

# Submission time Handle Problem Language Result Execution time Memory
762337 2023-06-21T10:26:33 Z phoebe Stray Cat (JOI20_stray) C++17
15 / 100
 43 ms 16624 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) 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){
                        found_direction = true;
                        last = bruh.back();
                        return last;
                    }
                    else{
                        // cout << "bruh" << endl;
                        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

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15508 KB Output is correct
2 Correct 0 ms 1032 KB Output is correct
3 Correct 23 ms 14832 KB Output is correct
4 Correct 34 ms 16624 KB Output is correct
5 Correct 35 ms 16596 KB Output is correct
6 Correct 30 ms 15244 KB Output is correct
7 Correct 28 ms 15332 KB Output is correct
8 Correct 33 ms 15968 KB Output is correct
9 Correct 33 ms 15928 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 15508 KB Output is correct
2 Correct 0 ms 1032 KB Output is correct
3 Correct 23 ms 14832 KB Output is correct
4 Correct 34 ms 16624 KB Output is correct
5 Correct 35 ms 16596 KB Output is correct
6 Correct 30 ms 15244 KB Output is correct
7 Correct 28 ms 15332 KB Output is correct
8 Correct 33 ms 15968 KB Output is correct
9 Correct 33 ms 15928 KB Output is correct
10 Correct 27 ms 13380 KB Output is correct
11 Correct 28 ms 13328 KB Output is correct
12 Correct 29 ms 13528 KB Output is correct
13 Correct 26 ms 13452 KB Output is correct
14 Correct 27 ms 13668 KB Output is correct
15 Correct 28 ms 14044 KB Output is correct
16 Correct 43 ms 16092 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13104 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12668 KB Output is correct
4 Correct 33 ms 14420 KB Output is correct
5 Correct 33 ms 14428 KB Output is correct
6 Correct 26 ms 13196 KB Output is correct
7 Correct 28 ms 13168 KB Output is correct
8 Correct 38 ms 13660 KB Output is correct
9 Correct 31 ms 13688 KB Output is correct
10 Correct 30 ms 13408 KB Output is correct
11 Correct 30 ms 13424 KB Output is correct
12 Correct 28 ms 13396 KB Output is correct
13 Correct 30 ms 13508 KB Output is correct
14 Correct 32 ms 13792 KB Output is correct
15 Correct 31 ms 13792 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 13104 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12668 KB Output is correct
4 Correct 33 ms 14420 KB Output is correct
5 Correct 33 ms 14428 KB Output is correct
6 Correct 26 ms 13196 KB Output is correct
7 Correct 28 ms 13168 KB Output is correct
8 Correct 38 ms 13660 KB Output is correct
9 Correct 31 ms 13688 KB Output is correct
10 Correct 30 ms 13408 KB Output is correct
11 Correct 30 ms 13424 KB Output is correct
12 Correct 28 ms 13396 KB Output is correct
13 Correct 30 ms 13508 KB Output is correct
14 Correct 32 ms 13792 KB Output is correct
15 Correct 31 ms 13792 KB Output is correct
16 Correct 24 ms 11604 KB Output is correct
17 Correct 24 ms 11632 KB Output is correct
18 Correct 26 ms 11568 KB Output is correct
19 Correct 28 ms 11484 KB Output is correct
20 Correct 30 ms 12112 KB Output is correct
21 Correct 27 ms 11928 KB Output is correct
22 Correct 30 ms 13916 KB Output is correct
23 Correct 28 ms 11604 KB Output is correct
24 Correct 33 ms 11716 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1284 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 11160 KB Output is correct
2 Correct 31 ms 12272 KB Output is correct
3 Correct 1 ms 1060 KB Output is correct
4 Correct 22 ms 11372 KB Output is correct
5 Correct 31 ms 14060 KB Output is correct
6 Correct 31 ms 13944 KB Output is correct
7 Incorrect 27 ms 12904 KB Wrong Answer [5]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 11212 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -