oj.uz

답안 #1063518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063518 2024-08-17T19:49:39 Z Andrey 길고양이 (JOI20_stray) C++14
15 / 100
 36 ms 24972 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++;
        }
    }
    int p;
    if(br != 1) {
        usl = {d,d%2};   
    }
    else {
        for(int i = 0; i < 6; i++) {
            if((usl.first == -1 || bruhseq[(i+(d-usl.first))%6]%2 == usl.second)) {
                p = i;
                break;
            }
        }
    }
    for(pair<int,int> v: haha[a]) {
        if(v.first != t) {
            if(br == 1 && haha[v.first].size() <= 2) {
                if(bruhseq[p]%2 != d%2) {
                    dfs(v.first,a,d+2,usl);
                }
                else {
                    dfs(v.first,a,d+1,usl);
                }
            }
            else {
                dfs(v.first,a,d+1,usl);
            }
            x = dp[v.first];
        }
    }
    if(br == 1) {
        if(x == -1) {
            x = p-1;
        }
        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] == 2) {
                    wow.push_back(0);
                    wow.push_back(0);
                    return 0;
                }
                else if(haha[1] == 2) {
                    wow.push_back(1);
                    wow.push_back(1);
                    return 1;
                }
                else {
                    wow.push_back(1);
                    wow.push_back(0);
                    return 0;
                }
            }
            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() == 4) {
                    if(haha[0] > 0) {
                        wow.push_back(0);
                    }
                    else {
                        wow.push_back(1);
                    }
                    for(int i = 0; i < 6; i++) {
                        bool bubu = true;
                        for(int j = i; j < i+5; j++) {
                            if(wow[j-i] != seq[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

Anthony.cpp: In function 'void dfs(int, int, int, std::pair<int, int>)':
Anthony.cpp:32:29: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
   32 |                 if(bruhseq[p]%2 != d%2) {
      |                    ~~~~~~~~~^

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:139:29: warning: division by zero [-Wdiv-by-zero]
  139 |                     return 1/0;
      |                            ~^~
Catherine.cpp:152:1: warning: control reaches end of non-void function [-Wreturn-type]
  152 | }
      | ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 20592 KB Output is correct
2 Correct 1 ms 6172 KB Output is correct
3 Correct 24 ms 19960 KB Output is correct
4 Correct 34 ms 21716 KB Output is correct
5 Correct 36 ms 21632 KB Output is correct
6 Correct 28 ms 20340 KB Output is correct
7 Correct 28 ms 20416 KB Output is correct
8 Correct 33 ms 20972 KB Output is correct
9 Correct 28 ms 21136 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 20592 KB Output is correct
2 Correct 1 ms 6172 KB Output is correct
3 Correct 24 ms 19960 KB Output is correct
4 Correct 34 ms 21716 KB Output is correct
5 Correct 36 ms 21632 KB Output is correct
6 Correct 28 ms 20340 KB Output is correct
7 Correct 28 ms 20416 KB Output is correct
8 Correct 33 ms 20972 KB Output is correct
9 Correct 28 ms 21136 KB Output is correct
10 Correct 34 ms 18312 KB Output is correct
11 Correct 26 ms 18552 KB Output is correct
12 Correct 26 ms 18544 KB Output is correct
13 Correct 23 ms 18924 KB Output is correct
14 Correct 24 ms 18916 KB Output is correct
15 Correct 31 ms 19132 KB Output is correct
16 Correct 28 ms 21112 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 18048 KB Output is correct
2 Correct 1 ms 6184 KB Output is correct
3 Correct 20 ms 17788 KB Output is correct
4 Correct 30 ms 19592 KB Output is correct
5 Correct 29 ms 19592 KB Output is correct
6 Correct 24 ms 18076 KB Output is correct
7 Correct 26 ms 18168 KB Output is correct
8 Correct 27 ms 18976 KB Output is correct
9 Correct 30 ms 18820 KB Output is correct
10 Correct 26 ms 18560 KB Output is correct
11 Correct 26 ms 18576 KB Output is correct
12 Correct 26 ms 18512 KB Output is correct
13 Correct 30 ms 18580 KB Output is correct
14 Correct 28 ms 18812 KB Output is correct
15 Correct 27 ms 18808 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 18048 KB Output is correct
2 Correct 1 ms 6184 KB Output is correct
3 Correct 20 ms 17788 KB Output is correct
4 Correct 30 ms 19592 KB Output is correct
5 Correct 29 ms 19592 KB Output is correct
6 Correct 24 ms 18076 KB Output is correct
7 Correct 26 ms 18168 KB Output is correct
8 Correct 27 ms 18976 KB Output is correct
9 Correct 30 ms 18820 KB Output is correct
10 Correct 26 ms 18560 KB Output is correct
11 Correct 26 ms 18576 KB Output is correct
12 Correct 26 ms 18512 KB Output is correct
13 Correct 30 ms 18580 KB Output is correct
14 Correct 28 ms 18812 KB Output is correct
15 Correct 27 ms 18808 KB Output is correct
16 Correct 22 ms 16512 KB Output is correct
17 Correct 23 ms 16516 KB Output is correct
18 Correct 22 ms 16508 KB Output is correct
19 Correct 22 ms 16508 KB Output is correct
20 Correct 26 ms 17280 KB Output is correct
21 Correct 25 ms 17020 KB Output is correct
22 Correct 31 ms 19184 KB Output is correct
23 Correct 27 ms 16732 KB Output is correct
24 Correct 25 ms 16780 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6440 KB Output is correct
2 Incorrect 1 ms 6184 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 33 ms 24972 KB Execution killed with signal 4
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 24824 KB Execution killed with signal 4
2 Halted 0 ms 0 KB -