oj.uz

Submission #566002

# Submission time Handle Problem Language Result Execution time Memory
566002 2022-05-21T16:17:52 Z InternetPerson10 Stray Cat (JOI20_stray) C++17
5 / 100
 3000 ms 15624 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, 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, 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]];
        }
        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;

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(goBack > -1) {
        goBack--;
        if(goBack == -1) goUp = 1;
        return findVal(mini);
    }
    if(goUp) {
        if(ySize == 0) {
            while(true) {}
        }
        if(ySize == 1) {
            return findVal(mini);
        }
        int x = marksGot.back();
        return findVal(1-x);
    }
    if(ySize == 0) { // Reached leaf
        marksGot.push_back(marksGot.back());
        goBack = marksGot.size();
        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 46 ms 15624 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13296 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12680 KB Output is correct
4 Correct 48 ms 14868 KB Output is correct
5 Incorrect 45 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 33 ms 13296 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 30 ms 12680 KB Output is correct
4 Correct 48 ms 14868 KB Output is correct
5 Incorrect 45 ms 14928 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 2 ms 904 KB Output is correct
4 Correct 2 ms 904 KB Output is correct
5 Correct 2 ms 896 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 904 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 904 KB Output is correct
12 Correct 2 ms 904 KB Output is correct
13 Correct 2 ms 900 KB Output is correct
14 Correct 2 ms 904 KB Output is correct
15 Correct 2 ms 904 KB Output is correct
16 Correct 2 ms 904 KB Output is correct
17 Correct 2 ms 904 KB Output is correct
18 Correct 2 ms 904 KB Output is correct
19 Correct 2 ms 900 KB Output is correct
20 Correct 2 ms 896 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 2 ms 896 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 988 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 2 ms 896 KB Output is correct
28 Correct 2 ms 896 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 11152 KB Output is correct
2 Correct 40 ms 12020 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 32 ms 11100 KB Output is correct
5 Correct 45 ms 13400 KB Output is correct
6 Correct 46 ms 13320 KB Output is correct
7 Correct 37 ms 12448 KB Output is correct
8 Correct 33 ms 12388 KB Output is correct
9 Correct 40 ms 13364 KB Output is correct
10 Correct 40 ms 13408 KB Output is correct
11 Correct 43 ms 13332 KB Output is correct
12 Correct 40 ms 13332 KB Output is correct
13 Correct 40 ms 13444 KB Output is correct
14 Correct 38 ms 13300 KB Output is correct
15 Correct 39 ms 13336 KB Output is correct
16 Correct 38 ms 13496 KB Output is correct
17 Correct 40 ms 13156 KB Output is correct
18 Correct 36 ms 12956 KB Output is correct
19 Correct 37 ms 13024 KB Output is correct
20 Correct 41 ms 12976 KB Output is correct
21 Correct 40 ms 13040 KB Output is correct
22 Correct 39 ms 12972 KB Output is correct
23 Correct 31 ms 11236 KB Output is correct
24 Correct 32 ms 11148 KB Output is correct
25 Correct 34 ms 11600 KB Output is correct
26 Correct 34 ms 11528 KB Output is correct
27 Correct 37 ms 12208 KB Output is correct
28 Correct 37 ms 12216 KB Output is correct
29 Correct 44 ms 12264 KB Output is correct
30 Correct 39 ms 12184 KB Output is correct
31 Correct 32 ms 11284 KB Output is correct
32 Correct 31 ms 11252 KB Output is correct
33 Correct 30 ms 11472 KB Output is correct
34 Correct 32 ms 11496 KB Output is correct
35 Correct 34 ms 12172 KB Output is correct
36 Correct 36 ms 12172 KB Output is correct
37 Correct 34 ms 12096 KB Output is correct
38 Correct 37 ms 12056 KB Output is correct
39 Correct 37 ms 12136 KB Output is correct
40 Correct 36 ms 12208 KB Output is correct
41 Correct 38 ms 12652 KB Output is correct
42 Correct 35 ms 12664 KB Output is correct
43 Correct 37 ms 12768 KB Output is correct
44 Correct 36 ms 12808 KB Output is correct
45 Correct 38 ms 12640 KB Output is correct
46 Correct 41 ms 12724 KB Output is correct
47 Correct 34 ms 12108 KB Output is correct
48 Correct 34 ms 11984 KB Output is correct
49 Correct 34 ms 12028 KB Output is correct
50 Correct 34 ms 12100 KB Output is correct
51 Correct 33 ms 11316 KB Output is correct
52 Correct 34 ms 11416 KB Output is correct
53 Correct 33 ms 11520 KB Output is correct
54 Execution timed out 3075 ms 11524 KB Time limit exceeded
55 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 11204 KB Output is correct
2 Correct 36 ms 11904 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 27 ms 11112 KB Output is correct
5 Correct 48 ms 13360 KB Output is correct
6 Correct 44 ms 13428 KB Output is correct
7 Incorrect 34 ms 12424 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -