제출 #67768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67768		aquablitz11	장난감 기차 (IOI17_train)	C++14	0 / 100	83 ms	1632 KiB

train

#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 if i could be in cycle or not
        vector<bool> cycle(n, false);
        int cntr = 0;
        for (auto v : G[i]) if (reach[v]) ++cntr;
        if ((A[i] && cntr > 0) || (!A[i] && cntr == G[i].size()))
            cycle[i] = true;
        // third step: find all nodes that could reach the cycle
        for (int i = 0; i < n; ++i)
            ans[i] = reach[i] ? 1 : 0;
        /*fill(cnt.begin(), cnt.end(), 0);
        if (cycle[i]) Q.push(i);
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            ans[u] = 1;
            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;
}

컴파일 시 표준 에러 (stderr) 메시지

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:40:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((A[i] && cntr > 0) || (!A[i] && cntr == G[i].size()))
                                             ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51