oj.uz

답안 #778496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778496 2023-07-10T11:16:33 Z bachhoangxuan 길고양이 (JOI20_stray) C++17
15 / 100
 46 ms 16232 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(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

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 15064 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 23 ms 14576 KB Output is correct
4 Correct 33 ms 16216 KB Output is correct
5 Correct 32 ms 16232 KB Output is correct
6 Correct 26 ms 14820 KB Output is correct
7 Correct 27 ms 15068 KB Output is correct
8 Correct 31 ms 15760 KB Output is correct
9 Correct 32 ms 15552 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 15064 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 23 ms 14576 KB Output is correct
4 Correct 33 ms 16216 KB Output is correct
5 Correct 32 ms 16232 KB Output is correct
6 Correct 26 ms 14820 KB Output is correct
7 Correct 27 ms 15068 KB Output is correct
8 Correct 31 ms 15760 KB Output is correct
9 Correct 32 ms 15552 KB Output is correct
10 Correct 24 ms 13012 KB Output is correct
11 Correct 25 ms 13092 KB Output is correct
12 Correct 27 ms 13172 KB Output is correct
13 Correct 28 ms 13084 KB Output is correct
14 Correct 25 ms 13152 KB Output is correct
15 Correct 27 ms 13512 KB Output is correct
16 Correct 33 ms 16152 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 12848 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 23 ms 12668 KB Output is correct
4 Correct 32 ms 14352 KB Output is correct
5 Correct 32 ms 14372 KB Output is correct
6 Correct 25 ms 13056 KB Output is correct
7 Correct 27 ms 12988 KB Output is correct
8 Correct 30 ms 13652 KB Output is correct
9 Correct 32 ms 13648 KB Output is correct
10 Correct 27 ms 13492 KB Output is correct
11 Correct 26 ms 13116 KB Output is correct
12 Correct 27 ms 13336 KB Output is correct
13 Correct 28 ms 13212 KB Output is correct
14 Correct 46 ms 13684 KB Output is correct
15 Correct 30 ms 13724 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 12848 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 23 ms 12668 KB Output is correct
4 Correct 32 ms 14352 KB Output is correct
5 Correct 32 ms 14372 KB Output is correct
6 Correct 25 ms 13056 KB Output is correct
7 Correct 27 ms 12988 KB Output is correct
8 Correct 30 ms 13652 KB Output is correct
9 Correct 32 ms 13648 KB Output is correct
10 Correct 27 ms 13492 KB Output is correct
11 Correct 26 ms 13116 KB Output is correct
12 Correct 27 ms 13336 KB Output is correct
13 Correct 28 ms 13212 KB Output is correct
14 Correct 46 ms 13684 KB Output is correct
15 Correct 30 ms 13724 KB Output is correct
16 Correct 23 ms 11500 KB Output is correct
17 Correct 23 ms 11308 KB Output is correct
18 Correct 24 ms 11348 KB Output is correct
19 Correct 24 ms 11132 KB Output is correct
20 Correct 26 ms 12028 KB Output is correct
21 Correct 25 ms 11400 KB Output is correct
22 Correct 27 ms 13772 KB Output is correct
23 Correct 24 ms 11536 KB Output is correct
24 Correct 24 ms 11480 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 904 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 10744 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 11056 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -