oj.uz

답안 #786619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786619 2023-07-18T10:22:40 Z JoenPoenMan 길고양이 (JOI20_stray) C++17
15 / 100
 61 ms 18788 KB 

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

typedef pair<int, int> ii;


std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V)
{
    vector<vector<ii>> ADJ(N);
    map<ii, int> paths;
    vector<bool> filled(M, false);
    for (int i = 0; i < M; i++) {
        ADJ[U[i]].push_back({V[i], i});
        ADJ[V[i]].push_back({U[i], i});
        paths[{U[i], V[i]}] = i;
        paths[{V[i], U[i]}] = i;
    }

    std::vector<int> X(M);
    priority_queue<ii, vector<ii>, greater<ii>> q;
    vector<int> prevNode(N, -1);
    vector<int> shortest(N, 1e8);
    shortest[0] = 0;
    q.push({0,0});
    while (!q.empty()) {
        auto [dis, pos] = q.top();
        q.pop();
        if (dis != shortest[pos]) continue;
        for (auto [conn, _] : ADJ[pos]) {
            if (dis+1 < shortest[conn]) {
                shortest[conn] = dis+1;
                prevNode[conn] = pos;
                q.push({dis+1, conn});
            }
        }
    }
    for (int p = 1; p < N; p++) {
        X[paths[{p, prevNode[p]}]] = shortest[p]%(A==2?2:3);
        filled[paths[{p, prevNode[p]}]] = true;
    }
    for (int i = 0; i < M; i++) if (!filled[i]) {
        X[i] = (min(shortest[U[i]], shortest[V[i]])+1)%(A==2?2:3);
    }
    return X;
    
}

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

namespace
{

    int A, B;
    int prevA = 0;
    bool onPath = false;
    bool first = true;

} // namespace

void Init(int A, int B)
{
    ::A = A;
    ::B = B;
}

int Move(std::vector<int> y)
{
    if (A==2) {
        if (!::onPath) {
            if (::first) {
                ::first = false;
                if (y[0]+y[1] != 2) {
                    ::prevA = (y[0] == 1 ? 0 : 1);
                    ::onPath = true;
                    return (y[0] == 1 ? 0 : 1);
                }
                ::prevA = 1;
                return 1;
            }
            if (y[0] + y[1] > 1) {
                if (y[0] == 1 || y[1] == 1) ::prevA = (y[0] == 1 ? 0 : 1);
                ::onPath = true;
                return (y[0] == 1 ? 0 : (y[1] == 1 ? 1 : -1));
            } else if (y[0] + y[1] == 0) {
                ::onPath = true;
                return -1;
            } else {
                ::prevA = !::prevA;
                return ::prevA;
            }
        } else {
            ::prevA = !::prevA;
            return ::prevA;
        }
    } else {
        first = false;
        int corr = -1;
        for (int p = 0 ; p < y.size(); p++) if (y[p] && (corr==-1 || (corr==0&&p==2))) corr = p;
        return corr;
    }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:54:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int p = 0 ; p < y.size(); p++) if (y[p] && (corr==-1 || (corr==0&&p==2))) corr = p;
      |                          ~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 17632 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 38 ms 17192 KB Output is correct
4 Correct 47 ms 18712 KB Output is correct
5 Correct 48 ms 18788 KB Output is correct
6 Correct 57 ms 17536 KB Output is correct
7 Correct 48 ms 17456 KB Output is correct
8 Correct 49 ms 18060 KB Output is correct
9 Correct 45 ms 18184 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 17632 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 38 ms 17192 KB Output is correct
4 Correct 47 ms 18712 KB Output is correct
5 Correct 48 ms 18788 KB Output is correct
6 Correct 57 ms 17536 KB Output is correct
7 Correct 48 ms 17456 KB Output is correct
8 Correct 49 ms 18060 KB Output is correct
9 Correct 45 ms 18184 KB Output is correct
10 Correct 42 ms 15540 KB Output is correct
11 Correct 41 ms 15584 KB Output is correct
12 Correct 46 ms 15416 KB Output is correct
13 Correct 41 ms 15444 KB Output is correct
14 Correct 46 ms 15820 KB Output is correct
15 Correct 43 ms 16092 KB Output is correct
16 Correct 44 ms 18300 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15340 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 37 ms 15088 KB Output is correct
4 Correct 61 ms 16512 KB Output is correct
5 Correct 59 ms 16516 KB Output is correct
6 Correct 46 ms 15248 KB Output is correct
7 Correct 41 ms 15200 KB Output is correct
8 Correct 49 ms 15760 KB Output is correct
9 Correct 51 ms 15848 KB Output is correct
10 Correct 50 ms 15560 KB Output is correct
11 Correct 43 ms 15592 KB Output is correct
12 Correct 46 ms 15576 KB Output is correct
13 Correct 45 ms 15576 KB Output is correct
14 Correct 46 ms 15956 KB Output is correct
15 Correct 44 ms 15932 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15340 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 37 ms 15088 KB Output is correct
4 Correct 61 ms 16512 KB Output is correct
5 Correct 59 ms 16516 KB Output is correct
6 Correct 46 ms 15248 KB Output is correct
7 Correct 41 ms 15200 KB Output is correct
8 Correct 49 ms 15760 KB Output is correct
9 Correct 51 ms 15848 KB Output is correct
10 Correct 50 ms 15560 KB Output is correct
11 Correct 43 ms 15592 KB Output is correct
12 Correct 46 ms 15576 KB Output is correct
13 Correct 45 ms 15576 KB Output is correct
14 Correct 46 ms 15956 KB Output is correct
15 Correct 44 ms 15932 KB Output is correct
16 Correct 39 ms 13780 KB Output is correct
17 Correct 37 ms 13892 KB Output is correct
18 Correct 39 ms 13544 KB Output is correct
19 Correct 40 ms 13664 KB Output is correct
20 Correct 40 ms 14224 KB Output is correct
21 Correct 43 ms 14040 KB Output is correct
22 Correct 44 ms 15924 KB Output is correct
23 Correct 42 ms 13604 KB Output is correct
24 Correct 40 ms 13756 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 904 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 2 ms 908 KB Output is correct
4 Correct 2 ms 864 KB Output is correct
5 Correct 2 ms 908 KB Output is correct
6 Correct 2 ms 900 KB Output is correct
7 Correct 2 ms 864 KB Output is correct
8 Correct 2 ms 1008 KB Output is correct
9 Correct 2 ms 868 KB Output is correct
10 Correct 2 ms 900 KB Output is correct
11 Correct 2 ms 908 KB Output is correct
12 Correct 2 ms 900 KB Output is correct
13 Correct 2 ms 908 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 908 KB Output is correct
16 Correct 2 ms 900 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Incorrect 2 ms 900 KB Wrong Answer [5]
19 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 13552 KB Output is correct
2 Correct 40 ms 13900 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 47 ms 13684 KB Output is correct
5 Correct 44 ms 15088 KB Output is correct
6 Correct 50 ms 15392 KB Output is correct
7 Correct 49 ms 14328 KB Output is correct
8 Incorrect 40 ms 14232 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -