답안 #778455

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778455 2023-07-10T10:41:09 Z bachhoangxuan 길고양이 (JOI20_stray) C++17
11 / 100
35 ms 14536 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(A==3) 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(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;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 14536 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 14536 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13032 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 23 ms 12672 KB Output is correct
4 Correct 32 ms 14340 KB Output is correct
5 Correct 33 ms 14468 KB Output is correct
6 Correct 26 ms 13092 KB Output is correct
7 Correct 26 ms 13124 KB Output is correct
8 Correct 30 ms 13680 KB Output is correct
9 Correct 35 ms 13816 KB Output is correct
10 Correct 33 ms 13452 KB Output is correct
11 Correct 28 ms 13456 KB Output is correct
12 Correct 28 ms 13440 KB Output is correct
13 Correct 27 ms 13492 KB Output is correct
14 Correct 30 ms 13788 KB Output is correct
15 Correct 30 ms 13888 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13032 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 23 ms 12672 KB Output is correct
4 Correct 32 ms 14340 KB Output is correct
5 Correct 33 ms 14468 KB Output is correct
6 Correct 26 ms 13092 KB Output is correct
7 Correct 26 ms 13124 KB Output is correct
8 Correct 30 ms 13680 KB Output is correct
9 Correct 35 ms 13816 KB Output is correct
10 Correct 33 ms 13452 KB Output is correct
11 Correct 28 ms 13456 KB Output is correct
12 Correct 28 ms 13440 KB Output is correct
13 Correct 27 ms 13492 KB Output is correct
14 Correct 30 ms 13788 KB Output is correct
15 Correct 30 ms 13888 KB Output is correct
16 Correct 28 ms 11532 KB Output is correct
17 Correct 28 ms 11516 KB Output is correct
18 Correct 24 ms 11432 KB Output is correct
19 Correct 24 ms 11368 KB Output is correct
20 Correct 27 ms 12028 KB Output is correct
21 Correct 33 ms 11812 KB Output is correct
22 Correct 34 ms 13860 KB Output is correct
23 Correct 24 ms 11572 KB Output is correct
24 Correct 26 ms 11544 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 900 KB Output is correct
2 Incorrect 1 ms 512 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 11112 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 10956 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -