oj.uz

Submission #309659

# Submission time Handle Problem Language Result Execution time Memory
309659 2020-10-04T06:14:26 Z jainbot27 Stray Cat (JOI20_stray) C++17
100 / 100
 70 ms 17444 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> 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{
        vi ny = y;
        if(lst!=-1) ny[lst]++;
        int amt = ny[0]+ny[1];
        if(amt!=2)choose=1;
        if(choose){
            if(amt==1){
                if(lst==-1) F0R(i, 2) if(y[i]) return lst=i;
                return -1;
            }
            else if(amt == 2){
                F0R(i, 2) if(y[i]) return lst = i;
            }
            else{
                F0R(i, 2) {
                    if(ny[i]==1){
                        if(!y[i]) return -1;
                        else return lst = i;
                    }
                }
            }
        }
        else{
            if(lst!=-1){
                F0R(i, 2) if(y[i]){
                    cur.pb(i);
                    if(cur.size()<5) return lst = i;
                    else {
                        choose = 1;
                        trav(v, lists)
                            if(v == cur) return lst = i;
                        return -1;
                    }
                }
            }
            else{
                F0R(i, 2){
                    if(y[i]){
                        cur.pb(i);
                        y[i]--;
                        F0R(j, 2){
                            if(y[j]){
                                cur.pb(j);
                                return lst = j;
                            }
                        }
                    }
                }
            }
        }
    }
}
#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:130:1: warning: control reaches end of non-void function [-Wreturn-type]
  130 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 16416 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 41 ms 15624 KB Output is correct
4 Correct 65 ms 17444 KB Output is correct
5 Correct 70 ms 17396 KB Output is correct
6 Correct 49 ms 16012 KB Output is correct
7 Correct 49 ms 15988 KB Output is correct
8 Correct 60 ms 16756 KB Output is correct
9 Correct 59 ms 16796 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 16416 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 41 ms 15624 KB Output is correct
4 Correct 65 ms 17444 KB Output is correct
5 Correct 70 ms 17396 KB Output is correct
6 Correct 49 ms 16012 KB Output is correct
7 Correct 49 ms 15988 KB Output is correct
8 Correct 60 ms 16756 KB Output is correct
9 Correct 59 ms 16796 KB Output is correct
10 Correct 46 ms 14072 KB Output is correct
11 Correct 45 ms 14320 KB Output is correct
12 Correct 45 ms 14452 KB Output is correct
13 Correct 45 ms 14064 KB Output is correct
14 Correct 47 ms 14392 KB Output is correct
15 Correct 54 ms 14704 KB Output is correct
16 Correct 56 ms 16884 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 14084 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 40 ms 13488 KB Output is correct
4 Correct 61 ms 15284 KB Output is correct
5 Correct 61 ms 15100 KB Output is correct
6 Correct 50 ms 13820 KB Output is correct
7 Correct 47 ms 13840 KB Output is correct
8 Correct 57 ms 14616 KB Output is correct
9 Correct 56 ms 14640 KB Output is correct
10 Correct 52 ms 14380 KB Output is correct
11 Correct 52 ms 14376 KB Output is correct
12 Correct 52 ms 14200 KB Output is correct
13 Correct 53 ms 14248 KB Output is correct
14 Correct 57 ms 14964 KB Output is correct
15 Correct 56 ms 14632 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 14084 KB Output is correct
2 Correct 1 ms 2560 KB Output is correct
3 Correct 40 ms 13488 KB Output is correct
4 Correct 61 ms 15284 KB Output is correct
5 Correct 61 ms 15100 KB Output is correct
6 Correct 50 ms 13820 KB Output is correct
7 Correct 47 ms 13840 KB Output is correct
8 Correct 57 ms 14616 KB Output is correct
9 Correct 56 ms 14640 KB Output is correct
10 Correct 52 ms 14380 KB Output is correct
11 Correct 52 ms 14376 KB Output is correct
12 Correct 52 ms 14200 KB Output is correct
13 Correct 53 ms 14248 KB Output is correct
14 Correct 57 ms 14964 KB Output is correct
15 Correct 56 ms 14632 KB Output is correct
16 Correct 45 ms 12332 KB Output is correct
17 Correct 41 ms 12320 KB Output is correct
18 Correct 43 ms 12392 KB Output is correct
19 Correct 43 ms 12280 KB Output is correct
20 Correct 53 ms 12812 KB Output is correct
21 Correct 49 ms 12536 KB Output is correct
22 Correct 56 ms 14768 KB Output is correct
23 Correct 46 ms 12260 KB Output is correct
24 Correct 44 ms 12412 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 3 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 3 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 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 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 2 ms 2560 KB Output is correct
15 Correct 2 ms 2560 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 3 ms 2560 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 4 ms 2624 KB Output is correct
23 Correct 2 ms 2560 KB Output is correct
24 Correct 2 ms 2560 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2560 KB Output is correct
27 Correct 2 ms 2560 KB Output is correct
28 Correct 3 ms 2560 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 12244 KB Output is correct
2 Correct 51 ms 13316 KB Output is correct
3 Correct 1 ms 2560 KB Output is correct
4 Correct 37 ms 11896 KB Output is correct
5 Correct 59 ms 14812 KB Output is correct
6 Correct 61 ms 14932 KB Output is correct
7 Correct 47 ms 14044 KB Output is correct
8 Correct 46 ms 14040 KB Output is correct
9 Correct 60 ms 14728 KB Output is correct
10 Correct 60 ms 14948 KB Output is correct
11 Correct 59 ms 14712 KB Output is correct
12 Correct 61 ms 14808 KB Output is correct
13 Correct 61 ms 14804 KB Output is correct
14 Correct 61 ms 14948 KB Output is correct
15 Correct 59 ms 14832 KB Output is correct
16 Correct 62 ms 14836 KB Output is correct
17 Correct 56 ms 14552 KB Output is correct
18 Correct 54 ms 14564 KB Output is correct
19 Correct 55 ms 14556 KB Output is correct
20 Correct 54 ms 14556 KB Output is correct
21 Correct 56 ms 14556 KB Output is correct
22 Correct 55 ms 14684 KB Output is correct
23 Correct 43 ms 12028 KB Output is correct
24 Correct 46 ms 12264 KB Output is correct
25 Correct 46 ms 12628 KB Output is correct
26 Correct 46 ms 12668 KB Output is correct
27 Correct 54 ms 13452 KB Output is correct
28 Correct 54 ms 13436 KB Output is correct
29 Correct 54 ms 13692 KB Output is correct
30 Correct 52 ms 13552 KB Output is correct
31 Correct 44 ms 12272 KB Output is correct
32 Correct 43 ms 12156 KB Output is correct
33 Correct 50 ms 12612 KB Output is correct
34 Correct 47 ms 12736 KB Output is correct
35 Correct 53 ms 13308 KB Output is correct
36 Correct 52 ms 13300 KB Output is correct
37 Correct 54 ms 13384 KB Output is correct
38 Correct 53 ms 13292 KB Output is correct
39 Correct 52 ms 13416 KB Output is correct
40 Correct 52 ms 13404 KB Output is correct
41 Correct 54 ms 13824 KB Output is correct
42 Correct 65 ms 14068 KB Output is correct
43 Correct 54 ms 13948 KB Output is correct
44 Correct 61 ms 14200 KB Output is correct
45 Correct 58 ms 13824 KB Output is correct
46 Correct 54 ms 13844 KB Output is correct
47 Correct 49 ms 13052 KB Output is correct
48 Correct 50 ms 13044 KB Output is correct
49 Correct 48 ms 12988 KB Output is correct
50 Correct 50 ms 13224 KB Output is correct
51 Correct 47 ms 12356 KB Output is correct
52 Correct 46 ms 12356 KB Output is correct
53 Correct 46 ms 12352 KB Output is correct
54 Correct 45 ms 12620 KB Output is correct
55 Correct 47 ms 12484 KB Output is correct
56 Correct 45 ms 12352 KB Output is correct
57 Correct 45 ms 12384 KB Output is correct
58 Correct 44 ms 12380 KB Output is correct
59 Correct 46 ms 12268 KB Output is correct
60 Correct 50 ms 12408 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 12252 KB Output is correct
2 Correct 47 ms 13076 KB Output is correct
3 Correct 1 ms 2560 KB Output is correct
4 Correct 39 ms 11896 KB Output is correct
5 Correct 65 ms 14944 KB Output is correct
6 Correct 57 ms 14832 KB Output is correct
7 Correct 49 ms 14052 KB Output is correct
8 Correct 48 ms 14084 KB Output is correct
9 Correct 66 ms 14940 KB Output is correct
10 Correct 60 ms 15092 KB Output is correct
11 Correct 62 ms 14932 KB Output is correct
12 Correct 60 ms 14812 KB Output is correct
13 Correct 61 ms 14936 KB Output is correct
14 Correct 58 ms 14940 KB Output is correct
15 Correct 57 ms 14836 KB Output is correct
16 Correct 58 ms 14932 KB Output is correct
17 Correct 65 ms 14324 KB Output is correct
18 Correct 61 ms 14552 KB Output is correct
19 Correct 55 ms 14556 KB Output is correct
20 Correct 55 ms 14324 KB Output is correct
21 Correct 56 ms 14544 KB Output is correct
22 Correct 57 ms 14560 KB Output is correct
23 Correct 43 ms 12156 KB Output is correct
24 Correct 43 ms 12028 KB Output is correct
25 Correct 47 ms 12636 KB Output is correct
26 Correct 45 ms 12656 KB Output is correct
27 Correct 56 ms 13428 KB Output is correct
28 Correct 53 ms 13460 KB Output is correct
29 Correct 53 ms 13436 KB Output is correct
30 Correct 54 ms 13428 KB Output is correct
31 Correct 43 ms 12276 KB Output is correct
32 Correct 44 ms 12272 KB Output is correct
33 Correct 46 ms 12404 KB Output is correct
34 Correct 47 ms 12532 KB Output is correct
35 Correct 51 ms 13336 KB Output is correct
36 Correct 51 ms 13380 KB Output is correct
37 Correct 53 ms 13392 KB Output is correct
38 Correct 53 ms 13456 KB Output is correct
39 Correct 51 ms 13388 KB Output is correct
40 Correct 52 ms 13392 KB Output is correct
41 Correct 55 ms 13948 KB Output is correct
42 Correct 55 ms 14084 KB Output is correct
43 Correct 54 ms 14060 KB Output is correct
44 Correct 56 ms 13820 KB Output is correct
45 Correct 55 ms 14076 KB Output is correct
46 Correct 58 ms 14280 KB Output is correct
47 Correct 51 ms 12924 KB Output is correct
48 Correct 50 ms 13052 KB Output is correct
49 Correct 48 ms 12976 KB Output is correct
50 Correct 50 ms 13228 KB Output is correct
51 Correct 44 ms 12352 KB Output is correct
52 Correct 45 ms 12276 KB Output is correct
53 Correct 46 ms 12348 KB Output is correct
54 Correct 45 ms 12344 KB Output is correct
55 Correct 48 ms 12356 KB Output is correct
56 Correct 46 ms 12340 KB Output is correct
57 Correct 49 ms 12148 KB Output is correct
58 Correct 46 ms 12384 KB Output is correct
59 Correct 44 ms 12156 KB Output is correct
60 Correct 46 ms 12392 KB Output is correct