oj.uz

답안 #1054784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054784 2024-08-12T12:08:09 Z Wansur 장난감 기차 (IOI17_train) C++17
12 / 100
 27 ms 1580 KB 
#include <bits/stdc++.h>
#include "train.h"
#define ent '\n'
#define  f first
#define s second
//#define int long long

using namespace std;
typedef long long ll;
const int maxn = 5e3 + 12;
const int mod = 1e9 + 7;

vector<int> g[maxn], rg[maxn];
int in[maxn], out[maxn];
bool won[maxn];
int n, m;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){
    n = a.size(), m = U.size();
    vector<int> ans(n);

    for(int i=0;i<m;i++){
        g[U[i]].push_back(V[i]);
        rg[V[i]].push_back(U[i]);
    }

    for(int v=0;v<n;v++){
        if(r[v] == 0){
            continue;
        }
        won[v] = 1;
        for(int i=0;i<n;i++){
            out[i] = g[i].size();
        }

        queue<int> q;
        q.push(v);
        while(q.size()){
            int v = q.front();
            q.pop();
            for(int to:rg[v]){
                if(a[to] && !won[to]){
                    won[to] = 1;
                    q.push(to);
                }
                if(!a[to]){
                    out[to]--;
                    if(out[to] == 0){
                        won[to] = 1;
                        q.push(to);
                    }
                }
            }
        }

        bool ok = 0;

        for(int to:g[v]){
            if(won[to]){
                ok = 1;
            }
        }
        if(ok){
            for(int i=0;i<n;i++){
                if(won[i]){
                    ans[i] = 1;
                }
            }
        }
    }
    return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1532 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 5 ms 1540 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 4 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 860 KB Output is correct
11 Correct 3 ms 1008 KB Output is correct

Subtask #6
0 / 51.0

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