oj.uz

답안 #1064045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064045 2024-08-18T08:43:07 Z TheQuantiX 장난감 기차 (IOI17_train) C++17
23 / 100
 294 ms 1860 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll INF = 1000000000000000000LL;

ll n, m, q, k, x, y, a, c;
vector<ll> G[5000];
vector<ll> Gr[5000];

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = a.size();
    m = u.size();
    vector<ll> cnt(n);
    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        G[i].clear();
        Gr[i].clear();
    }
    for (int i = 0; i < m; i++) {
        cnt[u[i]]++;
        G[v[i]].push_back(u[i]);
        Gr[u[i]].push_back(v[i]);
    }
    auto cnt1 = cnt;
    for (int i = 0; i < n; i++) {
        if (r[i]) {
            cnt = cnt1;
            queue<ll> q;
            vector<int> vis(n);
            q.push(i);
            while (!q.empty()) {
                ll x = q.front();
                q.pop();
                if (vis[x]) {
                    continue;
                }
                vis[x] = 1;
                for (auto j : G[x]) {
                    if (a[j] && !vis[j]) {
                        q.push(j);
                    }
                    if (!a[j]) {
                        cnt[j]--;
                        if (cnt[j] == 0 && !vis[j]) {
                            q.push(j);
                        }
                    }
                }
            }
            bool fl;
            if (a[i]) {
                fl = 0;
                for (int j : Gr[i]) {
                    if (vis[j]) {
                        fl = 1;
                        break;
                    }
                }
            }
            else {
                fl = 1;
                for (int j : Gr[i]) {
                    if (!vis[j]) {
                        fl = 0;
                        break;
                    }
                }
            }
            if (fl) {
                for (int j = 0; j < n; j++) {
                    ans[j] |= vis[j];
                }
            }
        }
    }
    return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1628 KB Output is correct
2 Correct 53 ms 1624 KB Output is correct
3 Correct 63 ms 1628 KB Output is correct
4 Correct 263 ms 1628 KB Output is correct
5 Correct 58 ms 1628 KB Output is correct
6 Correct 12 ms 1624 KB Output is correct
7 Correct 294 ms 1816 KB Output is correct
8 Correct 5 ms 1624 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 5 ms 1620 KB Output is correct
11 Correct 5 ms 1628 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 5 ms 1632 KB Output is correct
14 Correct 5 ms 1628 KB Output is correct
15 Correct 5 ms 1860 KB Output is correct
16 Correct 5 ms 1628 KB Output is correct
17 Correct 6 ms 1628 KB Output is correct
18 Correct 97 ms 1316 KB Output is correct

Subtask #4
0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1628 KB Output is correct
2 Correct 5 ms 1628 KB Output is correct
3 Correct 5 ms 1628 KB Output is correct
4 Correct 5 ms 1624 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 4 ms 1368 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct

Subtask #6
0 / 51.0

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