제출 #1135441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135441		sonamoo	장난감 기차 (IOI17_train)	C++20	5 / 100	2095 ms	836 KiB

train

#include "train.h"
#include <bits/stdc++.h>
#define SIZE 5555

using namespace std;

int n , cycle[SIZE] , nxt[SIZE];
vector<int> res;

vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    n = a.size();
    res.resize(n);
    for (int i = 0; i < n; i++) nxt[i]=-1;

    for (int i = 0; i < u.size(); i++) {
        if (u[i] == v[i]) cycle[u[i]]=1;
        else nxt[u[i]] = v[i];
    }

    //for (int i = 0; i < n; i++) printf("%d %d\n" , cycle[i] , nxt[i]);

    for (int s = 0; s < n; s++) {
        int here = s;
        while(1) {
            if (cycle[here] == 1 && nxt[here]==-1) {
                res[s] = r[here];
                break;
            }
            if (cycle[here]==0 && nxt[here]!=-1) {
                here = nxt[here];
                continue;
            }
            if (a[here]==0 && r[here]==0) {
                res[s] = 0;
                break;
            }
            if (a[here]==1 && r[here]==1) {
                res[s] = 1;
                break;
            }
            if (a[here]==0 && r[here]==1) {
                here = nxt[here];
                continue;
            }
            if (a[here]==1 && r[here]==0) {
                here = nxt[here];
                continue;
            }
        }
    }
    assert(res.size()==n);
    return res;
}

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