Submission #797707

#	Time	Username	Problem	Language	Result	Execution time	Memory
797707		PixelCat	Toy Train (IOI17_train)	C++14	5 / 100	6 ms	1688 KiB

train

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include "train.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 5000;

vector<int> adj[MAXN + 10];
vector<int> rev[MAXN + 10];
int t0[MAXN + 10];
int t1[MAXN + 10];
int tag[MAXN + 10];

void walk(int s, vector<int> ad[], int tg) {
    queue<int> que;
    que.emplace(s);
    tag[s] |= tg;
    while(!que.empty()) {
        int cur = que.front(); que.pop();
        for(auto &i:ad[cur]) if((tag[i] & tg) == 0) {
            tag[i] |= tg;
            que.emplace(i);
        }
    }
}

vector<i32> who_wins(vector<i32> a, vector<i32> r, vector<i32> u, vector<i32> v) {
    int n = sz(a);
    int m = sz(u);

    For(i, 0, m - 1) {
        adj[u[i]].eb(v[i]);
        rev[v[i]].eb(u[i]);
        if(u[i] == v[i]) t0[u[i]] = 1;
        else t1[u[i]] = 1;
    }
    memset(tag, 0, sizeof(tag));

    vector<i32> owo(n);
    Forr(i, n - 1, 0) {
        if(a[i]) {
            if(r[i] && t0[i]) owo[i] = 1;
            else if(!t1[i]) owo[i] = 0;
            else owo[i] = owo[i + 1];
        } else {
            if(!r[i] && t0[i]) owo[i] = 0;
            else if(!t1[i]) owo[i] = 1;
            else owo[i] = owo[i + 1];
        }
    }
    return owo;
}

/*

2 4
0 1
1 0
0 0
0 1
1 0
1 1

1 1

*/

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