oj.uz

Submission #565953

# Submission time Handle Problem Language Result Execution time Memory
565953 2022-05-21T15:36:13 Z InternetPerson10 Stray Cat (JOI20_stray) C++17
0 / 100
 43 ms 15768 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

#include <vector>

namespace {

    // orig: 1 1 0 1 0 0
vector<int> sixchain = {1, 0, 1, 1, 1, 0};
vector<vector<pair<int, int>>> adj;
vector<int> marks, chain;

struct dsu {
    vector<int> par, siz;
    dsu(int n) {
        par.resize(n);
        siz.resize(n, 1);
        for(int i = 0; i < n; i++) par[i] = i;
    }
    int get(int x) {
        if(par[x] == x) return x;
        return par[x] = get(par[x]);
    }
    bool unite(int x, int y) {
        x = get(x); y = get(y);
        if(x == y) return false;
        if(siz[x] > siz[y]) swap(x, y);
        par[x] = y;
        siz[y] += siz[x];
        return true;
    }
};

void dfs(int n, int par = -1, int na = -1, int ne = -1) {
    if(na != -1) {
        if(adj[par].size() == 2) {
            chain[n] = (chain[par] + 1) % 6;
            if(ne == -1) marks[na] = 0;
            else marks[na] = (sixchain[chain[n]] + marks[ne]) % 2;
        }
        else {
            chain[n] = -1;
            if(ne == -1) marks[na] = 0;
            else marks[na] = (1 + marks[ne]) % 2;
        }
    }
    for(auto p : adj[n]) {
        int ch, nu;
        tie(ch, nu) = p;
        if(ch == par) continue;
        dfs(ch, n, nu, na);
    }
}

}  // namespace

vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
    marks.resize(M, 0);
    chain.resize(N, 0);
    adj.resize(N);
    if(M != N - 1) {
        dsu uf(N);
        vector<int> v1, v2;
        for(int i = 0; i < M; i++) {
            if(!uf.unite(U[i], V[i])) {
                U[i] = V[i] = -1;
                marks[i] = 2;
            }
        }
    }
    for(int i = 0; i < M; i++) {
        if(U[i] == -1) continue;
        adj[U[i]].push_back({V[i], i});
        adj[V[i]].push_back({U[i], i});
    }
    dfs(0);
    return marks;
}

#include "Catherine.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

vector<int> sixchain = {1, 1, 0, 1, 0, 0};
vector<vector<pair<int, int>>> adj;
vector<int> marks, chain;

struct dsu {
    vector<int> par, siz;
    dsu(int n) {
        par.resize(n);
        siz.resize(n, 1);
        for(int i = 0; i < n; i++) par[i] = i;
    }
    int get(int x) {
        if(par[x] == x) return x;
        return par[x] = get(par[x]);
    }
    bool unite(int x, int y) {
        x = get(x); y = get(y);
        if(x == y) return false;
        if(siz[x] > siz[y]) swap(x, y);
        par[x] = y;
        siz[y] += siz[x];
        return true;
    }
};

void dfs(int n, int par = -1, int na = -1) {
    if(na != -1) {
        if(adj[par].size() == 2) {
            chain[n] = (chain[par] + 1) % 6;
            marks[na] = (sixchain[chain[n]] + chain[par]) % 2;
        }
        else {
            chain[n] = -1;
            marks[na] = (1 + chain[par]) % 2;
        }
    }
    for(auto p : adj[n]) {
        int ch, nu;
        tie(ch, nu) = p;
        if(ch == par) continue;
        dfs(ch, n, nu);
    }
}

vector<int> marksGot;
int goBack = -1;
int goUp = 0;

set<vector<int>> goingDown = {
    {1, 1, 0, 1, 0, 0},
    {1, 0, 1, 0, 0, 1},
    {0, 1, 0, 0, 1, 1},
    {1, 0, 0, 1, 1, 0},
    {0, 0, 1, 1, 0, 1},
    {0, 1, 1, 0, 1, 0}
};

}  // namespace

void Init(int A, int B) {
}

vector<int> y;

int findVal(int x) {
    marksGot.push_back(x);
    return x;
}

int Move(std::vector<int> k) {
    y = k;
    int ySize = y[0] + y[1], mini = 2;
    if(y[0]) mini = 0;
    else mini = 1;
    if(marksGot.size() == 0) {
        if(ySize == 1) {
            goUp = 1;
            return findVal(mini);
        }
        if(ySize == 2) {
            return findVal(mini);
        }
        goUp = 1;
        if(y[0] == 1) return findVal(0);
        return findVal(1);
    }
    if(goUp) {
        if(ySize == 1) {
            return findVal(mini);
        }
        int x = marksGot.back();
        return findVal(1-x);
    }
    if(goBack > -1) {
        marksGot.push_back(marksGot[goBack]);
        goBack--;
        if(goBack == -1) goUp = 1;
        return findVal(mini);
    }
    if(ySize == 0) { // Reached leaf
        marksGot.push_back(marksGot.back());
        goUp = 1;
        return -1;
    }
    if(ySize == 1 && marksGot.size() < 6) {
        return findVal(mini);
    }
    if(ySize == 1 && marksGot.size() == 6) {
        if(goingDown.count(marksGot)) {
            goBack = 4;
            marksGot.push_back(marksGot[5]);
            return -1;
        }
        else { // Going up na pala
            goUp = 1;
            return findVal(mini);
        }
    }
    if(ySize > 1) {
        goUp = 1;
        if(y[0] == 0) {
            marksGot.push_back(1);
            return -1;
        }
        if(y[1] == 0) {
            marksGot.push_back(0);
            return -1;
        }
        return findVal(1-marksGot.back());
    }
    while(true) {}
    assert(false);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 15768 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 15768 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13504 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12584 KB Output is correct
4 Correct 41 ms 14960 KB Output is correct
5 Incorrect 41 ms 14928 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13504 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12584 KB Output is correct
4 Correct 41 ms 14960 KB Output is correct
5 Incorrect 41 ms 14928 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 2 ms 1020 KB Output is correct
6 Correct 2 ms 904 KB Output is correct
7 Correct 2 ms 904 KB Output is correct
8 Correct 2 ms 904 KB Output is correct
9 Correct 2 ms 900 KB Output is correct
10 Correct 2 ms 900 KB Output is correct
11 Correct 2 ms 904 KB Output is correct
12 Correct 2 ms 908 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Incorrect 2 ms 852 KB Wrong Answer [5]
15 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 11220 KB Output is correct
2 Correct 35 ms 12180 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 31 ms 11048 KB Output is correct
5 Correct 41 ms 13384 KB Output is correct
6 Correct 40 ms 13440 KB Output is correct
7 Correct 33 ms 12872 KB Output is correct
8 Correct 38 ms 12784 KB Output is correct
9 Correct 40 ms 13800 KB Output is correct
10 Correct 40 ms 13752 KB Output is correct
11 Correct 39 ms 13848 KB Output is correct
12 Correct 40 ms 13804 KB Output is correct
13 Correct 40 ms 13748 KB Output is correct
14 Correct 39 ms 13860 KB Output is correct
15 Correct 43 ms 13784 KB Output is correct
16 Correct 38 ms 13820 KB Output is correct
17 Correct 35 ms 13520 KB Output is correct
18 Correct 37 ms 13440 KB Output is correct
19 Correct 37 ms 13384 KB Output is correct
20 Correct 36 ms 13568 KB Output is correct
21 Correct 36 ms 13464 KB Output is correct
22 Correct 36 ms 13504 KB Output is correct
23 Correct 33 ms 11688 KB Output is correct
24 Correct 31 ms 11796 KB Output is correct
25 Correct 31 ms 12100 KB Output is correct
26 Correct 32 ms 12168 KB Output is correct
27 Correct 37 ms 12812 KB Output is correct
28 Correct 35 ms 12836 KB Output is correct
29 Correct 35 ms 12860 KB Output is correct
30 Correct 37 ms 12832 KB Output is correct
31 Correct 30 ms 11856 KB Output is correct
32 Correct 30 ms 11828 KB Output is correct
33 Incorrect 28 ms 11980 KB Wrong Answer [5]
34 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11236 KB Output is correct
2 Correct 35 ms 12016 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 28 ms 11112 KB Output is correct
5 Correct 39 ms 13476 KB Output is correct
6 Correct 39 ms 13264 KB Output is correct
7 Incorrect 30 ms 12944 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -