oj.uz

답안 #607542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
607542 2022-07-26T19:52:33 Z yanndev 장난감 기차 (IOI17_train) C++17
0 / 100
 1305 ms 1080 KB 
#include <bits/stdc++.h>
using namespace std;

const int MX = 5042;

int n;
int deg[MX];
bool vis[MX];
bool vis2[MX];
bool isOk[MX];
bool isAlice[MX];
bool isCharge[MX];
vector<int> rgraph[MX];

void BFS(int layer) {
    queue<int> nxt {};
    for (int i = 0; i < n; i++) {
        deg[i] = 0;
        if (isCharge[i] && isOk[i])
            nxt.push(i);
    }

    for (int i = 0; i < n; i++) {
        vis[i] = vis2[i] = false;
        for (auto& x: rgraph[i])
            deg[x]++;
    }

    //cout << layer << ' ' << (int)nxt.size() << '\n';
    
    while (!nxt.empty()) {
        auto cur = nxt.front();
        //cout << "cur is " << cur << '\n';
        nxt.pop();

        if (vis[cur])
            continue;
        
        vis[cur] = true;

        for (auto& x: rgraph[cur]) {
            if (!vis2[x] && (--deg[x] == 0 || isAlice[x])) {
                vis2[cur] = true;
                nxt.push(x);
            }
        }
    }

    for (int i = 0; i < n; i++)
        if (isOk[i] && !vis2[i])
            isOk[i] = false;
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = (int)a.size();

    for (int i = 0; i < (int)u.size(); i++)
        rgraph[v[i]].push_back(u[i]);
    
    for (int i = 0; i < n; i++) {
        isAlice[i] = a[i];
        isCharge[i] = r[i];
        isOk[i] = true;
    }

    for (int layer = 0; layer <= (int)r.size(); layer++)
        BFS(layer);

    vector<int> ans (n);
    for (int i = 0; i < n; i++)
        ans[i] = isOk[i];
    return ans;
}

/*int main() {
    for (auto& x: who_wins({0, 1}, {1, 0}, {0, 0, 1, 1}, {0, 1, 0, 1}))
        cout << x << ' ';
}*/

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 845 ms 724 KB 3rd lines differ - on the 2nd token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1042 ms 1080 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 782 ms 944 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1305 ms 1040 KB 3rd lines differ - on the 8th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 845 ms 724 KB 3rd lines differ - on the 2nd token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -