oj.uz

Submission #778457

# Submission time Handle Problem Language Result Execution time Memory
778457 2023-07-10T10:42:24 Z bachhoangxuan Stray Cat (JOI20_stray) C++17
15 / 100
 42 ms 16532 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[u].size()+(u==0)==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;
    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){return p=(val==-1?p:val),val;};
    if(B){
        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(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(p=!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 28 ms 15088 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 23 ms 14988 KB Output is correct
4 Correct 38 ms 16468 KB Output is correct
5 Correct 42 ms 16532 KB Output is correct
6 Correct 30 ms 15212 KB Output is correct
7 Correct 30 ms 15376 KB Output is correct
8 Correct 41 ms 15932 KB Output is correct
9 Correct 36 ms 15920 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 15088 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 23 ms 14988 KB Output is correct
4 Correct 38 ms 16468 KB Output is correct
5 Correct 42 ms 16532 KB Output is correct
6 Correct 30 ms 15212 KB Output is correct
7 Correct 30 ms 15376 KB Output is correct
8 Correct 41 ms 15932 KB Output is correct
9 Correct 36 ms 15920 KB Output is correct
10 Correct 25 ms 13352 KB Output is correct
11 Correct 25 ms 13336 KB Output is correct
12 Correct 31 ms 13368 KB Output is correct
13 Correct 25 ms 13360 KB Output is correct
14 Correct 27 ms 13612 KB Output is correct
15 Correct 34 ms 14000 KB Output is correct
16 Correct 31 ms 16064 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12696 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 23 ms 12328 KB Output is correct
4 Correct 38 ms 13836 KB Output is correct
5 Correct 33 ms 13924 KB Output is correct
6 Correct 26 ms 12796 KB Output is correct
7 Correct 26 ms 12668 KB Output is correct
8 Correct 40 ms 13220 KB Output is correct
9 Correct 36 ms 13288 KB Output is correct
10 Correct 40 ms 13036 KB Output is correct
11 Correct 33 ms 13076 KB Output is correct
12 Correct 28 ms 13072 KB Output is correct
13 Correct 33 ms 12948 KB Output is correct
14 Correct 30 ms 13396 KB Output is correct
15 Correct 32 ms 13316 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12696 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 23 ms 12328 KB Output is correct
4 Correct 38 ms 13836 KB Output is correct
5 Correct 33 ms 13924 KB Output is correct
6 Correct 26 ms 12796 KB Output is correct
7 Correct 26 ms 12668 KB Output is correct
8 Correct 40 ms 13220 KB Output is correct
9 Correct 36 ms 13288 KB Output is correct
10 Correct 40 ms 13036 KB Output is correct
11 Correct 33 ms 13076 KB Output is correct
12 Correct 28 ms 13072 KB Output is correct
13 Correct 33 ms 12948 KB Output is correct
14 Correct 30 ms 13396 KB Output is correct
15 Correct 32 ms 13316 KB Output is correct
16 Correct 23 ms 11116 KB Output is correct
17 Correct 26 ms 11128 KB Output is correct
18 Correct 32 ms 10900 KB Output is correct
19 Correct 26 ms 10996 KB Output is correct
20 Correct 26 ms 11620 KB Output is correct
21 Correct 27 ms 11464 KB Output is correct
22 Correct 33 ms 13664 KB Output is correct
23 Correct 27 ms 11588 KB Output is correct
24 Correct 30 ms 11576 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 868 KB Output is correct
2 Incorrect 1 ms 512 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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