oj.uz

Submission #1063491

# Submission time Handle Problem Language Result Execution time Memory
1063491 2024-08-17T19:25:45 Z Andrey Stray Cat (JOI20_stray) C++14
91 / 100
 37 ms 21732 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
using namespace std;

vector<pair<int,int>> haha[200001];
vector<int> dp(200001,-1);
vector<int> troll(0);
int bruhseq[6] = {0,1,0,0,1,1};

void dfs(int a, int t, int d, pair<int,int> usl) {
    int br = 0,x = -1;
    for(pair<int,int> v: haha[a]) {
        if(v.first != t) {
            br++;
        }
    }
    if(br != 1) {
        usl = {d,d%2};   
    }
    for(pair<int,int> v: haha[a]) {
        if(v.first != t) {
            dfs(v.first,a,d+1,usl);
            x = dp[v.first];
        }
    }
    if(br == 1) {
        if(x == -1) {
            for(int i = 0; i < 6; i++) {
                if(bruhseq[i] == d%2/* && (usl.first == -1 || bruhseq[(i+(usl.first-d))%6]%2 == usl.second)*/) {
                    x = i-1;
                    break;
                }
            }
        }
        x++;
        dp[a] = x;
        for(auto v: haha[a]) {
            if(v.first != t) {
                troll[v.second] = bruhseq[x%6];
            }
        }
    }
    else {
        for(pair<int,int> v: haha[a]) {
            if(v.first != t) {
                troll[v.second] = d%2;
            }
        }
    }
}

std::vector<int> Mark(int n, int m, int a, int b, std::vector<int> u, std::vector<int> v) {
    for(int i = 0; i < m; i++) {
        haha[u[i]].push_back({v[i],i});
        haha[v[i]].push_back({u[i],i});
    }
    if(a > 2) {
        vector<int> br(n,INT_MAX);
        br[0] = 0;
        queue<int> idk;
        idk.push(0);
        vector<int> ans(m,-1);
        while(!idk.empty()) {
            int u = idk.front();
            idk.pop();
            for(pair<int,int> v: haha[u]) {
                if(br[v.first] == INT_MAX) {
                    br[v.first] = br[u]+1;
                    idk.push(v.first);
                }
            }
        }
        for(int i = 0; i < m; i++) {
            if(ans[i] == -1) {
                int c = min(br[u[i]],br[v[i]])%3;
                ans[i] = c;
            }
        }
        return ans;
    }
    else {
        troll.resize(n-1);
        dfs(0,-1,1,{-1,-1});
        /*for(int i = 0; i < troll.size(); i++) {
            cout << troll[i] << " ";
        }
        cout << endl;*/
        return troll;
    }
}

#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std;

int A;
int seq[6] = {0,1,0,0,1,1};
vector<int> wow(0);
bool first = true;
bool yeah = true;

void Init(int a, int b) {
    A = a;
}

int Move(vector<int> haha) {
    if(A > 2) {
        vector<int> wow(0);
        for(int i = 0; i < haha.size(); i++) {
            if(haha[i] >= 1) {
                wow.push_back(i);
            }
        }
        if(wow.size() == 1) {
            return wow[0];
        }
        else if(wow.size() == 2) {
            if(wow[0] == 0 && wow[1] == 1) {
                return 0;
            }
            else if(wow[0] == 1 && wow[1] == 2) {
                return 1;
            }
            else {
                return 2;
            }
        }
    }
    else {
        if(first) {
            first = false;
            if(haha[0]+haha[1] == 2) {
                if(haha[0] > 0) {
                    wow.push_back(0);
                    return 0;
                }
                else {
                    wow.push_back(1);
                    return 1;
                }
            }
            else {
                yeah = false;
                if(haha[0] == 1) {
                    wow.push_back(0);
                    return 0;
                }
                else {
                    wow.push_back(1);
                    return 1;
                }
            }
        }
        else {
            if(yeah) {
                if(haha[0]+haha[1] == 0) {
                    yeah = false;
                    return -1;
                }
                else if(haha[0]+haha[1] > 1) {
                    yeah = false;
                    if(haha[0] == 0 || haha[1] == 0) {
                        return -1;
                    }
                    else {
                        if(wow[wow.size()-1] == 1) {
                            wow.push_back(0);
                            return 0;
                        }
                        else {
                            wow.push_back(1);
                            return 1;
                        }
                    }
                }
                else if(wow.size() == 6) {
                    for(int i = 0; i < 6; i++) {
                        bool bubu = true;
                        for(int j = i; j < i+6; j++) {
                            if(seq[j-i] != wow[j%6]) {
                                bubu = false;
                            }
                        }
                        if(bubu) {
                            yeah = false;
                            break;
                        }
                    }
                    if(yeah) {
                        yeah = false;
                        return -1;
                    }
                    else {
                        if(haha[0] > 0) {
                            wow.push_back(0);
                            return 0;
                        }
                        else {
                            wow.push_back(1);
                            return 1;
                        }
                    }
                }
                else {
                    if(haha[0] > 0) {
                        wow.push_back(0);
                        return 0;
                    }
                    else {
                        wow.push_back(1);
                        return 1;
                    }
                }
            }
            else {
                if(haha[0]+haha[1] == 0) {
                    return 1/0;
                }
                if(haha[1] > 0 && (haha[0] == 0 || wow[wow.size()-1] == 0)) {
                    wow.push_back(1);
                    return 1;
                }
                else {
                    wow.push_back(0);
                    return 0;
                }
            }
        }
    }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:18:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for(int i = 0; i < haha.size(); i++) {
      |                        ~~^~~~~~~~~~~~~
Catherine.cpp:126:29: warning: division by zero [-Wdiv-by-zero]
  126 |                     return 1/0;
      |                            ~^~
Catherine.cpp:139:1: warning: control reaches end of non-void function [-Wreturn-type]
  139 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 20524 KB Output is correct
2 Correct 2 ms 6184 KB Output is correct
3 Correct 23 ms 20112 KB Output is correct
4 Correct 32 ms 21636 KB Output is correct
5 Correct 32 ms 21732 KB Output is correct
6 Correct 25 ms 20372 KB Output is correct
7 Correct 27 ms 20368 KB Output is correct
8 Correct 31 ms 21108 KB Output is correct
9 Correct 30 ms 21040 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 20524 KB Output is correct
2 Correct 2 ms 6184 KB Output is correct
3 Correct 23 ms 20112 KB Output is correct
4 Correct 32 ms 21636 KB Output is correct
5 Correct 32 ms 21732 KB Output is correct
6 Correct 25 ms 20372 KB Output is correct
7 Correct 27 ms 20368 KB Output is correct
8 Correct 31 ms 21108 KB Output is correct
9 Correct 30 ms 21040 KB Output is correct
10 Correct 24 ms 18640 KB Output is correct
11 Correct 27 ms 18532 KB Output is correct
12 Correct 26 ms 18428 KB Output is correct
13 Correct 24 ms 18560 KB Output is correct
14 Correct 24 ms 18816 KB Output is correct
15 Correct 33 ms 19044 KB Output is correct
16 Correct 35 ms 21136 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 18128 KB Output is correct
2 Correct 2 ms 6184 KB Output is correct
3 Correct 22 ms 17812 KB Output is correct
4 Correct 31 ms 19516 KB Output is correct
5 Correct 30 ms 19612 KB Output is correct
6 Correct 28 ms 18064 KB Output is correct
7 Correct 26 ms 18172 KB Output is correct
8 Correct 28 ms 19024 KB Output is correct
9 Correct 28 ms 18820 KB Output is correct
10 Correct 34 ms 18612 KB Output is correct
11 Correct 35 ms 18568 KB Output is correct
12 Correct 26 ms 18568 KB Output is correct
13 Correct 36 ms 18496 KB Output is correct
14 Correct 32 ms 18836 KB Output is correct
15 Correct 31 ms 18788 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 18128 KB Output is correct
2 Correct 2 ms 6184 KB Output is correct
3 Correct 22 ms 17812 KB Output is correct
4 Correct 31 ms 19516 KB Output is correct
5 Correct 30 ms 19612 KB Output is correct
6 Correct 28 ms 18064 KB Output is correct
7 Correct 26 ms 18172 KB Output is correct
8 Correct 28 ms 19024 KB Output is correct
9 Correct 28 ms 18820 KB Output is correct
10 Correct 34 ms 18612 KB Output is correct
11 Correct 35 ms 18568 KB Output is correct
12 Correct 26 ms 18568 KB Output is correct
13 Correct 36 ms 18496 KB Output is correct
14 Correct 32 ms 18836 KB Output is correct
15 Correct 31 ms 18788 KB Output is correct
16 Correct 24 ms 16560 KB Output is correct
17 Correct 25 ms 16596 KB Output is correct
18 Correct 25 ms 16604 KB Output is correct
19 Correct 25 ms 16512 KB Output is correct
20 Correct 26 ms 17296 KB Output is correct
21 Correct 27 ms 17124 KB Output is correct
22 Correct 26 ms 19084 KB Output is correct
23 Correct 23 ms 16748 KB Output is correct
24 Correct 23 ms 16772 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6444 KB Output is correct
2 Correct 2 ms 6260 KB Output is correct
3 Correct 3 ms 6456 KB Output is correct
4 Correct 3 ms 6704 KB Output is correct
5 Correct 3 ms 6704 KB Output is correct
6 Correct 5 ms 6704 KB Output is correct
7 Correct 3 ms 6708 KB Output is correct
8 Correct 2 ms 6700 KB Output is correct
9 Correct 3 ms 6708 KB Output is correct
10 Correct 2 ms 6708 KB Output is correct
11 Correct 2 ms 6708 KB Output is correct
12 Correct 2 ms 6708 KB Output is correct
13 Correct 2 ms 6716 KB Output is correct
14 Correct 2 ms 6708 KB Output is correct
15 Correct 3 ms 6720 KB Output is correct
16 Correct 4 ms 6704 KB Output is correct
17 Correct 4 ms 6572 KB Output is correct
18 Correct 2 ms 6696 KB Output is correct
19 Correct 3 ms 6716 KB Output is correct
20 Correct 2 ms 6708 KB Output is correct
21 Correct 3 ms 6708 KB Output is correct
22 Correct 2 ms 6512 KB Output is correct
23 Correct 2 ms 6704 KB Output is correct
24 Correct 3 ms 6456 KB Output is correct
25 Correct 4 ms 6716 KB Output is correct
26 Correct 2 ms 6704 KB Output is correct
27 Correct 3 ms 6708 KB Output is correct
28 Correct 2 ms 6716 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 16616 KB Output is correct
2 Correct 26 ms 18284 KB Output is correct
3 Correct 2 ms 6180 KB Output is correct
4 Correct 20 ms 16436 KB Output is correct
5 Correct 37 ms 19808 KB Output is correct
6 Correct 32 ms 19816 KB Output is correct
7 Correct 25 ms 18776 KB Output is correct
8 Correct 27 ms 18796 KB Output is correct
9 Correct 33 ms 19820 KB Output is correct
10 Correct 32 ms 19804 KB Output is correct
11 Correct 30 ms 19980 KB Output is correct
12 Correct 33 ms 19788 KB Output is correct
13 Correct 33 ms 19724 KB Output is correct
14 Correct 28 ms 19808 KB Output is correct
15 Correct 30 ms 19820 KB Output is correct
16 Correct 37 ms 19820 KB Output is correct
17 Correct 30 ms 19500 KB Output is correct
18 Correct 28 ms 19448 KB Output is correct
19 Correct 29 ms 19448 KB Output is correct
20 Correct 28 ms 19552 KB Output is correct
21 Correct 28 ms 19396 KB Output is correct
22 Correct 28 ms 19556 KB Output is correct
23 Correct 24 ms 16744 KB Output is correct
24 Correct 23 ms 16736 KB Output is correct
25 Correct 31 ms 17516 KB Output is correct
26 Correct 25 ms 17488 KB Output is correct
27 Correct 28 ms 18452 KB Output is correct
28 Correct 26 ms 18472 KB Output is correct
29 Correct 27 ms 18348 KB Output is correct
30 Correct 31 ms 18544 KB Output is correct
31 Correct 27 ms 16812 KB Output is correct
32 Correct 24 ms 16720 KB Output is correct
33 Correct 24 ms 17476 KB Output is correct
34 Correct 24 ms 17520 KB Output is correct
35 Correct 26 ms 18044 KB Output is correct
36 Correct 32 ms 18264 KB Output is correct
37 Correct 26 ms 18284 KB Output is correct
38 Correct 31 ms 18252 KB Output is correct
39 Correct 28 ms 18032 KB Output is correct
40 Correct 27 ms 18496 KB Output is correct
41 Correct 27 ms 19016 KB Output is correct
42 Correct 32 ms 19008 KB Output is correct
43 Correct 28 ms 18780 KB Output is correct
44 Correct 28 ms 18920 KB Output is correct
45 Correct 27 ms 19040 KB Output is correct
46 Correct 28 ms 18908 KB Output is correct
47 Correct 30 ms 17852 KB Output is correct
48 Correct 25 ms 18024 KB Output is correct
49 Correct 25 ms 18020 KB Output is correct
50 Correct 27 ms 18016 KB Output is correct
51 Correct 23 ms 17084 KB Output is correct
52 Correct 24 ms 17000 KB Output is correct
53 Correct 24 ms 17040 KB Output is correct
54 Correct 27 ms 16984 KB Output is correct
55 Correct 23 ms 17000 KB Output is correct
56 Correct 27 ms 17000 KB Output is correct
57 Correct 25 ms 17248 KB Output is correct
58 Correct 28 ms 17144 KB Output is correct
59 Correct 25 ms 16984 KB Output is correct
60 Correct 24 ms 16988 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16520 KB Output is correct
2 Correct 28 ms 18348 KB Output is correct
3 Correct 3 ms 6200 KB Output is correct
4 Correct 23 ms 16448 KB Output is correct
5 Correct 28 ms 19816 KB Output is correct
6 Correct 30 ms 19812 KB Output is correct
7 Incorrect 27 ms 18784 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -