oj.uz

Submission #291490

# Submission time Handle Problem Language Result Execution time Memory
291490 2020-09-05T12:01:22 Z zoooma13 Stray Cat (JOI20_stray) C++14
0 / 100
 62 ms 16484 KB 
#include <bits/stdc++.h>
#include "Anthony.h"
using namespace std;

#define all(v) v.begin() ,v.end()

namespace{
    vector <vector<pair<int ,int>>> adj;
    vector <int> enc ,seq = {0,0,1,0,1,1};
    void dfs(int u ,int d=0 ,bool bef=0){
        for(auto&e : adj[u]){
            adj[e.first].erase(find(all(adj[e.first]) ,make_pair(u ,e.second)));
            enc[e.second] = (adj[u].size() == 1? seq[d%6] : bef^1);
            dfs(e.first ,d+1 ,enc[e.second]);
        }
    }
}

vector <int> Mark(int N, int M, int A, int B,vector<int> U,vector<int> V){
    assert(M == N-1);
    adj.resize(N);
    enc.resize(M);
    for(int i=0; i<M; i++){
        adj[U[i]].push_back({V[i] ,i});
        adj[V[i]].push_back({U[i] ,i});
    }
    dfs(0);
    return enc;
}

/**
001011
001101
010011
010110
011001
011010
100101
100110
101001
101100
110010
110100
*/

#include <bits/stdc++.h>
#include "Catherine.h"
using namespace std;

namespace{
    int lst;
    vector <int> bef ,seq = {0,0,1,0,1,1};
}

void Init(int A, int B) {  }

int Move(vector<int> y){
    if(y[0] < y[1] && y[0])
        return lst = 0;
    if(y[1] < y[0] && y[1])
        return lst = 1;

    if(bef.size() == 6){
        for(int t=0; t<6; t++){
            if(bef == seq)
                return -1;
            seq.insert(seq.begin() ,seq.back()) ,seq.pop_back();
        }
    }
    if(y[lst^1])
        lst ^= 1;
    if(!y[lst])
        return -1;
    bef.push_back(lst);
    return lst;
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 13940 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 40 ms 12860 KB Output is correct
4 Correct 62 ms 16024 KB Output is correct
5 Correct 61 ms 16032 KB Output is correct
6 Incorrect 41 ms 13300 KB Wrong Answer [6]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 13940 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 40 ms 12860 KB Output is correct
4 Correct 62 ms 16024 KB Output is correct
5 Correct 61 ms 16032 KB Output is correct
6 Incorrect 41 ms 13300 KB Wrong Answer [6]
7 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1036 KB Output is correct
2 Correct 2 ms 784 KB Output is correct
3 Correct 2 ms 1248 KB Output is correct
4 Correct 2 ms 1224 KB Output is correct
5 Correct 2 ms 1088 KB Output is correct
6 Correct 2 ms 1040 KB Output is correct
7 Correct 2 ms 1104 KB Output is correct
8 Correct 2 ms 1212 KB Output is correct
9 Correct 2 ms 1040 KB Output is correct
10 Correct 2 ms 1084 KB Output is correct
11 Incorrect 2 ms 912 KB Wrong Answer [6]
12 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 11480 KB Output is correct
2 Correct 54 ms 13012 KB Output is correct
3 Correct 1 ms 788 KB Output is correct
4 Correct 37 ms 11324 KB Output is correct
5 Correct 60 ms 14488 KB Output is correct
6 Correct 59 ms 14484 KB Output is correct
7 Correct 48 ms 13972 KB Output is correct
8 Incorrect 44 ms 13976 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 11400 KB Output is correct
2 Incorrect 43 ms 12904 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -