oj.uz

답안 #760633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760633 2023-06-18T04:32:09 Z Magikarp4000 길고양이 (JOI20_stray) C++17
85 / 100
 44 ms 16096 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];
    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(0);
}

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:133:1: warning: control reaches end of non-void function [-Wreturn-type]
  133 | }
      | ^

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 14060 KB Wrong Answer [5]
2 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 1284 KB Output is correct
4 Correct 2 ms 1284 KB Output is correct
5 Correct 2 ms 1396 KB Output is correct
6 Correct 2 ms 1296 KB Output is correct
7 Correct 2 ms 1288 KB Output is correct
8 Correct 2 ms 1284 KB Output is correct
9 Correct 3 ms 1204 KB Output is correct
10 Correct 2 ms 1292 KB Output is correct
11 Correct 1 ms 1284 KB Output is correct
12 Correct 2 ms 1284 KB Output is correct
13 Correct 2 ms 1292 KB Output is correct
14 Correct 1 ms 1292 KB Output is correct
15 Correct 1 ms 1280 KB Output is correct
16 Correct 2 ms 1284 KB Output is correct
17 Correct 1 ms 1284 KB Output is correct
18 Correct 2 ms 1284 KB Output is correct
19 Correct 1 ms 1288 KB Output is correct
20 Correct 2 ms 1284 KB Output is correct
21 Correct 1 ms 1284 KB Output is correct
22 Correct 1 ms 1284 KB Output is correct
23 Correct 2 ms 1284 KB Output is correct
24 Correct 2 ms 1292 KB Output is correct
25 Correct 2 ms 1352 KB Output is correct
26 Correct 2 ms 1380 KB Output is correct
27 Correct 2 ms 1280 KB Output is correct
28 Correct 2 ms 1284 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11124 KB Output is correct
2 Correct 36 ms 12456 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 20 ms 11188 KB Output is correct
5 Correct 32 ms 13912 KB Output is correct
6 Correct 31 ms 13860 KB Output is correct
7 Correct 25 ms 13024 KB Output is correct
8 Correct 28 ms 13084 KB Output is correct
9 Correct 38 ms 13872 KB Output is correct
10 Correct 31 ms 13844 KB Output is correct
11 Correct 44 ms 14068 KB Output is correct
12 Correct 31 ms 13956 KB Output is correct
13 Correct 38 ms 13968 KB Output is correct
14 Correct 35 ms 13944 KB Output is correct
15 Correct 33 ms 14076 KB Output is correct
16 Correct 31 ms 14008 KB Output is correct
17 Correct 27 ms 13800 KB Output is correct
18 Correct 30 ms 13584 KB Output is correct
19 Correct 30 ms 13804 KB Output is correct
20 Correct 30 ms 13672 KB Output is correct
21 Correct 30 ms 13684 KB Output is correct
22 Correct 30 ms 13800 KB Output is correct
23 Correct 24 ms 11240 KB Output is correct
24 Correct 25 ms 11220 KB Output is correct
25 Correct 25 ms 11752 KB Output is correct
26 Correct 30 ms 11544 KB Output is correct
27 Correct 34 ms 12476 KB Output is correct
28 Correct 28 ms 12580 KB Output is correct
29 Correct 30 ms 12548 KB Output is correct
30 Correct 28 ms 12508 KB Output is correct
31 Correct 27 ms 11320 KB Output is correct
32 Correct 25 ms 11212 KB Output is correct
33 Correct 26 ms 11724 KB Output is correct
34 Correct 26 ms 11808 KB Output is correct
35 Correct 27 ms 12424 KB Output is correct
36 Correct 29 ms 12416 KB Output is correct
37 Correct 27 ms 12520 KB Output is correct
38 Correct 28 ms 12444 KB Output is correct
39 Correct 27 ms 12408 KB Output is correct
40 Correct 27 ms 12452 KB Output is correct
41 Correct 28 ms 13048 KB Output is correct
42 Correct 28 ms 12928 KB Output is correct
43 Correct 37 ms 12984 KB Output is correct
44 Correct 44 ms 13056 KB Output is correct
45 Correct 40 ms 13084 KB Output is correct
46 Correct 30 ms 13040 KB Output is correct
47 Correct 27 ms 12288 KB Output is correct
48 Correct 27 ms 12244 KB Output is correct
49 Correct 27 ms 12112 KB Output is correct
50 Correct 28 ms 12244 KB Output is correct
51 Correct 25 ms 11256 KB Output is correct
52 Correct 31 ms 11236 KB Output is correct
53 Correct 25 ms 11324 KB Output is correct
54 Correct 25 ms 11312 KB Output is correct
55 Correct 25 ms 11200 KB Output is correct
56 Correct 25 ms 11204 KB Output is correct
57 Correct 25 ms 11312 KB Output is correct
58 Correct 27 ms 11300 KB Output is correct
59 Correct 25 ms 11180 KB Output is correct
60 Correct 26 ms 11356 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11108 KB Output is correct
2 Correct 29 ms 12276 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 24 ms 11116 KB Output is correct
5 Correct 31 ms 14100 KB Output is correct
6 Correct 31 ms 13964 KB Output is correct
7 Correct 30 ms 13104 KB Output is correct
8 Correct 26 ms 13112 KB Output is correct
9 Correct 31 ms 13968 KB Output is correct
10 Correct 32 ms 14000 KB Output is correct
11 Correct 31 ms 13956 KB Output is correct
12 Correct 35 ms 13832 KB Output is correct
13 Correct 31 ms 14024 KB Output is correct
14 Correct 30 ms 13940 KB Output is correct
15 Correct 31 ms 13952 KB Output is correct
16 Correct 31 ms 14068 KB Output is correct
17 Correct 30 ms 13680 KB Output is correct
18 Correct 35 ms 13760 KB Output is correct
19 Correct 30 ms 13668 KB Output is correct
20 Correct 32 ms 13776 KB Output is correct
21 Correct 30 ms 13796 KB Output is correct
22 Correct 28 ms 13672 KB Output is correct
23 Correct 25 ms 11240 KB Output is correct
24 Correct 24 ms 11228 KB Output is correct
25 Correct 25 ms 11812 KB Output is correct
26 Correct 25 ms 11752 KB Output is correct
27 Correct 28 ms 12508 KB Output is correct
28 Correct 27 ms 12528 KB Output is correct
29 Correct 35 ms 12496 KB Output is correct
30 Correct 28 ms 12520 KB Output is correct
31 Correct 25 ms 11164 KB Output is correct
32 Correct 25 ms 11176 KB Output is correct
33 Correct 26 ms 11736 KB Output is correct
34 Correct 25 ms 11704 KB Output is correct
35 Correct 27 ms 12460 KB Output is correct
36 Correct 27 ms 12352 KB Output is correct
37 Correct 36 ms 12556 KB Output is correct
38 Correct 27 ms 12332 KB Output is correct
39 Correct 33 ms 12240 KB Output is correct
40 Correct 28 ms 12452 KB Output is correct
41 Correct 28 ms 13136 KB Output is correct
42 Correct 28 ms 13120 KB Output is correct
43 Correct 28 ms 13044 KB Output is correct
44 Correct 30 ms 13116 KB Output is correct
45 Correct 28 ms 13060 KB Output is correct
46 Correct 31 ms 13032 KB Output is correct
47 Correct 27 ms 12276 KB Output is correct
48 Correct 30 ms 12276 KB Output is correct
49 Correct 34 ms 12052 KB Output is correct
50 Correct 27 ms 12280 KB Output is correct
51 Correct 25 ms 11224 KB Output is correct
52 Correct 25 ms 11208 KB Output is correct
53 Correct 27 ms 11280 KB Output is correct
54 Correct 28 ms 11216 KB Output is correct
55 Correct 27 ms 11176 KB Output is correct
56 Correct 27 ms 11152 KB Output is correct
57 Correct 25 ms 11304 KB Output is correct
58 Correct 25 ms 11332 KB Output is correct
59 Correct 25 ms 11348 KB Output is correct
60 Correct 28 ms 11300 KB Output is correct