oj.uz

Submission #1025461

# Submission time Handle Problem Language Result Execution time Memory
1025461 2024-07-17T04:10:50 Z shiomusubi496 Toy Train (IOI17_train) C++17
23 / 100
 809 ms 2068 KB 
#include "train.h"

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)

using namespace std;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

using ll = long long;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    vector<int> ids(a.size()); iota(all(ids), 0);
    vector<int> ans(a.size());
    while (true) {
        int n = a.size(), m = u.size();
        vector<vector<int>> g(n), rg(n);
        rep (i, m) {
            g[u[i]].push_back(v[i]);
            rg[v[i]].push_back(u[i]);
        }
        auto calc = [&](vector<int> r, bool f) -> vector<int> {
            queue<int> que;
            rep (i, n) {
                if (r[i]) que.push(i);
            }
            vector<int> deg(n);
            rep (i, n) deg[i] = g[i].size();
            while (!que.empty()) {
                int i = que.front(); que.pop();
                for (int j : rg[i]) {
                    if (r[j]) continue;
                    if (a[j] == f) {
                        r[j] = true;
                    }
                    else {
                        if ((--deg[j]) == 0) {
                            r[j] = true;
                        }
                    }
                    if (r[j]) que.push(j);
                }
            }
            return r;
        };
        auto r2 = calc(r, 1);
        if (count(all(r2), 1) == n) {
            rep (i, n) ans[ids[i]] = 1;
            break;
        }
        rep (i, n) r2[i] ^= 1;
        auto r3 = calc(r2, 0);
        vector<int> idx(n, -1);
        vector<int> ids2;
        int cnt = 0;
        rep (i, n) {
            if (!r3[i]) {
                idx[i] = cnt++;
                ids2.push_back(i);
            }
        }
        vector<int> a2(cnt), r4(cnt);
        rep (i, n) {
            if (idx[i] == -1) continue;
            a2[idx[i]] = a[i];
            r4[idx[i]] = r[i];
        }
        vector<int> u2, v2;
        rep (i, m) {
            if (idx[u[i]] == -1 || idx[v[i]] == -1) continue;
            u2.push_back(idx[u[i]]);
            v2.push_back(idx[v[i]]);
        }
        rep (i, n) {
            if (idx[i] == -1) ans[ids[i]] = 0;
        }

        a = a2;
        r = r4;
        u = u2;
        v = v2;
        ids = ids2;
    }
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1116 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 367 ms 2068 KB Output is correct
2 Correct 682 ms 2032 KB Output is correct
3 Correct 809 ms 1984 KB Output is correct
4 Correct 7 ms 1624 KB Output is correct
5 Incorrect 8 ms 1708 KB 3rd lines differ - on the 15th token, expected: '0', found: '1'
6 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1628 KB Output is correct
2 Correct 5 ms 1628 KB Output is correct
3 Correct 5 ms 1372 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 6 ms 1880 KB Output is correct
6 Correct 6 ms 1628 KB Output is correct
7 Correct 6 ms 1628 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 5 ms 1564 KB Output is correct
10 Correct 5 ms 1400 KB Output is correct
11 Correct 5 ms 1372 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 6 ms 1624 KB Output is correct
14 Correct 5 ms 1628 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1880 KB Output is correct
2 Correct 5 ms 1368 KB Output is correct
3 Correct 6 ms 1628 KB Output is correct
4 Correct 5 ms 1368 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 3 ms 1116 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1116 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -