제출 #227685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
227685		AaronNaidu	Toy Train (IOI17_train)	C++14	15 / 100	2093 ms	1408 KiB

train

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

vector<int> a, r, f;
vector<int> graph[5000];
vector<bool> visited;

bool cycleTime(int node, int orig) {
    if (r[node])
    {
        return true;
    }
    if (node == orig)
    {
        return false;
    }
    return cycleTime(f[node], orig);
}

bool doesAWin(int x) {
    if (visited[x])
    {
        return cycleTime(f[x], x);
    }
    visited[x] = true;
    bool toRet;
    if (a[x])
    {
        toRet = false;
        for (auto i : graph[x])
        {
            f[x] = i;
            toRet = toRet or doesAWin(i);
            f[x] = -1;
        }
    }
    else
    {
        toRet = true;
        for (auto i : graph[x])
        {
            f[x] = i;
            toRet = toRet and doesAWin(i);
            f[x] = -1;
        }
    }
    visited[x] = false;
    return toRet;
}

vector<int> who_wins(vector<int> la, vector<int> lr, vector<int> lu, vector<int> lv) {
    a = la;
    r = lr;
    for (int i = 0; i < lu.size(); i++)
    {
        graph[lu[i]].push_back(lv[i]);
    }
    for (int i = 0; i < a.size(); i++)
    {
        f.push_back(-1);
        visited.push_back(false);
    }
    vector<int> toRet;
    for (int i = 0; i < a.size(); i++)
    {
        toRet.push_back(doesAWin(i));
    }
    return toRet;
}

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

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:54:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < lu.size(); i++)
                     ~~^~~~~~~~~~~
train.cpp:58:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); i++)
                     ~~^~~~~~~~~~
train.cpp:64:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); i++)
                     ~~^~~~~~~~~~

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