답안 #1060379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060379	2024-08-15T13:31:15 Z	Zicrus	장난감 기차 (IOI17_train)	C++17	0 / 100	20 ms	4660 KB

train

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

typedef long long ll;

vector<unordered_set<ll>> adj, revAdj;
vector<bool> vst;
bool poss = false;
vector<int> a;

void dfs1(ll cur, ll root) {
    vst[cur] = true;
    for (auto &e : revAdj[cur]) {
        if (e == root) poss = true;
        if (vst[e]) continue;
        dfs1(e, root);
    }
}

void dfs2(ll cur, ll par, bool can) {
    vst[cur] = true;
    if (par == -1) {
        for (auto &e : revAdj[cur]) {
            if (vst[e]) continue;
            dfs2(e, cur, can);
        }
        return;
    }

    if (a[cur] != can) {
        if (adj[cur].size() > 1) {
            adj[cur].erase(par);
            for (auto &e : revAdj[cur]) {
                if (vst[e]) continue;
                dfs2(e, cur, !can);
            }
        }
        else {
            for (auto &e : revAdj[cur]) {
                if (vst[e]) continue;
                dfs2(e, cur, can);
            }
        }
    }
    else {
        adj[cur].clear();
        adj[cur].insert(par);
        for (auto &e : revAdj[cur]) {
            if (vst[e]) continue;
            dfs2(e, cur, can);
        }
    }
}

vector<int> who_wins(vector<int> a1, vector<int> r, vector<int> u, vector<int> v) {
    a = a1;
    ll n = a.size(), m = u.size();
	vector<int> res(n);
	adj = vector<unordered_set<ll>>(n);
	revAdj = vector<unordered_set<ll>>(n);
    for (int i = 0; i < m; i++) {
        adj[u[i]].insert(v[i]);
        revAdj[v[i]].insert(u[i]);
    }

    ll charge = 0;
    for (int i = 0; i < n; i++) {
        if (r[i]) {
            charge = i;


	adj = vector<unordered_set<ll>>(n);
	revAdj = vector<unordered_set<ll>>(n);
    for (int i = 0; i < m; i++) {
        adj[u[i]].insert(v[i]);
        revAdj[v[i]].insert(u[i]);
    }
            vst = vector<bool>(n);
            dfs2(charge, -1, true);
            revAdj = vector<unordered_set<ll>>(n);
            for (int i = 0; i < n; i++) {
                for (auto &e : adj[i]) {
                    revAdj[e].insert(i);
                }
            }
            vst = vector<bool>(n);
            poss = false;
            dfs1(charge, charge);
            vector<bool> vst2 = vst;
            if (poss) {
                for (int j = 0; j < n; j++) {
                    if (!vst2[j]) continue;
                    res[j] = true;
                }
            }

            break;
        }
    }

    

	return res;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 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	17 ms	4660 KB	Output is correct
2	Correct	14 ms	4656 KB	Output is correct
3	Correct	14 ms	4420 KB	Output is correct
4	Correct	20 ms	4144 KB	Output is correct
5	Correct	15 ms	4144 KB	Output is correct
6	Incorrect	16 ms	3932 KB	3rd lines differ - on the 47th token, expected: '1', found: '0'
7	Halted	0 ms	0 KB	-