제출 #609202

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
609202		yanndev	Toy Train (IOI17_train)	C++17	39 / 100	144 ms	1192 KiB

train

#include <bits/stdc++.h>
using namespace std;
 
const int MX = 5042;
 
int n;
int deg[MX];
int baseDeg[MX];
int nxt[2 * MX];
bool vis[MX];
bool vis2[MX];
bool isOk[MX];
bool isAlice[MX];
bool isCharge[MX];
vector<int> rgraph[MX];
vector<int> nodes {};
 
bool BFS() {
    int start = 0;
    int end = 0;
 
    for (auto& i: nodes) {
        deg[i] = baseDeg[i];
        if (isCharge[i] && isOk[i])
            nxt[end++] = i;
        vis[i] = vis2[i] = false;
    }
 
    //cout << layer << ' ' << (int)nxt.size() << '\n';
    
    while (start < end) {
        auto cur = nxt[start++];
        //cout << "cur is " << cur << '\n';
 
        if (vis[cur])
            continue;
        vis[cur] = true;
 
        for (auto& x: rgraph[cur]) {
            if (!vis2[x] && ((--deg[x] == 0) || isAlice[x])) {
                vis2[x] = true;
                nxt[end++] = x;
            }
        }
    }
 
  	vector<int> newNodes {};
  	bool ret = false;
  
    for (auto& i: nodes) {
        if (isOk[i] && !vis2[i]) {
          	//vis[i] = true;
            isOk[i] = false;
            ret = true;
        } else {
          newNodes.push_back(i);
        }
    }
 	nodes = newNodes;
    return ret;
}
 
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = (int)a.size();
 
    for (int i = 0; i < (int)u.size(); i++) {
        rgraph[v[i]].push_back(u[i]);
        baseDeg[u[i]]++;
    }
    
    for (int i = 0; i < n; i++) {
        isAlice[i] = a[i];
        isCharge[i] = r[i];
        isOk[i] = true;
      	nodes.push_back(i);
    }
 
    while (BFS());
 
    vector<int> ans (n);
    for (int i = 0; i < n; i++)
        ans[i] = isOk[i];
    return ans;
}

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