oj.uz

답안 #67727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67727 2018-08-15T09:13:22 Z aquablitz11 장난감 기차 (IOI17_train) C++14
23 / 100
 940 ms 1820 KB 
#include <bits/stdc++.h>
#include "train.h"
using namespace std;

const int N = 5e3+10;
vector<int> G[N], R[N];

vector<int> who_wins(vector<int> A, vector<int> C, vector<int> U, vector<int> V)
{
    // input
    int n = A.size();
    int m = U.size();
    for (int i = 0; i < m; ++i) {
        G[U[i]].push_back(V[i]);
        R[V[i]].push_back(U[i]);
    }

    vector<int> ans(n, 0);
    for (int i = 0; i < n; ++i) if (C[i]) { // i = main recharger we need for cycle
        // first step: find all nodes that can be forced to reach i
        vector<bool> reach(n, false);
        vector<int> cnt(n, 0);
        queue<int> Q;
        Q.push(i);
        reach[i] = true;
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            for (auto p : R[u]) if (!reach[p]) {
                ++cnt[p];
                if ((A[p] && cnt[p] == 1) || (!A[p] && cnt[p] == G[p].size())) {
                    reach[p] = true;
                    Q.push(p);
                }
            }
        }
        // second step: find all nodes that are part of i-cycle
        vector<bool> cycle(n, false);
        fill(cnt.begin(), cnt.end(), 0); // use as vis array
        Q.push(i);
        cnt[i] = 1;
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            int cntr = 0;
            for (auto v : G[u]) if (reach[v]) ++cntr;
            if ((A[u] && cntr > 0) || (!A[u] && cntr == G[u].size())) {
                cycle[u] = true;
                for (auto v : G[u]) if (!cnt[v]) {
                    cnt[v] = 1;
                    Q.push(v);
                }
            }
        }
        // third step: find all nodes that could reach the cycle
        fill(cnt.begin(), cnt.end(), 0);
        for (int u = 0; u < n; ++u) if (cycle[u])
            Q.push(u);
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            ans[u] = true;
            for (auto p : R[u]) if (!cycle[p]) {
                ++cnt[p];
                if ((A[p] && cnt[p] == 1) || (!A[p] && cnt[p] == G[p].size())) {
                    cycle[p] = true;
                    Q.push(p);
                }
            }
        }
    }

    return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:30:63: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if ((A[p] && cnt[p] == 1) || (!A[p] && cnt[p] == G[p].size())) {
train.cpp:45:54: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if ((A[u] && cntr > 0) || (!A[u] && cntr == G[u].size())) {
                                                 ~~~~~^~~~~~~~~~~~~~
train.cpp:62:63: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if ((A[p] && cnt[p] == 1) || (!A[p] && cnt[p] == G[p].size())) {

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 1712 KB Output is correct
2 Correct 116 ms 1712 KB Output is correct
3 Correct 150 ms 1712 KB Output is correct
4 Correct 940 ms 1736 KB Output is correct
5 Correct 142 ms 1804 KB Output is correct
6 Correct 37 ms 1804 KB Output is correct
7 Correct 728 ms 1820 KB Output is correct
8 Correct 14 ms 1820 KB Output is correct
9 Correct 14 ms 1820 KB Output is correct
10 Correct 14 ms 1820 KB Output is correct
11 Correct 13 ms 1820 KB Output is correct
12 Correct 12 ms 1820 KB Output is correct
13 Correct 17 ms 1820 KB Output is correct
14 Correct 14 ms 1820 KB Output is correct
15 Correct 14 ms 1820 KB Output is correct
16 Correct 13 ms 1820 KB Output is correct
17 Correct 19 ms 1820 KB Output is correct
18 Correct 246 ms 1820 KB Output is correct

Subtask #4
0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1820 KB Output is correct
2 Correct 16 ms 1820 KB Output is correct
3 Correct 16 ms 1820 KB Output is correct
4 Correct 12 ms 1820 KB Output is correct
5 Correct 3 ms 1820 KB Output is correct
6 Correct 9 ms 1820 KB Output is correct
7 Correct 10 ms 1820 KB Output is correct
8 Correct 8 ms 1820 KB Output is correct
9 Correct 13 ms 1820 KB Output is correct
10 Correct 6 ms 1820 KB Output is correct
11 Correct 8 ms 1820 KB Output is correct

Subtask #6
0 / 51.0

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