oj.uz

답안 #733682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733682 2023-05-01T08:00:09 Z t6twotwo 장난감 기차 (IOI17_train) C++17
5 / 100
 2000 ms 2132 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V) {
    int N = A.size();
    int M = U.size();
    vector<set<int>> adj(N);
    for (int i = 0; i < M; i++) {
        adj[U[i]].insert(V[i]);
    }
    vector<int> ans(N);
    for (int i = 0; i < N; i++) {
        vector<int> p;
        vector<bool> vis(N);
        auto dfs = [&](auto dfs, int x) -> int {
            p.push_back(x);
            vis[x] = 1;
            for (int y : adj[x]) {
                if (!vis[y]) {
                    if (dfs(dfs, y) == A[x]) {
                        return A[x];
                    }
                } else {
                    int cyc = 0;
                    for (int i = p.size() - 1; i >= 0; i--) {
                        cyc |= R[p[i]];
                        if (p[i] == y) {
                            break;
                        }
                    }
                    if (A[x] == cyc) {
                        return A[x];
                    }
                }
            }
            vis[x] = 0;
            p.pop_back();
            return !A[x];
        };
        ans[i] = dfs(dfs, i);
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1108 KB Output is correct
6 Correct 5 ms 1108 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 4 ms 1108 KB Output is correct
10 Correct 4 ms 1076 KB Output is correct
11 Correct 3 ms 952 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2059 ms 2108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 2004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2052 ms 2132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1108 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 5 ms 1108 KB Output is correct
6 Correct 5 ms 1108 KB Output is correct
7 Correct 5 ms 1108 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 4 ms 1108 KB Output is correct
10 Correct 4 ms 1076 KB Output is correct
11 Correct 3 ms 952 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 0 ms 300 KB 3rd lines differ - on the 4th token, expected: '0', found: '1'
16 Halted 0 ms 0 KB -