oj.uz

Submission #778510

# Submission time Handle Problem Language Result Execution time Memory
778510 2023-07-10T11:29:33 Z bachhoangxuan Stray Cat (JOI20_stray) C++17
15 / 100
 42 ms 19152 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
namespace {
    int c[]={0,1,0,0,1,1};

}  // namespace

vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
    vector<int> X(M),dep(N,-1);
    vector<vector<pii>> edge(N);
    for(int i=0;i<M;i++) edge[U[i]].push_back({V[i],i}),edge[V[i]].push_back({U[i],i});
    queue<pii> q;q.push({0,0});dep[0]=0;
    while(!q.empty()){
        auto [u,d]=q.front();q.pop();
        for(auto [v,id]:edge[u]){
            if(B){
                if(dep[v]!=-1) continue;
                int nd=((int)edge[v].size()==2?(d+1)%6:(d^1));
                q.push({v,dep[v]=nd});X[id]=c[d];
            }
            else if(dep[v]==-1) dep[v]=d+1,q.push({v,dep[v]});
        }
    }
    if(!B) for(int i=0;i<M;i++) X[i]=min(dep[U[i]],dep[V[i]])%3;
    return X;
}

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

namespace {
    int A,B,p=-1;
    int up=0,st=0,num=0;
    int f[81];
}  // namespace

void Init(int A, int B) {
    ::A = A;
    ::B = B;
    for(int i=0;i<81;i++) f[i]=-2;
    f[39]=-1;f[43]=0;f[32]=-1;f[13]=1;
    f[16]=-1;f[31]=0;f[67]=-1;f[64]=1;

}

int Move(std::vector<int> y) {
    auto g = [&](int val){
        p=(val==-1?p:val);
        if(val!=-1) assert(y[val]);
        return val;
    };
    if(A==2){
        int d=y[0]+y[1]+(st!=0);st++;
        if(up) return g(d>=3?(p^1):y[1]);
        if(d==1) return up=true,g(st!=1?-1:y[1]);
        if(d>2) return up=true,g(y[0]==0 || y[1]==0?-1:(y[1]+(p==1)>y[0]+(p==0)?0:1));
        num=num*3+y[1]+(p==1);
        if(st<=3) return g(!y[0]);
        else return up=true,g(f[num]);
    }
    else for(int i=0;i<3;i++) if(y[i] && !y[(i+2)%3]) return i;
    return -2;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15124 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14516 KB Output is correct
4 Correct 35 ms 16188 KB Output is correct
5 Correct 39 ms 16048 KB Output is correct
6 Correct 35 ms 14744 KB Output is correct
7 Correct 30 ms 14748 KB Output is correct
8 Correct 36 ms 15512 KB Output is correct
9 Correct 33 ms 15704 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15124 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 31 ms 14516 KB Output is correct
4 Correct 35 ms 16188 KB Output is correct
5 Correct 39 ms 16048 KB Output is correct
6 Correct 35 ms 14744 KB Output is correct
7 Correct 30 ms 14748 KB Output is correct
8 Correct 36 ms 15512 KB Output is correct
9 Correct 33 ms 15704 KB Output is correct
10 Correct 28 ms 12920 KB Output is correct
11 Correct 30 ms 13036 KB Output is correct
12 Correct 26 ms 12952 KB Output is correct
13 Correct 25 ms 12800 KB Output is correct
14 Correct 26 ms 13172 KB Output is correct
15 Correct 28 ms 13584 KB Output is correct
16 Correct 42 ms 15528 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 12644 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 25 ms 12296 KB Output is correct
4 Correct 33 ms 13936 KB Output is correct
5 Correct 40 ms 13880 KB Output is correct
6 Correct 27 ms 12656 KB Output is correct
7 Correct 26 ms 12656 KB Output is correct
8 Correct 28 ms 13276 KB Output is correct
9 Correct 36 ms 13180 KB Output is correct
10 Correct 27 ms 13104 KB Output is correct
11 Correct 34 ms 13048 KB Output is correct
12 Correct 33 ms 13016 KB Output is correct
13 Correct 30 ms 13044 KB Output is correct
14 Correct 34 ms 13356 KB Output is correct
15 Correct 30 ms 13396 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 12644 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 25 ms 12296 KB Output is correct
4 Correct 33 ms 13936 KB Output is correct
5 Correct 40 ms 13880 KB Output is correct
6 Correct 27 ms 12656 KB Output is correct
7 Correct 26 ms 12656 KB Output is correct
8 Correct 28 ms 13276 KB Output is correct
9 Correct 36 ms 13180 KB Output is correct
10 Correct 27 ms 13104 KB Output is correct
11 Correct 34 ms 13048 KB Output is correct
12 Correct 33 ms 13016 KB Output is correct
13 Correct 30 ms 13044 KB Output is correct
14 Correct 34 ms 13356 KB Output is correct
15 Correct 30 ms 13396 KB Output is correct
16 Correct 31 ms 11044 KB Output is correct
17 Correct 27 ms 11084 KB Output is correct
18 Correct 29 ms 10968 KB Output is correct
19 Correct 26 ms 10968 KB Output is correct
20 Correct 32 ms 11612 KB Output is correct
21 Correct 27 ms 11380 KB Output is correct
22 Correct 30 ms 13436 KB Output is correct
23 Correct 25 ms 11128 KB Output is correct
24 Correct 25 ms 11116 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1280 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 18952 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 19152 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -