oj.uz

답안 #760626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760626 2023-06-18T04:14:49 Z Magikarp4000 길고양이 (JOI20_stray) C++17
85 / 100
 39 ms 16560 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);
        }
    }
} // 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);
    dfs(0,-1);
    dfs1(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;
    int variable_example = 0;
    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 Move(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);
                }
            }
        }
    }
    return 69;
}

Compilation message

Catherine.cpp:27:9: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   27 |     int variable_example = 0;
      |         ^~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 14096 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 22 ms 13044 KB Output is correct
4 Correct 33 ms 16004 KB Output is correct
5 Incorrect 30 ms 15852 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 14096 KB Output is correct
2 Correct 1 ms 1036 KB Output is correct
3 Correct 22 ms 13044 KB Output is correct
4 Correct 33 ms 16004 KB Output is correct
5 Incorrect 30 ms 15852 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11584 KB Output is correct
2 Correct 27 ms 12884 KB Output is correct
3 Correct 1 ms 1028 KB Output is correct
4 Correct 20 ms 11424 KB Output is correct
5 Correct 30 ms 14328 KB Output is correct
6 Correct 31 ms 14384 KB Output is correct
7 Correct 28 ms 13484 KB Output is correct
8 Correct 26 ms 13424 KB Output is correct
9 Correct 34 ms 14400 KB Output is correct
10 Correct 30 ms 14460 KB Output is correct
11 Correct 31 ms 14416 KB Output is correct
12 Correct 35 ms 14280 KB Output is correct
13 Correct 30 ms 14400 KB Output is correct
14 Correct 30 ms 14420 KB Output is correct
15 Correct 30 ms 14384 KB Output is correct
16 Correct 32 ms 14384 KB Output is correct
17 Correct 28 ms 14148 KB Output is correct
18 Correct 27 ms 14116 KB Output is correct
19 Correct 27 ms 14132 KB Output is correct
20 Correct 30 ms 14192 KB Output is correct
21 Correct 33 ms 14216 KB Output is correct
22 Correct 27 ms 14148 KB Output is correct
23 Correct 27 ms 11712 KB Output is correct
24 Correct 26 ms 11756 KB Output is correct
25 Correct 26 ms 12112 KB Output is correct
26 Correct 25 ms 12088 KB Output is correct
27 Correct 27 ms 12928 KB Output is correct
28 Correct 28 ms 12992 KB Output is correct
29 Correct 35 ms 12968 KB Output is correct
30 Correct 27 ms 13012 KB Output is correct
31 Correct 25 ms 11716 KB Output is correct
32 Correct 25 ms 11716 KB Output is correct
33 Correct 25 ms 12092 KB Output is correct
34 Correct 25 ms 11992 KB Output is correct
35 Correct 27 ms 12864 KB Output is correct
36 Correct 27 ms 12760 KB Output is correct
37 Correct 27 ms 12772 KB Output is correct
38 Correct 27 ms 12904 KB Output is correct
39 Correct 30 ms 12808 KB Output is correct
40 Correct 27 ms 12852 KB Output is correct
41 Correct 27 ms 13532 KB Output is correct
42 Correct 30 ms 13512 KB Output is correct
43 Correct 30 ms 13524 KB Output is correct
44 Correct 27 ms 13436 KB Output is correct
45 Correct 30 ms 13492 KB Output is correct
46 Correct 27 ms 13512 KB Output is correct
47 Correct 27 ms 12656 KB Output is correct
48 Correct 27 ms 12744 KB Output is correct
49 Correct 26 ms 12620 KB Output is correct
50 Correct 27 ms 12784 KB Output is correct
51 Correct 25 ms 11636 KB Output is correct
52 Correct 24 ms 11620 KB Output is correct
53 Correct 25 ms 11596 KB Output is correct
54 Correct 28 ms 11660 KB Output is correct
55 Correct 30 ms 11696 KB Output is correct
56 Correct 25 ms 11616 KB Output is correct
57 Correct 26 ms 11708 KB Output is correct
58 Correct 25 ms 11728 KB Output is correct
59 Correct 25 ms 11832 KB Output is correct
60 Correct 27 ms 11848 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11616 KB Output is correct
2 Correct 26 ms 12696 KB Output is correct
3 Correct 1 ms 1036 KB Output is correct
4 Correct 22 ms 11516 KB Output is correct
5 Correct 31 ms 14384 KB Output is correct
6 Correct 31 ms 14380 KB Output is correct
7 Correct 31 ms 13616 KB Output is correct
8 Correct 28 ms 13552 KB Output is correct
9 Correct 32 ms 14364 KB Output is correct
10 Correct 30 ms 14348 KB Output is correct
11 Correct 36 ms 14452 KB Output is correct
12 Correct 39 ms 14420 KB Output is correct
13 Correct 30 ms 14364 KB Output is correct
14 Correct 30 ms 14500 KB Output is correct
15 Correct 30 ms 14380 KB Output is correct
16 Correct 30 ms 14464 KB Output is correct
17 Correct 27 ms 14132 KB Output is correct
18 Correct 27 ms 14084 KB Output is correct
19 Correct 28 ms 14028 KB Output is correct
20 Correct 27 ms 14196 KB Output is correct
21 Correct 28 ms 14044 KB Output is correct
22 Correct 27 ms 14092 KB Output is correct
23 Correct 23 ms 11692 KB Output is correct
24 Correct 24 ms 11704 KB Output is correct
25 Correct 25 ms 12084 KB Output is correct
26 Correct 24 ms 12152 KB Output is correct
27 Correct 31 ms 12856 KB Output is correct
28 Correct 27 ms 12912 KB Output is correct
29 Correct 27 ms 12996 KB Output is correct
30 Correct 27 ms 12984 KB Output is correct
31 Correct 24 ms 11784 KB Output is correct
32 Correct 24 ms 11696 KB Output is correct
33 Correct 25 ms 12100 KB Output is correct
34 Correct 24 ms 12132 KB Output is correct
35 Correct 27 ms 12864 KB Output is correct
36 Correct 27 ms 12800 KB Output is correct
37 Correct 30 ms 12908 KB Output is correct
38 Correct 27 ms 12800 KB Output is correct
39 Correct 27 ms 12760 KB Output is correct
40 Correct 27 ms 12880 KB Output is correct
41 Correct 28 ms 13532 KB Output is correct
42 Correct 28 ms 13520 KB Output is correct
43 Correct 27 ms 13612 KB Output is correct
44 Correct 28 ms 13452 KB Output is correct
45 Correct 35 ms 13524 KB Output is correct
46 Correct 27 ms 13584 KB Output is correct
47 Correct 27 ms 12636 KB Output is correct
48 Correct 27 ms 12744 KB Output is correct
49 Correct 27 ms 12572 KB Output is correct
50 Correct 26 ms 12752 KB Output is correct
51 Correct 24 ms 11540 KB Output is correct
52 Correct 24 ms 11564 KB Output is correct
53 Correct 25 ms 11736 KB Output is correct
54 Correct 25 ms 11780 KB Output is correct
55 Correct 25 ms 11536 KB Output is correct
56 Correct 24 ms 11596 KB Output is correct
57 Correct 27 ms 11688 KB Output is correct
58 Correct 25 ms 11504 KB Output is correct
59 Correct 25 ms 11880 KB Output is correct
60 Correct 25 ms 11904 KB Output is correct