oj.uz

답안 #760637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760637 2023-06-18T04:34:48 Z Magikarp4000 길고양이 (JOI20_stray) C++17
89 / 100
 257 ms 524288 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int pat[] = {1,1,0,1,0,0};

const int MAXN = 2e4+1;
int n,m;
vector<PII> v[MAXN];
int p[MAXN], pr[MAXN];
vector<int> res;

namespace {
    void dfs(int s, int pa) {
        if (s != 0 && v[s].size() >= 3) {
            int c = res[pr[s]] == 1 ? 0 : 1;
            FORX(u,v[s]) {
                if (u.F == pa) continue;
                res[u.S] = c;
            }
            if (res[pr[s]] == -1) res[pr[s]] = 0;
        }
        FORX(u,v[s]) {
            if (u.F == pa) continue;
            pr[u.F] = s;
            pr[u.F] = u.S;
            dfs(u.F,s);
        }
    }

    void dfs1(int s, int pa, int idx) {
        FORX(u,v[s]) {
            if (u.F == pa) continue;
            int nc = idx;
            if ((s == 0 || v[s].size() == 2) && res[u.S] == -1) {
                res[u.S] = pat[idx];
                nc = (idx+1)%6;
            }
            if (v[s].size() >= 3) nc = 0;
            dfs1(u.F,s,nc);
        }
    }

    void dfs2(int s, int pa, int val) {
        FORX(u,v[s]) {
            if (u.F == pa) continue;
            res[u.S] = val;
            dfs2(u.F,s,(val+1)%3);
        }
    }
} // namespace

std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
    n = N; m = M;
    FOR(i,0,m) {
        v[U[i]].PB({V[i],i});
        v[V[i]].PB({U[i],i});
    }
    FOR(i,0,m) res.PB(-1);
    if (A == 2) {
        dfs(0,-1);
        dfs1(0,-1,0);
    }
    else {
        dfs2(0,-1,0);
    }
    return res;
}

#include "Catherine.h"
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

namespace {
    int A, B;
    bool flag = 0;
    PII start = {-1,-1}, turn = {0,0};
    bool done = 0;
    int pre = -1;

    int bruh(int x) {
        if (x != -1) pre = x;
        return x;
    }
} // namespace

void Init(int A, int B)
{
    ::A = A;
    ::B = B;
}

int sub7(std::vector<int> y) {
    int c0 = y[0], c1 = y[1];
    if (pre == 0) c0++;
    else if (pre == 1) c1++;
    if (c0+c1 == 1) {
        flag = 1;
        if (y[0]) return bruh(0);
        if (y[1]) return bruh(1);
        return bruh(-1);
    }
    if (c0+c1 >= 3) {
        flag = 1;
        if (c0 == 1) {
            if (y[0] == 1) return bruh(0);
            return bruh(-1);
        }
        else if (c1 == 1) {
            if (y[1] == 1) return bruh(1);
            return bruh(-1);
        }
    }
    if (flag) return y[0] == 1 ? bruh(0) : bruh(1);
    if (start == make_pair(-1,-1)) {
        start.F = (c0 == 2 || c1 == 2) ? 2 : 1;
        start.S = (c1 == 2) ? 1 : 0;
        turn.F++;
        pre = start.S;
        return bruh(start.S);
    }
    bool db = (c0 == 2 || c1 == 2) ? 1 : 0;
    int val = y[0] == 1 ? 0 : 1;
    if (start == make_pair(2,0)) {
        if (turn.F == 2) {
            flag = 1;
            return db ? bruh(-1) : bruh(val);
        }
        else {
            turn.F++;
            return bruh(val);
        }
    }
    else if (start == make_pair(2,1)) {
        if (turn.F == 2) {
            flag = 1;
            return db ? bruh(val) : bruh(-1);
        }
        else {
            turn.F++;
            return bruh(val);
        }
    }
    else {
        if (turn.F == 2) {
            flag = 1;
            return db ? bruh(val) : bruh(-1);
        }
        else if (turn.F == 1) {
            if (!done) {
                if (!db) {
                    turn.F++;
                    return bruh(val);
                }
                else {
                    done = 1;
                    turn.S++;
                    return bruh(-1);
                }
            }
            else {
                if (turn.S == 2) {
                    flag = 1;
                    return db ? bruh(-1) : bruh(val);
                }
                else {
                    turn.S++;
                    return bruh(val);
                }
            }
        }
    }
}

int sub3(std::vector<int> y) {
    int c[3] = {0,0,0};
    FOR(i,0,3) c[i] += y[i];
    if (pre != -1) c[pre]++;
    if (c[0] && c[1]) return bruh(0);
    if (c[1] && c[2]) return bruh(1);
    if (c[2] && c[0]) return bruh(2);
    FOR(i,0,3) if (c[i]) return bruh(i);
}

int Move(std::vector<int> y) {
    if (A == 2) return sub7(y);
    else return sub3(y);
}

Compilation message

Catherine.cpp: In function 'int sub7(std::vector<int>)':
Catherine.cpp:124:1: warning: control reaches end of non-void function [-Wreturn-type]
  124 | }
      | ^
Catherine.cpp: In function 'int sub3(std::vector<int>)':
Catherine.cpp:134:1: warning: control reaches end of non-void function [-Wreturn-type]
  134 | }
      | ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15980 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 23 ms 15104 KB Output is correct
4 Correct 36 ms 18236 KB Output is correct
5 Correct 39 ms 18212 KB Output is correct
6 Correct 27 ms 16000 KB Output is correct
7 Correct 26 ms 15912 KB Output is correct
8 Correct 32 ms 17240 KB Output is correct
9 Correct 32 ms 17300 KB Output is correct

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15980 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 23 ms 15104 KB Output is correct
4 Correct 36 ms 18236 KB Output is correct
5 Correct 39 ms 18212 KB Output is correct
6 Correct 27 ms 16000 KB Output is correct
7 Correct 26 ms 15912 KB Output is correct
8 Correct 32 ms 17240 KB Output is correct
9 Correct 32 ms 17300 KB Output is correct
10 Runtime error 257 ms 524288 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13720 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 22 ms 13044 KB Output is correct
4 Correct 35 ms 16004 KB Output is correct
5 Correct 37 ms 16048 KB Output is correct
6 Correct 26 ms 13752 KB Output is correct
7 Correct 26 ms 13804 KB Output is correct
8 Correct 28 ms 14944 KB Output is correct
9 Correct 30 ms 14968 KB Output is correct
10 Correct 37 ms 14656 KB Output is correct
11 Correct 28 ms 14564 KB Output is correct
12 Correct 32 ms 14720 KB Output is correct
13 Correct 35 ms 14656 KB Output is correct
14 Correct 31 ms 15012 KB Output is correct
15 Correct 31 ms 14908 KB Output is correct

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13720 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 22 ms 13044 KB Output is correct
4 Correct 35 ms 16004 KB Output is correct
5 Correct 37 ms 16048 KB Output is correct
6 Correct 26 ms 13752 KB Output is correct
7 Correct 26 ms 13804 KB Output is correct
8 Correct 28 ms 14944 KB Output is correct
9 Correct 30 ms 14968 KB Output is correct
10 Correct 37 ms 14656 KB Output is correct
11 Correct 28 ms 14564 KB Output is correct
12 Correct 32 ms 14720 KB Output is correct
13 Correct 35 ms 14656 KB Output is correct
14 Correct 31 ms 15012 KB Output is correct
15 Correct 31 ms 14908 KB Output is correct
16 Runtime error 235 ms 524288 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1284 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1292 KB Output is correct
4 Correct 2 ms 1284 KB Output is correct
5 Correct 2 ms 1284 KB Output is correct
6 Correct 2 ms 1284 KB Output is correct
7 Correct 2 ms 1284 KB Output is correct
8 Correct 2 ms 1284 KB Output is correct
9 Correct 2 ms 1284 KB Output is correct
10 Correct 2 ms 1296 KB Output is correct
11 Correct 2 ms 1296 KB Output is correct
12 Correct 1 ms 1292 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 1 ms 1284 KB Output is correct
15 Correct 2 ms 1292 KB Output is correct
16 Correct 1 ms 1284 KB Output is correct
17 Correct 2 ms 1292 KB Output is correct
18 Correct 2 ms 1288 KB Output is correct
19 Correct 2 ms 1284 KB Output is correct
20 Correct 2 ms 1292 KB Output is correct
21 Correct 1 ms 1284 KB Output is correct
22 Correct 2 ms 1292 KB Output is correct
23 Correct 2 ms 1292 KB Output is correct
24 Correct 2 ms 1292 KB Output is correct
25 Correct 2 ms 1284 KB Output is correct
26 Correct 2 ms 1224 KB Output is correct
27 Correct 1 ms 1292 KB Output is correct
28 Correct 2 ms 1292 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11124 KB Output is correct
2 Correct 33 ms 12416 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 20 ms 11116 KB Output is correct
5 Correct 35 ms 14008 KB Output is correct
6 Correct 32 ms 13928 KB Output is correct
7 Correct 30 ms 13136 KB Output is correct
8 Correct 27 ms 13152 KB Output is correct
9 Correct 31 ms 14028 KB Output is correct
10 Correct 31 ms 13840 KB Output is correct
11 Correct 30 ms 13944 KB Output is correct
12 Correct 31 ms 14044 KB Output is correct
13 Correct 33 ms 13992 KB Output is correct
14 Correct 30 ms 13956 KB Output is correct
15 Correct 34 ms 13960 KB Output is correct
16 Correct 35 ms 13888 KB Output is correct
17 Correct 28 ms 13676 KB Output is correct
18 Correct 30 ms 13672 KB Output is correct
19 Correct 28 ms 13624 KB Output is correct
20 Correct 28 ms 13812 KB Output is correct
21 Correct 30 ms 13684 KB Output is correct
22 Correct 28 ms 13672 KB Output is correct
23 Correct 27 ms 11276 KB Output is correct
24 Correct 27 ms 11264 KB Output is correct
25 Correct 26 ms 11700 KB Output is correct
26 Correct 26 ms 11660 KB Output is correct
27 Correct 33 ms 12512 KB Output is correct
28 Correct 27 ms 12572 KB Output is correct
29 Correct 27 ms 12520 KB Output is correct
30 Correct 27 ms 12528 KB Output is correct
31 Correct 23 ms 11284 KB Output is correct
32 Correct 33 ms 11124 KB Output is correct
33 Correct 26 ms 11740 KB Output is correct
34 Correct 24 ms 11700 KB Output is correct
35 Correct 27 ms 12516 KB Output is correct
36 Correct 28 ms 12528 KB Output is correct
37 Correct 36 ms 12448 KB Output is correct
38 Correct 28 ms 12436 KB Output is correct
39 Correct 27 ms 12424 KB Output is correct
40 Correct 27 ms 12480 KB Output is correct
41 Correct 28 ms 13048 KB Output is correct
42 Correct 28 ms 13036 KB Output is correct
43 Correct 28 ms 13088 KB Output is correct
44 Correct 28 ms 13120 KB Output is correct
45 Correct 28 ms 13104 KB Output is correct
46 Correct 28 ms 13060 KB Output is correct
47 Correct 27 ms 12196 KB Output is correct
48 Correct 27 ms 12200 KB Output is correct
49 Correct 27 ms 12104 KB Output is correct
50 Correct 27 ms 12352 KB Output is correct
51 Correct 27 ms 11244 KB Output is correct
52 Correct 25 ms 11244 KB Output is correct
53 Correct 25 ms 11172 KB Output is correct
54 Correct 25 ms 11192 KB Output is correct
55 Correct 25 ms 11308 KB Output is correct
56 Correct 25 ms 11180 KB Output is correct
57 Correct 25 ms 11376 KB Output is correct
58 Correct 25 ms 11212 KB Output is correct
59 Correct 27 ms 11396 KB Output is correct
60 Correct 27 ms 11380 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11068 KB Output is correct
2 Correct 26 ms 12276 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 20 ms 11116 KB Output is correct
5 Correct 33 ms 14056 KB Output is correct
6 Correct 34 ms 13952 KB Output is correct
7 Correct 26 ms 13028 KB Output is correct
8 Correct 30 ms 13132 KB Output is correct
9 Correct 32 ms 13908 KB Output is correct
10 Correct 31 ms 13932 KB Output is correct
11 Correct 31 ms 13876 KB Output is correct
12 Correct 31 ms 13928 KB Output is correct
13 Correct 31 ms 14028 KB Output is correct
14 Correct 30 ms 13948 KB Output is correct
15 Correct 30 ms 13952 KB Output is correct
16 Correct 34 ms 13932 KB Output is correct
17 Correct 28 ms 13780 KB Output is correct
18 Correct 28 ms 13676 KB Output is correct
19 Correct 31 ms 13676 KB Output is correct
20 Correct 30 ms 13744 KB Output is correct
21 Correct 28 ms 13640 KB Output is correct
22 Correct 36 ms 13516 KB Output is correct
23 Correct 25 ms 11140 KB Output is correct
24 Correct 24 ms 11288 KB Output is correct
25 Correct 25 ms 11624 KB Output is correct
26 Correct 25 ms 11700 KB Output is correct
27 Correct 36 ms 12608 KB Output is correct
28 Correct 27 ms 12452 KB Output is correct
29 Correct 27 ms 12624 KB Output is correct
30 Correct 30 ms 12520 KB Output is correct
31 Correct 28 ms 11212 KB Output is correct
32 Correct 25 ms 11232 KB Output is correct
33 Correct 25 ms 11744 KB Output is correct
34 Correct 26 ms 11740 KB Output is correct
35 Correct 27 ms 12544 KB Output is correct
36 Correct 27 ms 12524 KB Output is correct
37 Correct 27 ms 12468 KB Output is correct
38 Correct 27 ms 12468 KB Output is correct
39 Correct 27 ms 12500 KB Output is correct
40 Correct 28 ms 12464 KB Output is correct
41 Correct 28 ms 13048 KB Output is correct
42 Correct 28 ms 13108 KB Output is correct
43 Correct 28 ms 13040 KB Output is correct
44 Correct 30 ms 13052 KB Output is correct
45 Correct 30 ms 13052 KB Output is correct
46 Correct 31 ms 13172 KB Output is correct
47 Correct 27 ms 12284 KB Output is correct
48 Correct 27 ms 12272 KB Output is correct
49 Correct 27 ms 12136 KB Output is correct
50 Correct 27 ms 12256 KB Output is correct
51 Correct 26 ms 11168 KB Output is correct
52 Correct 25 ms 11248 KB Output is correct
53 Correct 25 ms 11092 KB Output is correct
54 Correct 25 ms 11248 KB Output is correct
55 Correct 27 ms 11320 KB Output is correct
56 Correct 25 ms 11156 KB Output is correct
57 Correct 26 ms 11188 KB Output is correct
58 Correct 27 ms 11392 KB Output is correct
59 Correct 26 ms 11360 KB Output is correct
60 Correct 26 ms 11280 KB Output is correct