답안 #584073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584073	2022-06-26T18:49:41 Z	yanndev	장난감 기차 (IOI17_train)	C++17	0 / 100	6 ms	1056 KB

train

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

const int MX = 5042;
vector<int> graph[MX];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    int n, m;
    n = (int)a.size();
    m = (int)u.size();
    vector<int> ans (n);
    bool isChain = true;

    for (int i = 0; i < m; i++) {
        graph[u[i]].push_back(v[i]);
        if (!(u[i] == v[i] || v[i] == u[i] + 1))
            isChain = false;
    }
  
  	isChain = true;

    if (isChain) {
        bool isOk = false;

        for (int i = n - 1; i >= 0; i--) {
            bool hasSelf = false;
            for (auto& x: graph[i])
                if (x == i)
                    hasSelf = true;

            //cout << "pos " << i << '\n';

            if (hasSelf) {
                //cout << "has self\n";
                if (a[i]) {
                    //cout << "loop for hero " << r[i] << '\n';
                    if (r[i])
                        isOk = true;
                } else {
                    //cout << "loop for bad " << r[i] << '\n';
                    if (!r[i])
                        isOk = false;
                }
            }

            ans[i] = isOk;
        }

        return ans;
    }

    return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	980 KB	Output is correct
2	Correct	5 ms	1056 KB	Output is correct
3	Correct	5 ms	980 KB	Output is correct
4	Incorrect	5 ms	980 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-