oj.uz

Submission #951169

# Submission time Handle Problem Language Result Execution time Memory
951169 2024-03-21T09:44:14 Z hotboy2703 Stray Cat (JOI20_stray) C++14
100 / 100
 40 ms 20060 KB 
#include<bits/stdc++.h>
#include "Anthony.h"
using namespace std;
//using ll = long long;
using ll = int;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
namespace {
    string magic = "110010110010";
    ll good[2][12];
    vector <ll> u1,v1;

    ll Cat;
    vector <ll> last_move;
    vector <ll> all_y;
    bool chay_ngay_di;

    void init(){
        memset(good,-1,sizeof good);
        for (ll i = 0;i < sz(magic);i ++){
            for (ll j = 0;j < sz(magic);j ++){
                if (magic[(j+i)%sz(magic)]==magic[j])good[magic[j]-'0'][i] = j;
            }
        }
    }
    vector <ll> g[20010];
    ll dist[20010];
    void bfs(){
        memset(dist,-1,sizeof dist);
        dist[0] = 0;
        queue <ll> q;
        q.push(0);
        while (!q.empty()){
            ll u = q.front();
            q.pop();
            for (auto v:g[u]){
                if (dist[v]==-1){
                    dist[v] = dist[u] + 1;
                    q.push(v);
                }
            }
        }
    }
    vector <ll> path;
    vector <ll> ans;
    void dfs(ll u,ll p){
        if (sz(g[u])==2 && u != 0){
            for (auto edge:g[u]){
                ll v = u1[edge];
                if (v==u)v=v1[edge];

                if (v==p)continue;
                path.push_back(edge);
                dfs(v,u);
            }
        }
        else{
            ll color = 0;
            if (sz(path)>=2){
                ll ptr = good[ans[path[0]]][(sz(path)-1)%12];
                for (ll j = sz(path)-1;j>=0;j--,ptr=(ptr+1)%12){
                    ans[path[j]] = magic[ptr]-'0';
                }
                color = ans[path[0]];
            }
            else if (sz(path)==1){
                color = ans[path[0]];
            }
            else{
                color = 0;
            }
            path.clear();
            for (auto edge:g[u]){
                ll v = u1[edge];
                if (v==u)v=v1[edge];

                if (v==p){continue;}

                ans[edge] = 1-color;
                path.push_back(edge);
                dfs(v,u);
            }
        }
    }
}
std::vector<ll> Mark(ll n, ll m, ll a, ll b,std::vector<ll> u, std::vector<ll> v){
    init();
    if (a >= 3){
        for (ll i = 0;i < m;i ++)g[u[i]].push_back(v[i]),g[v[i]].push_back(u[i]);
        bfs();
        vector <ll> res(m);
        vector <set <ll> >  color(n);
        for (ll i = 0;i < m;i ++){
            if (dist[u[i]] == dist[v[i]]){
                res[i] = (dist[u[i]]%3)%3;
            }
            else{
                if (dist[u[i]] + 1 == dist[v[i]])swap(u[i],v[i]);
                res[i] = dist[v[i]]%3;
            }
            color[u[i]].insert(res[i]);
            color[v[i]].insert(res[i]);
        }
        return res;
    }
    else{
        u1 = u,v1 = v;
        for (ll i = 0;i < m;i ++){
            g[u[i]].push_back(i);
            g[v[i]].push_back(i);
        }
        ans.resize(m);
        dfs(0,0);

        return ans;
    }
}
void Init(ll a,ll b){
    Cat = a;
    init();
}
ll sadasd = 0;
ll Move(vector <ll> y){
    if (Cat>=3){
        if (sz(last_move))y[last_move.back()]++;
        ll cnt = 0;
        for (auto x:y)cnt+=x>0;
        if (cnt==1){
            ll ptr=0;
            for (auto x:y){
                if (x>0){
                    last_move.push_back(ptr);
                    return ptr;
                }
                ptr++;
            }
        }
        for (ll j = 0;j < 3;j ++){
            if (!y[j]){
                last_move.push_back((j+1)%3);
                return (j+1)%3;
            }
        }
    }
    vector <ll> sus = y;
    vector <ll> tmp;
    for (ll j = 0;j < sz(y);j ++){
        while (y[j]--)tmp.push_back(j);
    }
    y = tmp;
    all_y.insert(all_y.end(),y.begin(),y.end());
    auto small = [&](){
        ll cnt[2] = {};
        if (sz(last_move)){
            ll x = last_move.back();
            if (x==-1)x=last_move[sz(last_move)-2];
            cnt[x]++;
        }
        for (auto x:y){
            cnt[x]++;
        }
        if (cnt[0]==1)return 0;
        else return 1;
    };
    auto upd = [&](ll x){
        if (x!=-1&&sus[x]==0)x=-1;
        last_move.push_back(x==-1?last_move.back() : x);
        return x;
    };
    if (chay_ngay_di){
        if (sz(y)==1){
            return upd(y.back());
        }
        else{
            return upd(small());
        }
    }
    else{
        if (sz(last_move)==0){
            if (sz(y)!=2){
                chay_ngay_di = 1;
                return upd(small());
            }
            else{
                return upd(y.back());
            }
        }
        else{
            if (sz(y) == 0){
                chay_ngay_di = 1;
                return upd(-1);
            }
            else if (sz(y) >= 2){
                chay_ngay_di = 1;
                return upd(small());
            }
            else{
                if (sz(last_move)==3){
                    chay_ngay_di = 1;
                    string sus;
                    for (auto x:all_y)sus.push_back(x+'0');
                    string double_magic = magic+magic;
                    bool ok = 0;
                    for (ll j = 0;j + 4 < sz(double_magic);j ++){
                        if (sus == double_magic.substr(j,5)){
                            ok = 1;
                            break;
                        }
                    }
                    if (ok){
                        return upd(y[0]);
                    }
                    else{
                        return upd(-1);
                    }
                }
                else{
                    return upd(y.back());
                }
            }
        }
    }
}

#include<bits/stdc++.h>
#include "Catherine.h"
using namespace std;
//using ll = long long;
using ll = int;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
namespace {
    string magic = "110010110010";
    ll good[2][12];
    vector <ll> u1,v1;

    ll Cat;
    vector <ll> last_move;
    vector <ll> all_y;
    bool chay_ngay_di;

    void init(){
        memset(good,-1,sizeof good);
        for (ll i = 0;i < sz(magic);i ++){
            for (ll j = 0;j < sz(magic);j ++){
                if (magic[(j+i)%sz(magic)]==magic[j])good[magic[j]-'0'][i] = j;
            }
        }
    }
    vector <ll> g[20010];
    ll dist[20010];
    void bfs(){
        memset(dist,-1,sizeof dist);
        dist[0] = 0;
        queue <ll> q;
        q.push(0);
        while (!q.empty()){
            ll u = q.front();
            q.pop();
            for (auto v:g[u]){
                if (dist[v]==-1){
                    dist[v] = dist[u] + 1;
                    q.push(v);
                }
            }
        }
    }
    vector <ll> path;
    vector <ll> ans;
    void dfs(ll u,ll p){
        if (sz(g[u])==2 && u != 0){
            for (auto edge:g[u]){
                ll v = u1[edge];
                if (v==u)v=v1[edge];

                if (v==p)continue;
                path.push_back(edge);
                dfs(v,u);
            }
        }
        else{
            ll color = 0;
            if (sz(path)>=2){
                ll ptr = good[ans[path[0]]][(sz(path)-1)%12];
                for (ll j = sz(path)-1;j>=0;j--,ptr=(ptr+1)%12){
                    ans[path[j]] = magic[ptr]-'0';
                }
                color = ans[path[0]];
            }
            else if (sz(path)==1){
                color = ans[path[0]];
            }
            else{
                color = 0;
            }
            path.clear();
            for (auto edge:g[u]){
                ll v = u1[edge];
                if (v==u)v=v1[edge];

                if (v==p){continue;}

                ans[edge] = 1-color;
                path.push_back(edge);
                dfs(v,u);
            }
        }
    }
}
std::vector<ll> Mark(ll n, ll m, ll a, ll b,std::vector<ll> u, std::vector<ll> v){
    init();
    if (a >= 3){
        for (ll i = 0;i < m;i ++)g[u[i]].push_back(v[i]),g[v[i]].push_back(u[i]);
        bfs();
        vector <ll> res(m);
        vector <set <ll> >  color(n);
        for (ll i = 0;i < m;i ++){
            if (dist[u[i]] == dist[v[i]]){
                res[i] = (dist[u[i]]%3)%3;
            }
            else{
                if (dist[u[i]] + 1 == dist[v[i]])swap(u[i],v[i]);
                res[i] = dist[v[i]]%3;
            }
            color[u[i]].insert(res[i]);
            color[v[i]].insert(res[i]);
        }
        return res;
    }
    else{
        u1 = u,v1 = v;
        for (ll i = 0;i < m;i ++){
            g[u[i]].push_back(i);
            g[v[i]].push_back(i);
        }
        ans.resize(m);
        dfs(0,0);

        return ans;
    }
}
void Init(ll a,ll b){
    Cat = a;
    init();
}
ll sadasd = 0;
ll Move(vector <ll> y){
    if (Cat>=3){
        if (sz(last_move))y[last_move.back()]++;
        ll cnt = 0;
        for (auto x:y)cnt+=x>0;
        if (cnt==1){
            ll ptr=0;
            for (auto x:y){
                if (x>0){
                    last_move.push_back(ptr);
                    return ptr;
                }
                ptr++;
            }
        }
        for (ll j = 0;j < 3;j ++){
            if (!y[j]){
                last_move.push_back((j+1)%3);
                return (j+1)%3;
            }
        }
    }
    vector <ll> sus = y;
    vector <ll> tmp;
    for (ll j = 0;j < sz(y);j ++){
        while (y[j]--)tmp.push_back(j);
    }
    y = tmp;
    all_y.insert(all_y.end(),y.begin(),y.end());
    auto small = [&](){
        ll cnt[2] = {};
        if (sz(last_move)){
            ll x = last_move.back();
            if (x==-1)x=last_move[sz(last_move)-2];
            cnt[x]++;
        }
        for (auto x:y){
            cnt[x]++;
        }
        if (cnt[0]==1)return 0;
        else return 1;
    };
    auto upd = [&](ll x){
        if (x!=-1&&sus[x]==0)x=-1;
        last_move.push_back(x==-1?last_move.back() : x);
        return x;
    };
    if (chay_ngay_di){
        if (sz(y)==1){
            return upd(y.back());
        }
        else{
            return upd(small());
        }
    }
    else{
        if (sz(last_move)==0){
            if (sz(y)!=2){
                chay_ngay_di = 1;
                return upd(small());
            }
            else{
                return upd(y.back());
            }
        }
        else{
            if (sz(y) == 0){
                chay_ngay_di = 1;
                return upd(-1);
            }
            else if (sz(y) >= 2){
                chay_ngay_di = 1;
                return upd(small());
            }
            else{
                if (sz(last_move)==3){
                    chay_ngay_di = 1;
                    string sus;
                    for (auto x:all_y)sus.push_back(x+'0');
                    string double_magic = magic+magic;
                    bool ok = 0;
                    for (ll j = 0;j + 4 < sz(double_magic);j ++){
                        if (sus == double_magic.substr(j,5)){
                            ok = 1;
                            break;
                        }
                    }
                    if (ok){
                        return upd(y[0]);
                    }
                    else{
                        return upd(-1);
                    }
                }
                else{
                    return upd(y.back());
                }
            }
        }
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 18472 KB Output is correct
2 Correct 1 ms 1812 KB Output is correct
3 Correct 26 ms 17196 KB Output is correct
4 Correct 40 ms 19940 KB Output is correct
5 Correct 38 ms 20060 KB Output is correct
6 Correct 34 ms 18328 KB Output is correct
7 Correct 36 ms 18268 KB Output is correct
8 Correct 36 ms 19240 KB Output is correct
9 Correct 36 ms 19288 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 18472 KB Output is correct
2 Correct 1 ms 1812 KB Output is correct
3 Correct 26 ms 17196 KB Output is correct
4 Correct 40 ms 19940 KB Output is correct
5 Correct 38 ms 20060 KB Output is correct
6 Correct 34 ms 18328 KB Output is correct
7 Correct 36 ms 18268 KB Output is correct
8 Correct 36 ms 19240 KB Output is correct
9 Correct 36 ms 19288 KB Output is correct
10 Correct 31 ms 15948 KB Output is correct
11 Correct 29 ms 15920 KB Output is correct
12 Correct 29 ms 15800 KB Output is correct
13 Correct 30 ms 15956 KB Output is correct
14 Correct 30 ms 16268 KB Output is correct
15 Correct 32 ms 16740 KB Output is correct
16 Correct 38 ms 19552 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 16024 KB Output is correct
2 Correct 1 ms 1824 KB Output is correct
3 Correct 25 ms 14912 KB Output is correct
4 Correct 36 ms 18008 KB Output is correct
5 Correct 38 ms 18000 KB Output is correct
6 Correct 30 ms 16244 KB Output is correct
7 Correct 35 ms 15940 KB Output is correct
8 Correct 34 ms 16812 KB Output is correct
9 Correct 38 ms 16912 KB Output is correct
10 Correct 32 ms 16632 KB Output is correct
11 Correct 33 ms 16664 KB Output is correct
12 Correct 33 ms 16728 KB Output is correct
13 Correct 34 ms 16716 KB Output is correct
14 Correct 34 ms 16980 KB Output is correct
15 Correct 34 ms 16980 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 16024 KB Output is correct
2 Correct 1 ms 1824 KB Output is correct
3 Correct 25 ms 14912 KB Output is correct
4 Correct 36 ms 18008 KB Output is correct
5 Correct 38 ms 18000 KB Output is correct
6 Correct 30 ms 16244 KB Output is correct
7 Correct 35 ms 15940 KB Output is correct
8 Correct 34 ms 16812 KB Output is correct
9 Correct 38 ms 16912 KB Output is correct
10 Correct 32 ms 16632 KB Output is correct
11 Correct 33 ms 16664 KB Output is correct
12 Correct 33 ms 16728 KB Output is correct
13 Correct 34 ms 16716 KB Output is correct
14 Correct 34 ms 16980 KB Output is correct
15 Correct 34 ms 16980 KB Output is correct
16 Correct 26 ms 13912 KB Output is correct
17 Correct 26 ms 13964 KB Output is correct
18 Correct 28 ms 14136 KB Output is correct
19 Correct 28 ms 14156 KB Output is correct
20 Correct 30 ms 14916 KB Output is correct
21 Correct 30 ms 14672 KB Output is correct
22 Correct 34 ms 17380 KB Output is correct
23 Correct 28 ms 14064 KB Output is correct
24 Correct 29 ms 14424 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2084 KB Output is correct
2 Correct 1 ms 1824 KB Output is correct
3 Correct 2 ms 2084 KB Output is correct
4 Correct 2 ms 2084 KB Output is correct
5 Correct 2 ms 2080 KB Output is correct
6 Correct 2 ms 2076 KB Output is correct
7 Correct 2 ms 2084 KB Output is correct
8 Correct 2 ms 2068 KB Output is correct
9 Correct 2 ms 2076 KB Output is correct
10 Correct 2 ms 2084 KB Output is correct
11 Correct 2 ms 2076 KB Output is correct
12 Correct 2 ms 2084 KB Output is correct
13 Correct 2 ms 2084 KB Output is correct
14 Correct 2 ms 2076 KB Output is correct
15 Correct 2 ms 2084 KB Output is correct
16 Correct 2 ms 2336 KB Output is correct
17 Correct 2 ms 2076 KB Output is correct
18 Correct 2 ms 2076 KB Output is correct
19 Correct 2 ms 2084 KB Output is correct
20 Correct 2 ms 2076 KB Output is correct
21 Correct 2 ms 2076 KB Output is correct
22 Correct 2 ms 2324 KB Output is correct
23 Correct 2 ms 2080 KB Output is correct
24 Correct 2 ms 2068 KB Output is correct
25 Correct 2 ms 2068 KB Output is correct
26 Correct 2 ms 2068 KB Output is correct
27 Correct 2 ms 2072 KB Output is correct
28 Correct 2 ms 2084 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 12156 KB Output is correct
2 Correct 27 ms 13900 KB Output is correct
3 Correct 1 ms 1824 KB Output is correct
4 Correct 22 ms 12068 KB Output is correct
5 Correct 37 ms 15968 KB Output is correct
6 Correct 34 ms 15616 KB Output is correct
7 Correct 32 ms 14604 KB Output is correct
8 Correct 28 ms 14564 KB Output is correct
9 Correct 36 ms 15856 KB Output is correct
10 Correct 33 ms 15708 KB Output is correct
11 Correct 32 ms 15704 KB Output is correct
12 Correct 37 ms 15640 KB Output is correct
13 Correct 32 ms 15704 KB Output is correct
14 Correct 32 ms 15692 KB Output is correct
15 Correct 33 ms 15744 KB Output is correct
16 Correct 31 ms 15680 KB Output is correct
17 Correct 32 ms 15428 KB Output is correct
18 Correct 31 ms 15460 KB Output is correct
19 Correct 31 ms 15356 KB Output is correct
20 Correct 31 ms 15464 KB Output is correct
21 Correct 34 ms 15452 KB Output is correct
22 Correct 31 ms 15440 KB Output is correct
23 Correct 25 ms 12120 KB Output is correct
24 Correct 26 ms 12060 KB Output is correct
25 Correct 27 ms 12812 KB Output is correct
26 Correct 27 ms 12864 KB Output is correct
27 Correct 28 ms 13812 KB Output is correct
28 Correct 30 ms 13892 KB Output is correct
29 Correct 30 ms 13912 KB Output is correct
30 Correct 30 ms 13880 KB Output is correct
31 Correct 25 ms 12364 KB Output is correct
32 Correct 31 ms 12364 KB Output is correct
33 Correct 25 ms 12888 KB Output is correct
34 Correct 25 ms 12892 KB Output is correct
35 Correct 28 ms 13676 KB Output is correct
36 Correct 28 ms 13660 KB Output is correct
37 Correct 28 ms 13608 KB Output is correct
38 Correct 28 ms 13620 KB Output is correct
39 Correct 28 ms 13736 KB Output is correct
40 Correct 28 ms 13616 KB Output is correct
41 Correct 31 ms 14404 KB Output is correct
42 Correct 30 ms 14348 KB Output is correct
43 Correct 30 ms 14412 KB Output is correct
44 Correct 31 ms 14416 KB Output is correct
45 Correct 30 ms 14620 KB Output is correct
46 Correct 30 ms 14680 KB Output is correct
47 Correct 27 ms 13364 KB Output is correct
48 Correct 27 ms 13596 KB Output is correct
49 Correct 27 ms 13392 KB Output is correct
50 Correct 36 ms 13580 KB Output is correct
51 Correct 26 ms 12372 KB Output is correct
52 Correct 27 ms 12448 KB Output is correct
53 Correct 25 ms 12360 KB Output is correct
54 Correct 31 ms 12272 KB Output is correct
55 Correct 25 ms 12364 KB Output is correct
56 Correct 25 ms 12368 KB Output is correct
57 Correct 25 ms 12628 KB Output is correct
58 Correct 25 ms 12608 KB Output is correct
59 Correct 28 ms 12880 KB Output is correct
60 Correct 26 ms 12584 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 12068 KB Output is correct
2 Correct 31 ms 13652 KB Output is correct
3 Correct 1 ms 1816 KB Output is correct
4 Correct 23 ms 12072 KB Output is correct
5 Correct 39 ms 16024 KB Output is correct
6 Correct 33 ms 15704 KB Output is correct
7 Correct 27 ms 14672 KB Output is correct
8 Correct 28 ms 14508 KB Output is correct
9 Correct 33 ms 15948 KB Output is correct
10 Correct 32 ms 15616 KB Output is correct
11 Correct 34 ms 15520 KB Output is correct
12 Correct 33 ms 15716 KB Output is correct
13 Correct 37 ms 15704 KB Output is correct
14 Correct 34 ms 15708 KB Output is correct
15 Correct 33 ms 15720 KB Output is correct
16 Correct 39 ms 15700 KB Output is correct
17 Correct 32 ms 15620 KB Output is correct
18 Correct 32 ms 15500 KB Output is correct
19 Correct 30 ms 15712 KB Output is correct
20 Correct 32 ms 15440 KB Output is correct
21 Correct 30 ms 15448 KB Output is correct
22 Correct 30 ms 15452 KB Output is correct
23 Correct 24 ms 12100 KB Output is correct
24 Correct 25 ms 12024 KB Output is correct
25 Correct 26 ms 12872 KB Output is correct
26 Correct 26 ms 12880 KB Output is correct
27 Correct 28 ms 13912 KB Output is correct
28 Correct 34 ms 13952 KB Output is correct
29 Correct 30 ms 14168 KB Output is correct
30 Correct 30 ms 14148 KB Output is correct
31 Correct 25 ms 12376 KB Output is correct
32 Correct 25 ms 12108 KB Output is correct
33 Correct 26 ms 12876 KB Output is correct
34 Correct 25 ms 12904 KB Output is correct
35 Correct 37 ms 13836 KB Output is correct
36 Correct 28 ms 13588 KB Output is correct
37 Correct 27 ms 13660 KB Output is correct
38 Correct 30 ms 13712 KB Output is correct
39 Correct 28 ms 13660 KB Output is correct
40 Correct 31 ms 13656 KB Output is correct
41 Correct 31 ms 14396 KB Output is correct
42 Correct 30 ms 14428 KB Output is correct
43 Correct 30 ms 14372 KB Output is correct
44 Correct 30 ms 14316 KB Output is correct
45 Correct 31 ms 14616 KB Output is correct
46 Correct 36 ms 14688 KB Output is correct
47 Correct 27 ms 13436 KB Output is correct
48 Correct 27 ms 13400 KB Output is correct
49 Correct 27 ms 13392 KB Output is correct
50 Correct 28 ms 13660 KB Output is correct
51 Correct 26 ms 12360 KB Output is correct
52 Correct 24 ms 12356 KB Output is correct
53 Correct 26 ms 12364 KB Output is correct
54 Correct 28 ms 12424 KB Output is correct
55 Correct 25 ms 12360 KB Output is correct
56 Correct 25 ms 12368 KB Output is correct
57 Correct 27 ms 12640 KB Output is correct
58 Correct 26 ms 12628 KB Output is correct
59 Correct 25 ms 12652 KB Output is correct
60 Correct 26 ms 12536 KB Output is correct