oj.uz

Submission #778501

# Submission time Handle Problem Language Result Execution time Memory
778501 2023-07-10T11:21:38 Z bachhoangxuan Stray Cat (JOI20_stray) C++17
15 / 100
 37 ms 16264 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;
    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(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(y[1]);
    }
    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 14996 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 24 ms 14552 KB Output is correct
4 Correct 34 ms 16264 KB Output is correct
5 Correct 35 ms 16132 KB Output is correct
6 Correct 27 ms 14832 KB Output is correct
7 Correct 30 ms 15004 KB Output is correct
8 Correct 34 ms 15836 KB Output is correct
9 Correct 32 ms 15612 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 14996 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 24 ms 14552 KB Output is correct
4 Correct 34 ms 16264 KB Output is correct
5 Correct 35 ms 16132 KB Output is correct
6 Correct 27 ms 14832 KB Output is correct
7 Correct 30 ms 15004 KB Output is correct
8 Correct 34 ms 15836 KB Output is correct
9 Correct 32 ms 15612 KB Output is correct
10 Correct 26 ms 13028 KB Output is correct
11 Correct 29 ms 13088 KB Output is correct
12 Correct 27 ms 13104 KB Output is correct
13 Correct 28 ms 13212 KB Output is correct
14 Correct 27 ms 13264 KB Output is correct
15 Correct 30 ms 13632 KB Output is correct
16 Correct 31 ms 15916 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 12868 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 23 ms 12648 KB Output is correct
4 Correct 33 ms 14268 KB Output is correct
5 Correct 32 ms 14184 KB Output is correct
6 Correct 27 ms 13040 KB Output is correct
7 Correct 27 ms 12952 KB Output is correct
8 Correct 37 ms 13420 KB Output is correct
9 Correct 36 ms 13472 KB Output is correct
10 Correct 30 ms 13260 KB Output is correct
11 Correct 28 ms 13148 KB Output is correct
12 Correct 28 ms 13260 KB Output is correct
13 Correct 28 ms 13284 KB Output is correct
14 Correct 30 ms 13660 KB Output is correct
15 Correct 31 ms 13656 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 12868 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 23 ms 12648 KB Output is correct
4 Correct 33 ms 14268 KB Output is correct
5 Correct 32 ms 14184 KB Output is correct
6 Correct 27 ms 13040 KB Output is correct
7 Correct 27 ms 12952 KB Output is correct
8 Correct 37 ms 13420 KB Output is correct
9 Correct 36 ms 13472 KB Output is correct
10 Correct 30 ms 13260 KB Output is correct
11 Correct 28 ms 13148 KB Output is correct
12 Correct 28 ms 13260 KB Output is correct
13 Correct 28 ms 13284 KB Output is correct
14 Correct 30 ms 13660 KB Output is correct
15 Correct 31 ms 13656 KB Output is correct
16 Correct 23 ms 11352 KB Output is correct
17 Correct 24 ms 11360 KB Output is correct
18 Correct 25 ms 11308 KB Output is correct
19 Correct 25 ms 11288 KB Output is correct
20 Correct 26 ms 11884 KB Output is correct
21 Correct 26 ms 11452 KB Output is correct
22 Correct 28 ms 13592 KB Output is correct
23 Correct 26 ms 11384 KB Output is correct
24 Correct 26 ms 11332 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 10716 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 10928 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -