oj.uz

답안 #962910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962910 2024-04-14T09:38:35 Z GrindMachine 길고양이 (JOI20_stray) C++17
87 / 100
 50 ms 19684 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

/*

refs:
edi
https://codeforces.com/blog/entry/74871?#comment-591498

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

#include "Anthony.h"

namespace anthony {
    set<string> st1,st2;
    string chain = "";

    void precalc(){
        int n = 6;
        rep(mask,1<<n){
            string s(2*n,'?');
            rep(i,n){
                ll b = 0;
                if(mask&(1<<i)){
                    b = 1;
                }
                s[i] = s[i+n] = char('0'+b);
            }

            st1.clear(), st2.clear();
            rep(i,n){
                string t = string(s.begin()+i,s.begin()+i+5);
                st1.insert(t);
                reverse(all(t));
                st2.insert(t);
            }

            bool ok = true;
            trav(t,st1){
                if(st2.count(t)){
                    ok = false;
                }
            }

            if(ok){
                chain = string(s.begin(),s.begin()+n);
                return;
            }
        }
    }

    vector<pii> adj[N];
    vector<int> val;

    void dfs1(int u, int p, int prev_typ, int ptr){
        for(auto [v,id] : adj[u]){
            if(v == p) conts;
            if(sz(adj[v]) == 2){
                int nxt_ptr = 0;
                if(ptr != -1){
                    nxt_ptr = (ptr+1)%6;
                }
                else{
                    if(prev_typ == 0){
                        nxt_ptr = 0;
                    }
                    else{
                        nxt_ptr = 2;
                    }
                }

                val[id] = chain[nxt_ptr]-'0';
                dfs1(v,u,-1,nxt_ptr);
            }
            else{
                int nxt_typ = 0;
                if(prev_typ != -1){
                    nxt_typ = prev_typ^1;
                }
                else{
                    nxt_typ = (chain[ptr]-'0')^1;
                }

                val[id] = nxt_typ;
                dfs1(v,u,nxt_typ,-1);
            }
        }
    }

    void bfs(){
        queue<int> q;
        vector<int> dis(N);
        vector<bool> vis(N);
        q.push(0);
        vis[0] = 1;

        while(!q.empty()){
            int u = q.front();
            q.pop();

            for(auto [v,id] : adj[u]){
                if(vis[v]) conts;
                q.push(v);
                dis[v] = dis[u]+1;
                vis[v] = 1;
            }
        }

        rep(u,N){
            for(auto [v,id] : adj[u]){
                if(dis[u] > dis[v]) conts;
                val[id] = dis[v]%3;
            }   
        }
    }

}  // namespace

using namespace anthony;

std::vector<int> Mark(int n, int m, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
    // std::vector<int> X(M);
    // for (int i = 0; i < M; ++i) {
    //     X[i] = FunctionExample(i, A);
    // }
    // return X;

    precalc();
    rep(i,m){
        int u = U[i], v = V[i];
        adj[u].pb({v,i}), adj[v].pb({u,i});
    }

    val = vector<int>(m);

    if(A == 3){
        bfs();
    }
    else{
        dfs1(0,-1,1,-1);
    }

    return val;    
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

// #ifdef LOCAL
// #include "debug.h"
// #else
// #define debug(x) 42
// #endif

/*

refs:
edi
https://codeforces.com/blog/entry/74871?#comment-591498

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Catherine.h"

namespace catherine {
    int A,B;
    set<string> st1,st2;
    string chain = "";

    void precalc(){
        int n = 6;
        rep(mask,1<<n){
            string s(2*n,'?');
            rep(i,n){
                ll b = 0;
                if(mask&(1<<i)){
                    b = 1;
                }
                s[i] = s[i+n] = char('0'+b);
            }

            st1.clear(), st2.clear();
            rep(i,n){
                string t = string(s.begin()+i,s.begin()+i+5);
                st1.insert(t);
                reverse(all(t));
                st2.insert(t);
            }

            bool ok = true;
            trav(t,st1){
                if(st2.count(t)){
                    ok = false;
                }
            }

            if(ok){
                chain = string(s.begin(),s.begin()+n);
                return;
            }
        }
    }

    int move_num = 0;
    bool decided = false;
    int prev_edge = 0;
    string curr_chain = "";

}  // namespace

using namespace catherine;

void Init(int A_, int B_) {
    A = A_;
    B = B_;
    precalc();
}

int Move(std::vector<int> y) {
    // ++variable_example;
    // for (int j = 0; j < A; ++j) {
    //     if (y[j] != 0) {
    //       return j;
    //     }
    // }
    // return -1;

    if(A == 3){
        int active_cnt = 0, active_guy = -1;
        rep(i,3){
            if(y[i]){
                active_cnt++;
                active_guy = i;
            }
        }

        if(active_cnt == 1) return active_guy;
        
        int good = -1;
        rep(i,3){
            if(y[i] and y[(i+1)%3]){
                good = i;
            }
        }

        return good;
    }

    int sum = y[0]+y[1];
    if(!sum){
        decided = true;
        return -1;
    }

    if(decided){
        if(sum == 1){
            if(y[0]) prev_edge = 0;
            else prev_edge = 1;
        }
        else{
            prev_edge ^= 1;
        }

        return prev_edge;
    }

    move_num++;
    if(move_num == 1){
        if(sum == 1){
            if(y[0]) prev_edge = 0;
            else prev_edge = 1;
            decided = true;
            return prev_edge;
        }
        else if(sum >= 3){
            if(y[0] == 1) prev_edge = 0;
            else prev_edge = 1;
            decided = true;
            return prev_edge;
        }
        else{
            if(y[0]) prev_edge = 0;
            else prev_edge = 1;
            y[prev_edge]--;
            if(y[0]) curr_chain.pb('0');
            else curr_chain.pb('1');
            curr_chain.pb(char('0'+prev_edge));
            return prev_edge;
        }
    }

    if(sum >= 2){
        decided = true;
        y[prev_edge]++;
        int nxt_edge = 0;
        if(y[0] == 1) nxt_edge = 0;
        else nxt_edge = 1;

        if(nxt_edge == prev_edge) return -1;
        else return prev_edge = nxt_edge;
    }

    if(y[0]) prev_edge = 0;
    else prev_edge = 1;

    if(move_num == 4){
        curr_chain.pb(char('0'+prev_edge));
        assert(sz(curr_chain) == 5);

        decided = true;
        if(st1.count(curr_chain)){
            // wrong direction
            curr_chain.pop_back();
            prev_edge = curr_chain.back()-'0';
            return -1;
        }
        else{
            return prev_edge;
        }
    }

    curr_chain.pb(char('0'+prev_edge));
    return prev_edge;
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 18048 KB Output is correct
2 Correct 1 ms 3088 KB Output is correct
3 Correct 28 ms 16536 KB Output is correct
4 Correct 34 ms 19684 KB Output is correct
5 Incorrect 34 ms 19580 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 18048 KB Output is correct
2 Correct 1 ms 3088 KB Output is correct
3 Correct 28 ms 16536 KB Output is correct
4 Correct 34 ms 19684 KB Output is correct
5 Incorrect 34 ms 19580 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 15076 KB Output is correct
2 Correct 1 ms 3612 KB Output is correct
3 Correct 22 ms 14764 KB Output is correct
4 Correct 35 ms 16480 KB Output is correct
5 Correct 37 ms 16520 KB Output is correct
6 Correct 33 ms 15564 KB Output is correct
7 Correct 27 ms 15580 KB Output is correct
8 Correct 36 ms 16164 KB Output is correct
9 Correct 39 ms 16184 KB Output is correct
10 Correct 32 ms 15868 KB Output is correct
11 Correct 31 ms 15992 KB Output is correct
12 Correct 28 ms 16212 KB Output is correct
13 Correct 32 ms 15864 KB Output is correct
14 Correct 35 ms 16120 KB Output is correct
15 Correct 31 ms 16204 KB Output is correct

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 15076 KB Output is correct
2 Correct 1 ms 3612 KB Output is correct
3 Correct 22 ms 14764 KB Output is correct
4 Correct 35 ms 16480 KB Output is correct
5 Correct 37 ms 16520 KB Output is correct
6 Correct 33 ms 15564 KB Output is correct
7 Correct 27 ms 15580 KB Output is correct
8 Correct 36 ms 16164 KB Output is correct
9 Correct 39 ms 16184 KB Output is correct
10 Correct 32 ms 15868 KB Output is correct
11 Correct 31 ms 15992 KB Output is correct
12 Correct 28 ms 16212 KB Output is correct
13 Correct 32 ms 15864 KB Output is correct
14 Correct 35 ms 16120 KB Output is correct
15 Correct 31 ms 16204 KB Output is correct
16 Incorrect 22 ms 13844 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3344 KB Output is correct
2 Correct 1 ms 3100 KB Output is correct
3 Correct 3 ms 3352 KB Output is correct
4 Correct 2 ms 3356 KB Output is correct
5 Correct 2 ms 3340 KB Output is correct
6 Correct 2 ms 3344 KB Output is correct
7 Correct 2 ms 3356 KB Output is correct
8 Correct 3 ms 3360 KB Output is correct
9 Correct 2 ms 3356 KB Output is correct
10 Correct 2 ms 3604 KB Output is correct
11 Correct 2 ms 3352 KB Output is correct
12 Correct 2 ms 3340 KB Output is correct
13 Correct 2 ms 3360 KB Output is correct
14 Correct 2 ms 3348 KB Output is correct
15 Correct 3 ms 3348 KB Output is correct
16 Correct 2 ms 3356 KB Output is correct
17 Correct 2 ms 3352 KB Output is correct
18 Correct 2 ms 3360 KB Output is correct
19 Correct 3 ms 3356 KB Output is correct
20 Correct 2 ms 3168 KB Output is correct
21 Correct 2 ms 3364 KB Output is correct
22 Correct 2 ms 3352 KB Output is correct
23 Correct 2 ms 3352 KB Output is correct
24 Correct 2 ms 3356 KB Output is correct
25 Correct 2 ms 3352 KB Output is correct
26 Correct 2 ms 3360 KB Output is correct
27 Correct 2 ms 3364 KB Output is correct
28 Correct 1 ms 3352 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13248 KB Output is correct
2 Correct 31 ms 14528 KB Output is correct
3 Correct 1 ms 3088 KB Output is correct
4 Correct 33 ms 12888 KB Output is correct
5 Correct 50 ms 15812 KB Output is correct
6 Correct 33 ms 15804 KB Output is correct
7 Correct 27 ms 14968 KB Output is correct
8 Correct 34 ms 14956 KB Output is correct
9 Correct 37 ms 15700 KB Output is correct
10 Correct 42 ms 16072 KB Output is correct
11 Correct 40 ms 15976 KB Output is correct
12 Correct 40 ms 15756 KB Output is correct
13 Correct 40 ms 15896 KB Output is correct
14 Correct 43 ms 15852 KB Output is correct
15 Correct 40 ms 15960 KB Output is correct
16 Correct 43 ms 15788 KB Output is correct
17 Correct 32 ms 15648 KB Output is correct
18 Correct 32 ms 15476 KB Output is correct
19 Correct 35 ms 15496 KB Output is correct
20 Correct 36 ms 15680 KB Output is correct
21 Correct 34 ms 15768 KB Output is correct
22 Correct 36 ms 15704 KB Output is correct
23 Correct 28 ms 13148 KB Output is correct
24 Correct 33 ms 13028 KB Output is correct
25 Correct 32 ms 13464 KB Output is correct
26 Correct 34 ms 13400 KB Output is correct
27 Correct 31 ms 14468 KB Output is correct
28 Correct 30 ms 14436 KB Output is correct
29 Correct 30 ms 14672 KB Output is correct
30 Correct 34 ms 14608 KB Output is correct
31 Correct 34 ms 13372 KB Output is correct
32 Correct 27 ms 13172 KB Output is correct
33 Correct 28 ms 13504 KB Output is correct
34 Correct 27 ms 13540 KB Output is correct
35 Correct 40 ms 14532 KB Output is correct
36 Correct 33 ms 14384 KB Output is correct
37 Correct 40 ms 14176 KB Output is correct
38 Correct 33 ms 14424 KB Output is correct
39 Correct 31 ms 14532 KB Output is correct
40 Correct 31 ms 14360 KB Output is correct
41 Correct 34 ms 14832 KB Output is correct
42 Correct 36 ms 15092 KB Output is correct
43 Correct 41 ms 14900 KB Output is correct
44 Correct 31 ms 14976 KB Output is correct
45 Correct 35 ms 15068 KB Output is correct
46 Correct 37 ms 15068 KB Output is correct
47 Correct 36 ms 14400 KB Output is correct
48 Correct 30 ms 14524 KB Output is correct
49 Correct 31 ms 14196 KB Output is correct
50 Correct 35 ms 14124 KB Output is correct
51 Correct 28 ms 13692 KB Output is correct
52 Correct 30 ms 13448 KB Output is correct
53 Correct 28 ms 13668 KB Output is correct
54 Correct 28 ms 13520 KB Output is correct
55 Correct 34 ms 13596 KB Output is correct
56 Correct 31 ms 13368 KB Output is correct
57 Correct 32 ms 13672 KB Output is correct
58 Correct 27 ms 13576 KB Output is correct
59 Correct 26 ms 13288 KB Output is correct
60 Correct 27 ms 13424 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13160 KB Output is correct
2 Correct 30 ms 14196 KB Output is correct
3 Correct 3 ms 3088 KB Output is correct
4 Correct 24 ms 13068 KB Output is correct
5 Correct 40 ms 15772 KB Output is correct
6 Correct 40 ms 16020 KB Output is correct
7 Correct 31 ms 14952 KB Output is correct
8 Correct 28 ms 14956 KB Output is correct
9 Correct 37 ms 15900 KB Output is correct
10 Correct 36 ms 16008 KB Output is correct
11 Correct 41 ms 16044 KB Output is correct
12 Correct 43 ms 15812 KB Output is correct
13 Correct 39 ms 15884 KB Output is correct
14 Correct 43 ms 15744 KB Output is correct
15 Correct 39 ms 15752 KB Output is correct
16 Correct 43 ms 15712 KB Output is correct
17 Correct 39 ms 15468 KB Output is correct
18 Correct 34 ms 15424 KB Output is correct
19 Correct 34 ms 15700 KB Output is correct
20 Correct 50 ms 15652 KB Output is correct
21 Correct 32 ms 15780 KB Output is correct
22 Correct 36 ms 15744 KB Output is correct
23 Correct 28 ms 13168 KB Output is correct
24 Correct 30 ms 13076 KB Output is correct
25 Correct 29 ms 13776 KB Output is correct
26 Correct 28 ms 13648 KB Output is correct
27 Correct 35 ms 14540 KB Output is correct
28 Correct 36 ms 14616 KB Output is correct
29 Correct 31 ms 14504 KB Output is correct
30 Correct 39 ms 14708 KB Output is correct
31 Correct 27 ms 13148 KB Output is correct
32 Correct 27 ms 13420 KB Output is correct
33 Correct 28 ms 13520 KB Output is correct
34 Correct 26 ms 13684 KB Output is correct
35 Correct 33 ms 14448 KB Output is correct
36 Correct 33 ms 14352 KB Output is correct
37 Correct 30 ms 14488 KB Output is correct
38 Correct 35 ms 14440 KB Output is correct
39 Correct 31 ms 14536 KB Output is correct
40 Correct 33 ms 14380 KB Output is correct
41 Correct 34 ms 14972 KB Output is correct
42 Correct 37 ms 15004 KB Output is correct
43 Correct 32 ms 15032 KB Output is correct
44 Correct 38 ms 14972 KB Output is correct
45 Correct 36 ms 14952 KB Output is correct
46 Correct 35 ms 14968 KB Output is correct
47 Correct 32 ms 14452 KB Output is correct
48 Correct 37 ms 14268 KB Output is correct
49 Correct 32 ms 14284 KB Output is correct
50 Correct 36 ms 14500 KB Output is correct
51 Correct 27 ms 13484 KB Output is correct
52 Correct 33 ms 13732 KB Output is correct
53 Correct 28 ms 13508 KB Output is correct
54 Correct 28 ms 13732 KB Output is correct
55 Correct 27 ms 13540 KB Output is correct
56 Correct 30 ms 13688 KB Output is correct
57 Correct 28 ms 13524 KB Output is correct
58 Correct 37 ms 13608 KB Output is correct
59 Correct 30 ms 13364 KB Output is correct
60 Correct 27 ms 13440 KB Output is correct