oj.uz

답안 #996568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996568 2024-06-10T19:50:53 Z TimDee 길고양이 (JOI20_stray) C++17
5 / 100
 36 ms 17788 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 

const int N=2e4+5;
vector<pi> adj[N];
int z[N];
int c[N];
int ed[N];

vector<int> ptrn={0,1,1,0,0,0,1,0,0,1,1,1};

void dfs(int u, int p) {
    for(auto&e:adj[u]) {
        int v=e.f, i=e.s;
        if (v==p) continue;
        if (adj[v].size()==2) {
            z[v]=z[u]+1;
            c[v]=ptrn[z[u]%12];
            ed[i]=ptrn[z[u]%12];
        } else {
            z[v]=c[u]*6;
            c[v]=c[u]^1;
            ed[i]=c[u]^1;
        }
        dfs(v,u);
    }
}

vector<int> Mark(int n, int m, int A, int B, vector<int> u, vector<int> v) {

    if (m > n-1) exit(0);
    forn(i,m) adj[u[i]].pb({v[i],i}), adj[v[i]].pb({u[i],i});
    dfs(0,-1);
    vector<int> ans(m);
    forn(i,m) ans[i]=ed[i];
    return ans;

}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0; i<(n); ++i)
#define pb push_back
#define pi pair<int,int>
#define f first
#define s second 

int fmove=1;
int rdir=0;
int last=-1;
void Init(int A, int B) {
    
}

vector<int> ok;
vector<int> ptn={0,1,1,0,0,0,1,0,0,1,1,1};

int Move(vector<int> a) {
    
    if (fmove) {
        fmove=0;
        if (a[0]+a[1] == 1) {
            rdir=1;
            if (a[0]) return last=0;
            if (a[1]) return last=1;
            assert(0);
        }
        if (a[0]+a[1]>2) {
            rdir=1;
            if (a[0]==1) return last=0;
            if (a[1]==1) return last=1;
            assert(0);
        }
        for(int i=1; i>=0; --i) forn(j,a[i]) ok.pb(i);
        forn(i,2) if (a[i]) return last=i;
        assert(0);
    }

    if (rdir) {
        if (!(a[0]+a[1])) return -1;
        assert(a[0]+a[1]);
        //cout<<"??? "<<a[0]<<' '<<a[1]<<'\n';
        if (a[0]+a[1]==1) forn(i,2) if (a[i]) return last=i;
        assert(a[last^1]);
        return last^=1;
    }
    
    if (a[0]+a[1]==0) {
        rdir = 1;
        return -1;
    }
    if (a[0]+a[1] > 1) {
        if (a[0] && a[1]) {
            rdir=1;
            return last^=1;
        }
        rdir=1;
        return last;
    }

    if (a[0]) {
        ok.pb(0);
    } else {
        ok.pb(1);
    }

    if (ok.size()==6) {
        int kk=0;
        forn(i,6) {
            int z=1;
            forn(j,6) z&=ok[j]==ptn[i+j];
            kk|=z;
        }
        if (kk) {
            rdir=1;
            return -1;
        }
        rdir=1;
        return last=ok.back();
    }
    return last=ok.back();

}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 16416 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 24 ms 15224 KB Output is correct
4 Correct 30 ms 17592 KB Output is correct
5 Correct 32 ms 17788 KB Output is correct
6 Correct 26 ms 15736 KB Output is correct
7 Correct 25 ms 15840 KB Output is correct
8 Incorrect 28 ms 17020 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 16416 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 24 ms 15224 KB Output is correct
4 Correct 30 ms 17592 KB Output is correct
5 Correct 32 ms 17788 KB Output is correct
6 Correct 26 ms 15736 KB Output is correct
7 Correct 25 ms 15840 KB Output is correct
8 Incorrect 28 ms 17020 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 13764 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 24 ms 12820 KB Output is correct
4 Correct 34 ms 15552 KB Output is correct
5 Correct 33 ms 15440 KB Output is correct
6 Correct 24 ms 13680 KB Output is correct
7 Correct 24 ms 13700 KB Output is correct
8 Incorrect 30 ms 14708 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 13764 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 24 ms 12820 KB Output is correct
4 Correct 34 ms 15552 KB Output is correct
5 Correct 33 ms 15440 KB Output is correct
6 Correct 24 ms 13680 KB Output is correct
7 Correct 24 ms 13700 KB Output is correct
8 Incorrect 30 ms 14708 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1564 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 1 ms 1568 KB Output is correct
4 Correct 2 ms 1568 KB Output is correct
5 Correct 2 ms 1568 KB Output is correct
6 Correct 1 ms 1568 KB Output is correct
7 Correct 2 ms 1568 KB Output is correct
8 Correct 1 ms 1556 KB Output is correct
9 Correct 2 ms 1564 KB Output is correct
10 Correct 1 ms 1568 KB Output is correct
11 Correct 1 ms 1572 KB Output is correct
12 Correct 2 ms 1568 KB Output is correct
13 Correct 2 ms 1568 KB Output is correct
14 Correct 2 ms 1652 KB Output is correct
15 Correct 1 ms 1572 KB Output is correct
16 Correct 1 ms 1568 KB Output is correct
17 Correct 1 ms 1560 KB Output is correct
18 Correct 2 ms 1560 KB Output is correct
19 Correct 2 ms 1568 KB Output is correct
20 Correct 1 ms 1564 KB Output is correct
21 Correct 1 ms 1560 KB Output is correct
22 Correct 1 ms 1568 KB Output is correct
23 Correct 1 ms 1568 KB Output is correct
24 Correct 2 ms 1556 KB Output is correct
25 Correct 0 ms 1568 KB Output is correct
26 Correct 1 ms 1604 KB Output is correct
27 Correct 1 ms 1560 KB Output is correct
28 Correct 0 ms 1556 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 11656 KB Output is correct
2 Incorrect 22 ms 12260 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 11644 KB Output is correct
2 Correct 27 ms 12848 KB Output is correct
3 Correct 0 ms 1308 KB Output is correct
4 Correct 19 ms 11400 KB Output is correct
5 Correct 28 ms 14024 KB Output is correct
6 Correct 27 ms 13924 KB Output is correct
7 Correct 23 ms 13172 KB Output is correct
8 Correct 22 ms 13180 KB Output is correct
9 Correct 27 ms 13944 KB Output is correct
10 Correct 33 ms 13932 KB Output is correct
11 Correct 33 ms 13944 KB Output is correct
12 Correct 36 ms 13744 KB Output is correct
13 Correct 27 ms 13864 KB Output is correct
14 Correct 27 ms 13944 KB Output is correct
15 Incorrect 31 ms 13900 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -