oj.uz

Submission #949282

# Submission time Handle Problem Language Result Execution time Memory
949282 2024-03-19T04:52:12 Z yeediot Stray Cat (JOI20_stray) C++14
100 / 100
 39 ms 16772 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
const int mxn=2e4+5;
vector<int>x(mxn);
vector<pii>adj[mxn];
long long dis[mxn];
int a,n,m,b;
void bfs(){
    queue<int>q;
    memset(dis,0x3f3f3f3f,sizeof(dis));
    q.push(0);
    dis[0]=0;
    while(sz(q)){
        auto v=q.front();
        q.pop();
        for(auto [u,id]:adj[v]){
            if(dis[u]>dis[v]+1){
                dis[u]=dis[v]+1;
                q.push(u);
            }
        }
    }
}
int col[]={0,1,0,0,1,1};
void dfs(int v,int pa,int p){
    for(auto [u,id]:adj[v]){
        if(u==pa)continue;
        x[id]=col[p];
        if(sz(adj[u])<3){
            dfs(u,v,(p+1)%6);
        }
        else{
            dfs(u,v,!x[id]);
        }
    }
}
vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
    a=A,n=N,m=M,b=B;
    vector<int> X(M);
    for(int i=0;i<M;i++){
        adj[U[i]].pb({V[i],i});
        adj[V[i]].pb({U[i],i});
    }
    if(A>=3){
        bfs();
        for(int i=0;i<M;i++){
            X[i]=min(dis[V[i]],dis[U[i]])%A;
        }
    }
    else{
        dfs(0,0,0);
        for(int i=0;i<M;i++){
            X[i]=x[i];
        }
    }
    return X;
}

#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
namespace {
    int a,b;
}  // namespace

void Init(int A, int B) {
    a=A,b=B;
}
bool f,found;
int last,step,fs;
int c=0;
int Move(std::vector<int> y) {
    if(a>=3){
        for(int i=0;i<a;i++){
            if(y[i] and y[(i+1)%a]){
                return i;
            }
        }
        for(int i=0;i<a;i++){
            if(y[i])return i;
        }
    }
    else{
        int cnt=0;
        for(auto u:y)cnt+=u;
        if(cnt+f>=3){
            found=1;
            if(!f){
                f=1;
                if(y[1]==1){
                    last=1;
                    return 1;
                }
                else{
                    last=0;
                    return 0;
                }
            }
            else{
                if(y[last]==0){
                    return -1;
                }
                else{
                    y[last]++;
                    if(y[1]==1){
                        last=1;
                        return 1;
                    }
                    else{
                        last=0;
                        return 0;
                    }
                }
            }
        }
        else if(cnt+f==1){
            found=true;
            if(!f){
                f=1;
                if(y[0]==1){
                    last=0;
                }
                else{
                    last=1;
                }
                return last;
            }
            else{
                return -1;
            }
        }
        else{
            f=1;
            if(found){
                if(y[1]==1){
                    last=1;
                    return 1;
                }
                else{
                    last=0;
                    return 0;
                }
            }
            if(step==0){
                step++;
                if(y[0]==2){
                    c=1;
                    last=0;
                    return 0;
                }
                else if(y[1]==2){
                    c=2;
                    last=1;
                    return 1;
                }
                else{
                    c=3;
                    last=0;
                    return 0;
                }
            }
            else if(step==1){
                step++;
                if(c==1){
                    last=1;
                    return 1;
                }
                else if(c==2){
                    last=0;
                    return 0;
                }
                else{
                    if(y[0]){
                        last=0;
                        fs=0;
                        return 0;
                    }
                    else if(y[1]){
                        last=1;
                        fs=1;
                        return 1;
                    }
                }
            }
            else if(step==2){
                step++;
                if(c==1 or c==2){
                    found=true;
                    if(y[0]){
                        last=0;
                        return 0;
                    }
                    else{
                        return -1;
                    }
                }
                else{
                    if(fs==0){
                        last=1;
                        return 1;
                    }
                    else{
                        //101
                        found=1;
                        if(y[1]){
                            last=1;
                            return 1;
                        }
                        else{
                            return -1;
                        }
                    }
                }
            }
            else{
                found=1;
                if(y[0]){
                    last=0;
                    return 0;
                }
                else{
                    return -1;
                }
            }
        }
    }
}

Compilation message

Anthony.cpp: In function 'void bfs()':
Anthony.cpp:58:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         for(auto [u,id]:adj[v]){
      |                  ^
Anthony.cpp: In function 'void dfs(int, int, int)':
Anthony.cpp:68:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   68 |     for(auto [u,id]:adj[v]){
      |              ^
Anthony.cpp: In function 'void setIO(std::string)':
Anthony.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Anthony.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Catherine.cpp: In function 'void setIO(std::string)':
Catherine.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Catherine.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:210:1: warning: control reaches end of non-void function [-Wreturn-type]
  210 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15728 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 24 ms 15236 KB Output is correct
4 Correct 34 ms 16772 KB Output is correct
5 Correct 36 ms 16728 KB Output is correct
6 Correct 27 ms 15648 KB Output is correct
7 Correct 28 ms 15484 KB Output is correct
8 Correct 34 ms 16188 KB Output is correct
9 Correct 34 ms 16356 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15728 KB Output is correct
2 Correct 1 ms 1552 KB Output is correct
3 Correct 24 ms 15236 KB Output is correct
4 Correct 34 ms 16772 KB Output is correct
5 Correct 36 ms 16728 KB Output is correct
6 Correct 27 ms 15648 KB Output is correct
7 Correct 28 ms 15484 KB Output is correct
8 Correct 34 ms 16188 KB Output is correct
9 Correct 34 ms 16356 KB Output is correct
10 Correct 32 ms 13644 KB Output is correct
11 Correct 28 ms 13688 KB Output is correct
12 Correct 27 ms 13496 KB Output is correct
13 Correct 25 ms 13640 KB Output is correct
14 Correct 27 ms 13936 KB Output is correct
15 Correct 28 ms 14188 KB Output is correct
16 Correct 31 ms 16292 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13240 KB Output is correct
2 Correct 1 ms 2068 KB Output is correct
3 Correct 22 ms 12920 KB Output is correct
4 Correct 35 ms 14624 KB Output is correct
5 Correct 32 ms 14708 KB Output is correct
6 Correct 26 ms 13144 KB Output is correct
7 Correct 26 ms 13180 KB Output is correct
8 Correct 30 ms 13944 KB Output is correct
9 Correct 31 ms 13916 KB Output is correct
10 Correct 28 ms 13684 KB Output is correct
11 Correct 36 ms 13712 KB Output is correct
12 Correct 27 ms 13604 KB Output is correct
13 Correct 28 ms 13688 KB Output is correct
14 Correct 31 ms 13772 KB Output is correct
15 Correct 28 ms 13992 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13240 KB Output is correct
2 Correct 1 ms 2068 KB Output is correct
3 Correct 22 ms 12920 KB Output is correct
4 Correct 35 ms 14624 KB Output is correct
5 Correct 32 ms 14708 KB Output is correct
6 Correct 26 ms 13144 KB Output is correct
7 Correct 26 ms 13180 KB Output is correct
8 Correct 30 ms 13944 KB Output is correct
9 Correct 31 ms 13916 KB Output is correct
10 Correct 28 ms 13684 KB Output is correct
11 Correct 36 ms 13712 KB Output is correct
12 Correct 27 ms 13604 KB Output is correct
13 Correct 28 ms 13688 KB Output is correct
14 Correct 31 ms 13772 KB Output is correct
15 Correct 28 ms 13992 KB Output is correct
16 Correct 24 ms 11964 KB Output is correct
17 Correct 24 ms 11636 KB Output is correct
18 Correct 24 ms 11808 KB Output is correct
19 Correct 25 ms 11812 KB Output is correct
20 Correct 26 ms 12340 KB Output is correct
21 Correct 26 ms 12152 KB Output is correct
22 Correct 30 ms 14168 KB Output is correct
23 Correct 25 ms 11888 KB Output is correct
24 Correct 25 ms 11732 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1560 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 1 ms 1560 KB Output is correct
4 Correct 2 ms 1560 KB Output is correct
5 Correct 2 ms 1560 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1568 KB Output is correct
8 Correct 2 ms 1556 KB Output is correct
9 Correct 2 ms 1556 KB Output is correct
10 Correct 2 ms 1572 KB Output is correct
11 Correct 1 ms 1564 KB Output is correct
12 Correct 2 ms 1564 KB Output is correct
13 Correct 2 ms 1568 KB Output is correct
14 Correct 2 ms 1536 KB Output is correct
15 Correct 2 ms 2076 KB Output is correct
16 Correct 1 ms 1572 KB Output is correct
17 Correct 2 ms 1564 KB Output is correct
18 Correct 1 ms 1564 KB Output is correct
19 Correct 1 ms 1556 KB Output is correct
20 Correct 1 ms 1572 KB Output is correct
21 Correct 1 ms 1564 KB Output is correct
22 Correct 2 ms 1576 KB Output is correct
23 Correct 2 ms 1564 KB Output is correct
24 Correct 1 ms 1564 KB Output is correct
25 Correct 2 ms 1572 KB Output is correct
26 Correct 1 ms 1572 KB Output is correct
27 Correct 2 ms 1564 KB Output is correct
28 Correct 1 ms 1564 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11396 KB Output is correct
2 Correct 27 ms 12672 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 20 ms 11248 KB Output is correct
5 Correct 34 ms 13856 KB Output is correct
6 Correct 30 ms 13700 KB Output is correct
7 Correct 26 ms 12936 KB Output is correct
8 Correct 26 ms 13404 KB Output is correct
9 Correct 31 ms 14496 KB Output is correct
10 Correct 31 ms 14500 KB Output is correct
11 Correct 31 ms 14416 KB Output is correct
12 Correct 32 ms 14304 KB Output is correct
13 Correct 32 ms 14416 KB Output is correct
14 Correct 30 ms 14416 KB Output is correct
15 Correct 39 ms 14480 KB Output is correct
16 Correct 31 ms 14632 KB Output is correct
17 Correct 28 ms 13912 KB Output is correct
18 Correct 30 ms 14156 KB Output is correct
19 Correct 28 ms 14164 KB Output is correct
20 Correct 28 ms 14156 KB Output is correct
21 Correct 28 ms 14096 KB Output is correct
22 Correct 30 ms 14164 KB Output is correct
23 Correct 24 ms 11856 KB Output is correct
24 Correct 24 ms 11852 KB Output is correct
25 Correct 25 ms 12384 KB Output is correct
26 Correct 25 ms 12356 KB Output is correct
27 Correct 28 ms 13148 KB Output is correct
28 Correct 27 ms 13636 KB Output is correct
29 Correct 28 ms 13136 KB Output is correct
30 Correct 28 ms 13140 KB Output is correct
31 Correct 25 ms 11856 KB Output is correct
32 Correct 24 ms 11868 KB Output is correct
33 Correct 25 ms 12360 KB Output is correct
34 Correct 25 ms 12368 KB Output is correct
35 Correct 27 ms 13304 KB Output is correct
36 Correct 32 ms 12884 KB Output is correct
37 Correct 27 ms 12848 KB Output is correct
38 Correct 26 ms 12868 KB Output is correct
39 Correct 27 ms 12876 KB Output is correct
40 Correct 27 ms 12884 KB Output is correct
41 Correct 30 ms 13768 KB Output is correct
42 Correct 28 ms 13708 KB Output is correct
43 Correct 28 ms 13692 KB Output is correct
44 Correct 28 ms 13588 KB Output is correct
45 Correct 28 ms 13980 KB Output is correct
46 Correct 28 ms 13836 KB Output is correct
47 Correct 32 ms 12880 KB Output is correct
48 Correct 27 ms 12864 KB Output is correct
49 Correct 26 ms 12612 KB Output is correct
50 Correct 36 ms 12880 KB Output is correct
51 Correct 32 ms 11896 KB Output is correct
52 Correct 24 ms 11860 KB Output is correct
53 Correct 26 ms 11848 KB Output is correct
54 Correct 26 ms 11856 KB Output is correct
55 Correct 25 ms 11960 KB Output is correct
56 Correct 28 ms 11848 KB Output is correct
57 Correct 24 ms 11924 KB Output is correct
58 Correct 24 ms 11872 KB Output is correct
59 Correct 24 ms 11864 KB Output is correct
60 Correct 26 ms 11860 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11372 KB Output is correct
2 Correct 28 ms 12404 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 23 ms 11084 KB Output is correct
5 Correct 31 ms 13864 KB Output is correct
6 Correct 35 ms 13980 KB Output is correct
7 Correct 27 ms 13400 KB Output is correct
8 Correct 26 ms 13388 KB Output is correct
9 Correct 30 ms 14404 KB Output is correct
10 Correct 30 ms 14428 KB Output is correct
11 Correct 32 ms 14428 KB Output is correct
12 Correct 30 ms 14424 KB Output is correct
13 Correct 32 ms 14360 KB Output is correct
14 Correct 30 ms 14424 KB Output is correct
15 Correct 31 ms 14480 KB Output is correct
16 Correct 37 ms 14320 KB Output is correct
17 Correct 28 ms 14316 KB Output is correct
18 Correct 28 ms 14140 KB Output is correct
19 Correct 28 ms 14252 KB Output is correct
20 Correct 30 ms 14312 KB Output is correct
21 Correct 36 ms 13996 KB Output is correct
22 Correct 34 ms 14104 KB Output is correct
23 Correct 24 ms 11864 KB Output is correct
24 Correct 24 ms 11696 KB Output is correct
25 Correct 25 ms 12116 KB Output is correct
26 Correct 28 ms 12884 KB Output is correct
27 Correct 27 ms 13164 KB Output is correct
28 Correct 28 ms 13108 KB Output is correct
29 Correct 28 ms 13136 KB Output is correct
30 Correct 28 ms 13060 KB Output is correct
31 Correct 24 ms 11952 KB Output is correct
32 Correct 25 ms 11852 KB Output is correct
33 Correct 26 ms 12392 KB Output is correct
34 Correct 25 ms 12384 KB Output is correct
35 Correct 27 ms 12876 KB Output is correct
36 Correct 27 ms 12972 KB Output is correct
37 Correct 26 ms 12900 KB Output is correct
38 Correct 33 ms 13204 KB Output is correct
39 Correct 27 ms 12848 KB Output is correct
40 Correct 27 ms 12860 KB Output is correct
41 Correct 30 ms 13616 KB Output is correct
42 Correct 36 ms 13640 KB Output is correct
43 Correct 28 ms 13632 KB Output is correct
44 Correct 30 ms 13612 KB Output is correct
45 Correct 28 ms 13532 KB Output is correct
46 Correct 27 ms 13648 KB Output is correct
47 Correct 28 ms 12872 KB Output is correct
48 Correct 27 ms 12856 KB Output is correct
49 Correct 27 ms 12608 KB Output is correct
50 Correct 27 ms 12848 KB Output is correct
51 Correct 26 ms 11844 KB Output is correct
52 Correct 24 ms 12088 KB Output is correct
53 Correct 25 ms 11828 KB Output is correct
54 Correct 25 ms 11788 KB Output is correct
55 Correct 32 ms 11992 KB Output is correct
56 Correct 25 ms 11848 KB Output is correct
57 Correct 26 ms 11848 KB Output is correct
58 Correct 25 ms 11860 KB Output is correct
59 Correct 25 ms 11852 KB Output is correct
60 Correct 25 ms 11808 KB Output is correct