oj.uz

Submission #1005130

# Submission time Handle Problem Language Result Execution time Memory
1005130 2024-06-22T07:41:01 Z onbert Stray Cat (JOI20_stray) C++17
100 / 100
 38 ms 16556 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> Mark(int n, int m, int A, int b, vector<int> U, vector<int> V) {
    vector<pair<int,int>> adj[n];
    // cout << "test" << endl;
    for (int i=0;i<m;i++) adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
    int a[6] = {1, 0, 1, 0, 0, 1};
    int vis[n];
    for (int i=0;i<n;i++) vis[i] = -1;
    queue<int> Q;
    vis[0] = 0;
    Q.push(0);
    vector<int> ans(m, -1);
    while (Q.size() > 0) {
        int u = Q.front();
        for (auto [v, id]:adj[u]) {
            if (A!=2 && vis[v] != (vis[u]+2)%3) ans[id] = vis[u];
            if (vis[v] != -1) continue;
            if (A==2) {
                if (adj[u].size()<=2) vis[v] = (vis[u]+1)%6;
                else vis[v] = a[vis[u]];
                ans[id] = a[vis[v]];
            } else {
                vis[v] = (vis[u]+1)%3;
                ans[id] = vis[u];
            }
            Q.push(v);
        }
        Q.pop();
    }
    return ans;
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;

int A;
int move(vector<int> v);
void Init(int AA, int B) {
    A = AA;
}

int cnt = 0, a[6] = {1, 0, 1, 0, 0, 1};
bool homerun = false;
int last = -1;
vector<int> track;
int Move(vector<int> v) {
    if (A!=2) return move(v);
    cnt++;
    if (homerun) {
        if (v[0] + v[1] == 1) {
            for (int i=0;i<A;i++) if (v[i]) {
                last = i;
                return i;
            }
        } else {
            v[last]++;
            for (int i=0;i<A;i++) if (v[i]==1) {
                if (i==last) return -1;
                else {
                    last = i;
                    return i;
                }
            }
        }
    }
    if (cnt==1) {
        if (v[0] + v[1] == 2) {
            if (v[0]==2) {
                track = {0, 0};
                last = 0;
                return 0;
            }
            if (v[1]==2) {
                track = {1, 1};
                last = 1;
                return 1;
            }
            if (v[0]==1 && v[1]==1) {
                track = {1, 0};
                last = 0;
                return 0;
            }
        }
        homerun = true;
        for (int i=0;i<A;i++) if (v[i]==1) {
            last = i;
            return i;
        }
    }
    if (v[0] + v[1] != 1) {
        homerun = true;
        v[last]++;
        for (int i=0;i<A;i++) if (v[i]==1) {
            if (i==last) return -1;
            else {
                last = i;
                return i;
            }
        }
    }
    if (cnt==4) {
        homerun = true;
        for (int i=0;i<A;i++) if (v[i]) track.push_back(i);
        for (int i=0;i<6;i++) {
            bool turn = true;
            for (int j=0;j<5;j++) if (track[j] != a[(i+j)%6]) turn = false;
            if (turn) return -1;
        }
        for (int i=0;i<A;i++) if (v[i]) {
            last = i;
            return i;
        }
    }
    for (int i=0;i<A;i++) if (v[i]) {
        track.push_back(i);
        last = i;
        return i;
    }
    // cout << "wat" << endl;
    return 69420;
}

int move(vector<int> v) {
    if (last!=-1) v[last]++;
    if (v[0] + v[1] + v[2]==1) for (int i=0;i<3;i++) if (v[i]) {
        if (i==last) return -1;
        else {
            last = i;
            return i;
        }
    }
    for (int i=0;i<3;i++) if (v[i] && v[(i+1)%3]) {
        if (i==last) return -1;
        else {
            last = i;
            return i;
        }
    }
    return 69420;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15728 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 20 ms 14644 KB Output is correct
4 Correct 34 ms 16556 KB Output is correct
5 Correct 32 ms 16496 KB Output is correct
6 Correct 23 ms 15480 KB Output is correct
7 Correct 23 ms 15476 KB Output is correct
8 Correct 27 ms 16224 KB Output is correct
9 Correct 27 ms 16240 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15728 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 20 ms 14644 KB Output is correct
4 Correct 34 ms 16556 KB Output is correct
5 Correct 32 ms 16496 KB Output is correct
6 Correct 23 ms 15480 KB Output is correct
7 Correct 23 ms 15476 KB Output is correct
8 Correct 27 ms 16224 KB Output is correct
9 Correct 27 ms 16240 KB Output is correct
10 Correct 22 ms 13428 KB Output is correct
11 Correct 20 ms 13888 KB Output is correct
12 Correct 22 ms 13892 KB Output is correct
13 Correct 23 ms 13708 KB Output is correct
14 Correct 27 ms 14028 KB Output is correct
15 Correct 24 ms 14416 KB Output is correct
16 Correct 27 ms 16464 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 13172 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 21 ms 12516 KB Output is correct
4 Correct 29 ms 14460 KB Output is correct
5 Correct 31 ms 14456 KB Output is correct
6 Correct 25 ms 13352 KB Output is correct
7 Correct 24 ms 13196 KB Output is correct
8 Correct 27 ms 13952 KB Output is correct
9 Correct 30 ms 14204 KB Output is correct
10 Correct 27 ms 13664 KB Output is correct
11 Correct 29 ms 13676 KB Output is correct
12 Correct 32 ms 13676 KB Output is correct
13 Correct 32 ms 13684 KB Output is correct
14 Correct 31 ms 13876 KB Output is correct
15 Correct 27 ms 13872 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 13172 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 21 ms 12516 KB Output is correct
4 Correct 29 ms 14460 KB Output is correct
5 Correct 31 ms 14456 KB Output is correct
6 Correct 25 ms 13352 KB Output is correct
7 Correct 24 ms 13196 KB Output is correct
8 Correct 27 ms 13952 KB Output is correct
9 Correct 30 ms 14204 KB Output is correct
10 Correct 27 ms 13664 KB Output is correct
11 Correct 29 ms 13676 KB Output is correct
12 Correct 32 ms 13676 KB Output is correct
13 Correct 32 ms 13684 KB Output is correct
14 Correct 31 ms 13876 KB Output is correct
15 Correct 27 ms 13872 KB Output is correct
16 Correct 19 ms 11632 KB Output is correct
17 Correct 20 ms 11840 KB Output is correct
18 Correct 23 ms 11808 KB Output is correct
19 Correct 26 ms 11844 KB Output is correct
20 Correct 28 ms 12696 KB Output is correct
21 Correct 28 ms 12356 KB Output is correct
22 Correct 31 ms 14404 KB Output is correct
23 Correct 22 ms 12092 KB Output is correct
24 Correct 22 ms 12104 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 11360 KB Output is correct
2 Correct 25 ms 11928 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 19 ms 11064 KB Output is correct
5 Correct 27 ms 12412 KB Output is correct
6 Correct 28 ms 12416 KB Output is correct
7 Correct 23 ms 11388 KB Output is correct
8 Correct 26 ms 11372 KB Output is correct
9 Correct 27 ms 12416 KB Output is correct
10 Correct 27 ms 12400 KB Output is correct
11 Correct 28 ms 12400 KB Output is correct
12 Correct 27 ms 12404 KB Output is correct
13 Correct 28 ms 12400 KB Output is correct
14 Correct 26 ms 12412 KB Output is correct
15 Correct 29 ms 12404 KB Output is correct
16 Correct 27 ms 12400 KB Output is correct
17 Correct 26 ms 12148 KB Output is correct
18 Correct 38 ms 12156 KB Output is correct
19 Correct 26 ms 12160 KB Output is correct
20 Correct 25 ms 12160 KB Output is correct
21 Correct 25 ms 12152 KB Output is correct
22 Correct 25 ms 12156 KB Output is correct
23 Correct 22 ms 11396 KB Output is correct
24 Correct 20 ms 11396 KB Output is correct
25 Correct 24 ms 11636 KB Output is correct
26 Correct 22 ms 11636 KB Output is correct
27 Correct 24 ms 12040 KB Output is correct
28 Correct 25 ms 12180 KB Output is correct
29 Correct 24 ms 12208 KB Output is correct
30 Correct 24 ms 12140 KB Output is correct
31 Correct 22 ms 11384 KB Output is correct
32 Correct 22 ms 11392 KB Output is correct
33 Correct 22 ms 11564 KB Output is correct
34 Correct 24 ms 11624 KB Output is correct
35 Correct 25 ms 11904 KB Output is correct
36 Correct 24 ms 12104 KB Output is correct
37 Correct 24 ms 12088 KB Output is correct
38 Correct 24 ms 11892 KB Output is correct
39 Correct 24 ms 11968 KB Output is correct
40 Correct 25 ms 11896 KB Output is correct
41 Correct 27 ms 12148 KB Output is correct
42 Correct 25 ms 12048 KB Output is correct
43 Correct 25 ms 12156 KB Output is correct
44 Correct 25 ms 12144 KB Output is correct
45 Correct 25 ms 12356 KB Output is correct
46 Correct 28 ms 12160 KB Output is correct
47 Correct 27 ms 11756 KB Output is correct
48 Correct 31 ms 11884 KB Output is correct
49 Correct 23 ms 11900 KB Output is correct
50 Correct 26 ms 11892 KB Output is correct
51 Correct 22 ms 11416 KB Output is correct
52 Correct 22 ms 11640 KB Output is correct
53 Correct 25 ms 11644 KB Output is correct
54 Correct 25 ms 11484 KB Output is correct
55 Correct 24 ms 11540 KB Output is correct
56 Correct 23 ms 11624 KB Output is correct
57 Correct 24 ms 11628 KB Output is correct
58 Correct 25 ms 11616 KB Output is correct
59 Correct 22 ms 11396 KB Output is correct
60 Correct 22 ms 11392 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 11384 KB Output is correct
2 Correct 24 ms 11896 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 19 ms 10972 KB Output is correct
5 Correct 30 ms 12392 KB Output is correct
6 Correct 27 ms 12408 KB Output is correct
7 Correct 23 ms 11452 KB Output is correct
8 Correct 22 ms 11384 KB Output is correct
9 Correct 27 ms 12464 KB Output is correct
10 Correct 28 ms 12420 KB Output is correct
11 Correct 26 ms 12416 KB Output is correct
12 Correct 27 ms 12416 KB Output is correct
13 Correct 27 ms 12372 KB Output is correct
14 Correct 30 ms 12376 KB Output is correct
15 Correct 28 ms 12400 KB Output is correct
16 Correct 26 ms 12352 KB Output is correct
17 Correct 25 ms 12164 KB Output is correct
18 Correct 30 ms 11968 KB Output is correct
19 Correct 29 ms 12108 KB Output is correct
20 Correct 30 ms 12140 KB Output is correct
21 Correct 29 ms 12020 KB Output is correct
22 Correct 25 ms 12160 KB Output is correct
23 Correct 22 ms 11396 KB Output is correct
24 Correct 20 ms 11384 KB Output is correct
25 Correct 25 ms 11644 KB Output is correct
26 Correct 23 ms 11516 KB Output is correct
27 Correct 28 ms 12068 KB Output is correct
28 Correct 25 ms 12112 KB Output is correct
29 Correct 25 ms 12160 KB Output is correct
30 Correct 24 ms 12144 KB Output is correct
31 Correct 20 ms 11376 KB Output is correct
32 Correct 24 ms 11392 KB Output is correct
33 Correct 23 ms 11644 KB Output is correct
34 Correct 22 ms 11624 KB Output is correct
35 Correct 28 ms 11896 KB Output is correct
36 Correct 27 ms 11860 KB Output is correct
37 Correct 27 ms 11888 KB Output is correct
38 Correct 27 ms 11876 KB Output is correct
39 Correct 25 ms 12000 KB Output is correct
40 Correct 28 ms 11896 KB Output is correct
41 Correct 27 ms 12020 KB Output is correct
42 Correct 28 ms 12196 KB Output is correct
43 Correct 28 ms 12328 KB Output is correct
44 Correct 26 ms 12408 KB Output is correct
45 Correct 29 ms 12400 KB Output is correct
46 Correct 31 ms 12280 KB Output is correct
47 Correct 26 ms 11904 KB Output is correct
48 Correct 26 ms 11892 KB Output is correct
49 Correct 23 ms 11896 KB Output is correct
50 Correct 27 ms 11900 KB Output is correct
51 Correct 26 ms 11644 KB Output is correct
52 Correct 25 ms 11636 KB Output is correct
53 Correct 22 ms 11648 KB Output is correct
54 Correct 22 ms 11632 KB Output is correct
55 Correct 26 ms 11624 KB Output is correct
56 Correct 23 ms 11644 KB Output is correct
57 Correct 23 ms 11452 KB Output is correct
58 Correct 26 ms 11576 KB Output is correct
59 Correct 25 ms 11392 KB Output is correct
60 Correct 23 ms 11388 KB Output is correct