oj.uz

Submission #309652

# Submission time Handle Problem Language Result Execution time Memory
309652 2020-10-04T05:10:14 Z jainbot27 Stray Cat (JOI20_stray) C++17
20 / 100
 65 ms 17452 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <cassert>
#include <string>
#include <set>

using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}

const char nl = '\n';
const int mxN = 20010;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int n, m, a, b, d[mxN]; 
vi U, V, adj[mxN], res; vpii g[mxN];
queue<int> q;

// set<string> good{"01001", "10110", "00110", "01101", "11010", "10100"};
vector<int> list = {0, 1, 0, 0, 1, 1};
int amt[3] = {0, 1, 2};
void dfs(int u, int cur_edge, int cur = 0){
    if(cur_edge!=-1) res[cur_edge] = list[cur];
    trav(v, g[u]){
        if(cur_edge==v.s) continue;
        if(siz(g[u]) == 2 && u != 0){
            dfs(v.f, v.s, (cur+1)%6);
        }
        else{
            dfs(v.f, v.s, list[cur]^1);
        }
    }
}
vi Mark(int N, int M, int A, int B, vi Uu, vi Vv){
    U = Uu; V = Vv; n = N; m = M; a = A; b = B;
    if(a==2){
        res.resize(m);
        // 0 -> 1 -> 0 -> 0 -> 1 -> 1 -> 0 -> 1 -> 0 -> 0 -> 1 -> 1
        F0R(i, m){
            g[U[i]].pb({V[i], i});
            g[V[i]].pb({U[i], i});
        }
        dfs(0, -1, 0);
        return res;
    }
    else{
        res.resize(m);
        F0R(i, n) d[i] = MOD;
        F0R(i, m){
            adj[U[i]].pb(V[i]);
            adj[V[i]].pb(U[i]);
        }
        d[0] = 0;
        q.push(0);
        while(!q.empty()){
            int u = q.front(); q.pop();
            trav(v, adj[u]){
                if(ckmin(d[v], d[u]+1)){
                    q.push(v);
                }
            }
        }
        F0R(i, m){
            // we want to give them the value of the vertex with the higher value so that we know where to go
            if(d[U[i]]<d[V[i]])
                swap(U[i], V[i]);
            if(d[U[i]]==d[V[i]]){
                res[i] = amt[d[U[i]]%3];
            }
            else{
                res[i] = amt[d[V[i]]%3];
                // if we have distance 2 and 3
                // we will at 3 see that we have 2
            }
        }
        return res;
    }
}

#ifdef ACMX
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int N, M, A, B; cin >> N >> M >> A >> B;
    U.resize(M);
    V.resize(M);
    F0R(i, M){
        cin >> U[i] >> V[i];     
    }
    vi res = Mark(N, M, A, B, U, V);
    trav(x, res){
        cout << x << " ";
    }
    cout << nl;

    return 0;
}
#endif
#include <vector>
#include <iostream>
#include <queue>
#include <cassert>
#include <set>
#include <algorithm>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

vector<int> list = {0, 1, 0, 0, 1, 1};
vector<int> cur;
int a, b; int choose = 0;
set<vector<int>> lists  {
    {1,1,0,0,1},
    {1,0,0,1,0},
    {0,0,1,0,1},
    {0,1,0,1,1},
    {1,0,1,1,0},
    {0,1,1,0,0},

};
int lst = -1;
void Init(int A, int B){
    a = A, b = B;
    
}
int Move(vi y){
    if(a > 2){
        if(y[0] == 0 && y[1] == 0 && y[2] == 0){
            assert(false);
        }
        else if(y[0] == 0 && y[1] == 0){
            return 2;
        }
        else if(y[1] == 0 && y[2] == 0){
            return 0;
        }
        else if(y[2] == 0 && y[0] == 0){
            return 1;
        }
        else if(y[0] == 0){
            return 1;
        }
        else if(y[1] == 0){
            return 2;
        }
        else if(y[2] == 0){
            return 0;
        }
        else{
            assert(false);
        }
    }
    else{
        int amt = y[0] + y[1] + (lst != -1);
        if(amt != 2) choose = 1;
        if(amt > 2){
            int z = y[0]; if(lst==0) z++;
            if(z>1) lst = 1;
            else lst = 0;
            if(y[lst]) return lst;
            else return -1;
        }
        if(amt == 1){
            int z = y[0]; if(lst==0) z++;
            lst = z == 1 ? 0 : 1;
            return y[lst] ? lst : -1;
        }
        if(choose == 1){
            if(y[0]) return lst = 0;
            return lst = 1;
        }
        if(lst==-1){
            F0R(i, 2) F0R(j, y[i]) cur.pb(i);
            if(y[0]) return lst = 0;
            else return lst = 1;
        }
        if(y[0]) cur.pb(0);
        if(y[1]) cur.pb(1);
        if(siz(cur)==5){
            choose = 1;
            if(lists.count(cur)){
                F0R(i, 2) if(y[i]) return lst = i;
            }
            else{
                return -1;
            }
        }
    }
}
#ifdef ACMX
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);


    return 0;
}
#endif

Compilation message

Catherine.cpp: In function 'int Move(vi)':
Catherine.cpp:116:1: warning: control reaches end of non-void function [-Wreturn-type]
  116 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 16292 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 43 ms 15736 KB Output is correct
4 Correct 64 ms 17444 KB Output is correct
5 Correct 65 ms 17452 KB Output is correct
6 Correct 51 ms 16032 KB Output is correct
7 Correct 49 ms 15988 KB Output is correct
8 Correct 60 ms 16800 KB Output is correct
9 Correct 61 ms 16628 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 16292 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 43 ms 15736 KB Output is correct
4 Correct 64 ms 17444 KB Output is correct
5 Correct 65 ms 17452 KB Output is correct
6 Correct 51 ms 16032 KB Output is correct
7 Correct 49 ms 15988 KB Output is correct
8 Correct 60 ms 16800 KB Output is correct
9 Correct 61 ms 16628 KB Output is correct
10 Correct 44 ms 14072 KB Output is correct
11 Correct 47 ms 14320 KB Output is correct
12 Correct 47 ms 14316 KB Output is correct
13 Correct 44 ms 14324 KB Output is correct
14 Correct 48 ms 14356 KB Output is correct
15 Correct 54 ms 14864 KB Output is correct
16 Correct 58 ms 16956 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 13940 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 40 ms 13488 KB Output is correct
4 Correct 64 ms 15280 KB Output is correct
5 Correct 65 ms 15276 KB Output is correct
6 Correct 47 ms 13836 KB Output is correct
7 Correct 46 ms 13844 KB Output is correct
8 Correct 58 ms 14588 KB Output is correct
9 Correct 56 ms 14616 KB Output is correct
10 Correct 55 ms 14380 KB Output is correct
11 Correct 51 ms 14364 KB Output is correct
12 Correct 52 ms 14368 KB Output is correct
13 Correct 51 ms 14372 KB Output is correct
14 Correct 56 ms 14632 KB Output is correct
15 Correct 55 ms 14452 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 13940 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 40 ms 13488 KB Output is correct
4 Correct 64 ms 15280 KB Output is correct
5 Correct 65 ms 15276 KB Output is correct
6 Correct 47 ms 13836 KB Output is correct
7 Correct 46 ms 13844 KB Output is correct
8 Correct 58 ms 14588 KB Output is correct
9 Correct 56 ms 14616 KB Output is correct
10 Correct 55 ms 14380 KB Output is correct
11 Correct 51 ms 14364 KB Output is correct
12 Correct 52 ms 14368 KB Output is correct
13 Correct 51 ms 14372 KB Output is correct
14 Correct 56 ms 14632 KB Output is correct
15 Correct 55 ms 14452 KB Output is correct
16 Correct 40 ms 12152 KB Output is correct
17 Correct 48 ms 12328 KB Output is correct
18 Correct 43 ms 12280 KB Output is correct
19 Correct 45 ms 12152 KB Output is correct
20 Correct 56 ms 12912 KB Output is correct
21 Correct 47 ms 12936 KB Output is correct
22 Correct 55 ms 14960 KB Output is correct
23 Correct 44 ms 12396 KB Output is correct
24 Correct 44 ms 12280 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 12028 KB Output is correct
2 Correct 50 ms 13332 KB Output is correct
3 Correct 1 ms 2560 KB Output is correct
4 Correct 37 ms 12072 KB Output is correct
5 Correct 57 ms 15052 KB Output is correct
6 Correct 60 ms 15264 KB Output is correct
7 Correct 48 ms 14300 KB Output is correct
8 Incorrect 45 ms 14188 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 12256 KB Output is correct
2 Correct 50 ms 13052 KB Output is correct
3 Correct 1 ms 2560 KB Output is correct
4 Correct 38 ms 12104 KB Output is correct
5 Correct 59 ms 15068 KB Output is correct
6 Correct 58 ms 14968 KB Output is correct
7 Correct 47 ms 14316 KB Output is correct
8 Correct 47 ms 14292 KB Output is correct
9 Correct 57 ms 15052 KB Output is correct
10 Correct 58 ms 15060 KB Output is correct
11 Correct 61 ms 15072 KB Output is correct
12 Correct 57 ms 15092 KB Output is correct
13 Correct 61 ms 15456 KB Output is correct
14 Correct 59 ms 15196 KB Output is correct
15 Incorrect 56 ms 15068 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -