oj.uz

답안 #786616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786616 2023-07-18T10:11:15 Z JoenPoenMan 길고양이 (JOI20_stray) C++17
15 / 100
 57 ms 18736 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);
                }
                return 1;
            }
            if (y[0] + y[1] > 1) {
                ::prevA = (y[0] == 1 ? 0 : (y[1] == 1 ? 1 : ::prevA));
                ::onPath = true;
                return (y[0] == 1 ? 0 : (y[1] == 1 ? 1 : -1));
            } else if (!y[0] && !y[1]) {
                ::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 43 ms 17564 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 45 ms 17212 KB Output is correct
4 Correct 57 ms 18728 KB Output is correct
5 Correct 48 ms 18736 KB Output is correct
6 Correct 43 ms 17528 KB Output is correct
7 Correct 43 ms 17412 KB Output is correct
8 Correct 45 ms 18168 KB Output is correct
9 Correct 44 ms 18212 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 17564 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 45 ms 17212 KB Output is correct
4 Correct 57 ms 18728 KB Output is correct
5 Correct 48 ms 18736 KB Output is correct
6 Correct 43 ms 17528 KB Output is correct
7 Correct 43 ms 17412 KB Output is correct
8 Correct 45 ms 18168 KB Output is correct
9 Correct 44 ms 18212 KB Output is correct
10 Correct 41 ms 15632 KB Output is correct
11 Correct 43 ms 15516 KB Output is correct
12 Correct 41 ms 15520 KB Output is correct
13 Correct 39 ms 15456 KB Output is correct
14 Correct 42 ms 15716 KB Output is correct
15 Correct 47 ms 16148 KB Output is correct
16 Correct 46 ms 18316 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15188 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 37 ms 14976 KB Output is correct
4 Correct 53 ms 16392 KB Output is correct
5 Correct 46 ms 16564 KB Output is correct
6 Correct 41 ms 15312 KB Output is correct
7 Correct 42 ms 15340 KB Output is correct
8 Correct 46 ms 16088 KB Output is correct
9 Correct 48 ms 15708 KB Output is correct
10 Correct 57 ms 15512 KB Output is correct
11 Correct 44 ms 15632 KB Output is correct
12 Correct 43 ms 15608 KB Output is correct
13 Correct 44 ms 15708 KB Output is correct
14 Correct 44 ms 15968 KB Output is correct
15 Correct 45 ms 15984 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15188 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 37 ms 14976 KB Output is correct
4 Correct 53 ms 16392 KB Output is correct
5 Correct 46 ms 16564 KB Output is correct
6 Correct 41 ms 15312 KB Output is correct
7 Correct 42 ms 15340 KB Output is correct
8 Correct 46 ms 16088 KB Output is correct
9 Correct 48 ms 15708 KB Output is correct
10 Correct 57 ms 15512 KB Output is correct
11 Correct 44 ms 15632 KB Output is correct
12 Correct 43 ms 15608 KB Output is correct
13 Correct 44 ms 15708 KB Output is correct
14 Correct 44 ms 15968 KB Output is correct
15 Correct 45 ms 15984 KB Output is correct
16 Correct 38 ms 13800 KB Output is correct
17 Correct 43 ms 13784 KB Output is correct
18 Correct 39 ms 13664 KB Output is correct
19 Correct 39 ms 13460 KB Output is correct
20 Correct 40 ms 14208 KB Output is correct
21 Correct 40 ms 13920 KB Output is correct
22 Correct 43 ms 16160 KB Output is correct
23 Correct 40 ms 13612 KB Output is correct
24 Correct 43 ms 13724 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 904 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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