oj.uz

답안 #1089037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089037 2024-09-15T19:32:52 Z urd05 장난감 기차 (IOI17_train) C++17
100 / 100
 627 ms 1884 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> adj[5005];
vector<int> rev[5005];
int n,m;
int deg[5005];
bool vis[5005];
bool chk[5005];//true면 A편편
int dp[5005];
int aa[5005];
bool on[5005];

int ans(int v) {
    if (dp[v]!=-1) {
        return dp[v];
    }
    if (!vis[v]) {
        return dp[v]=chk[v];
    }
    if (aa[v]==0) {
        int ret=1;
        for(int nt:adj[v]) {
            if (ans(nt)==0) {
                ret=0;
                break;
            }
        }
        return dp[v]=ret;
    }
    if (aa[v]==1) {
        int ret=0;
        for(int nt:adj[v]) {
            if (ans(nt)==1) {
                ret=1;
                break;
            }
        }
        return dp[v]=ret;
    }
}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    n=a.size();
    m=u.size();
    for(int i=0;i<n;i++) {
        aa[i]=a[i];
    }
    for(int i=0;i<m;i++) {
        adj[u[i]].push_back(v[i]);
        rev[v[i]].push_back(u[i]);
        deg[v[i]]++;
    }
    queue<int> q;
    for(int i=0;i<n;i++) {
        if (deg[i]==0) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int now=q.front();
        q.pop();
        vis[now]=true;
        for(int nt:adj[now]) {
            deg[nt]--;
            if (deg[nt]==0) {
                q.push(nt);
            }
        }
    }
    int pr=0;
    for(int i=0;i<n;i++) {
        if (!vis[i]&&r[i]) {
            pr++;
        }
        chk[i]=true;
    }
    while (1) {
        for(int i=0;i<n;i++) {
            deg[i]=0;
            if (!vis[i]) {
                for(int nt:adj[i]) {
                    if (!vis[nt]) {
                        deg[i]++;
                    }
                }
            }
        }
        for(int i=0;i<n;i++) {
            if (!vis[i]&&r[i]&&chk[i]) {
                q.push(i);
                chk[i]=true;
            }
            else {
                chk[i]=false;
            }
        }
        while (!q.empty()) {
            int now=q.front();
            q.pop();
            for(int nt:rev[now]) {
                if (chk[nt]||vis[nt]) {
                    continue;
                }
                if (a[nt]==1) {
                    chk[nt]=true;
                    q.push(nt);
                }
                else {
                    deg[nt]--;
                    if (deg[nt]==0) {
                        chk[nt]=true;
                        q.push(nt);
                    }
                }
            }
        }
    	for(int i=0;i<n;i++) {
    	    if (!vis[i]&&!chk[i]) {
    	        q.push(i);
    	    }
    	}
        for(int i=0;i<n;i++) {
            deg[i]=0;
            if (!vis[i]) {
                for(int nt:adj[i]) {
                    if (!vis[nt]) {
                        deg[i]++;
                    }
                }
            }
        }
        while (!q.empty()) {
            int now=q.front();
            q.pop();
            for(int nt:rev[now]) {
                if (!chk[nt]||vis[nt]) {
                    continue;
                }
                if (a[nt]==0) {
                    chk[nt]=false;
                    q.push(nt);
                }
                else {
                    deg[nt]--;
                    if (deg[nt]==0) {
                        chk[nt]=false;
                        q.push(nt);
                    }
                }
            }
        }
        int cnt=0;
        for(int i=0;i<n;i++) {
            if (!vis[i]&&r[i]&&chk[i]) {
                cnt++;
            }
        }
        if (cnt==pr) {
            break;
        }
        pr=cnt;
    }
    vector<int> ret(n);
    memset(dp,-1,sizeof(dp));
    for(int i=0;i<n;i++) {
        ret[i]=ans(i);
    }
    return ret;
}

Compilation message

train.cpp: In function 'int ans(int)':
train.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 676 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1880 KB Output is correct
2 Correct 115 ms 1776 KB Output is correct
3 Correct 158 ms 1784 KB Output is correct
4 Correct 6 ms 1624 KB Output is correct
5 Correct 8 ms 1744 KB Output is correct
6 Correct 7 ms 1628 KB Output is correct
7 Correct 5 ms 1628 KB Output is correct
8 Correct 5 ms 1628 KB Output is correct
9 Correct 4 ms 1712 KB Output is correct
10 Correct 5 ms 1628 KB Output is correct
11 Correct 5 ms 1712 KB Output is correct
12 Correct 9 ms 1628 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 5 ms 1628 KB Output is correct
15 Correct 5 ms 1628 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 5 ms 1628 KB Output is correct
18 Correct 245 ms 1384 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1372 KB Output is correct
2 Correct 5 ms 1884 KB Output is correct
3 Correct 6 ms 1628 KB Output is correct
4 Correct 8 ms 1760 KB Output is correct
5 Correct 6 ms 1628 KB Output is correct
6 Correct 5 ms 1572 KB Output is correct
7 Correct 5 ms 1624 KB Output is correct
8 Correct 5 ms 1672 KB Output is correct
9 Correct 6 ms 1628 KB Output is correct
10 Correct 6 ms 1720 KB Output is correct
11 Correct 5 ms 1592 KB Output is correct
12 Correct 5 ms 1756 KB Output is correct
13 Correct 6 ms 1628 KB Output is correct
14 Correct 6 ms 1624 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 4 ms 1116 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 3 ms 1104 KB Output is correct
8 Correct 3 ms 1116 KB Output is correct
9 Correct 3 ms 1100 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 676 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 27 ms 1880 KB Output is correct
33 Correct 115 ms 1776 KB Output is correct
34 Correct 158 ms 1784 KB Output is correct
35 Correct 6 ms 1624 KB Output is correct
36 Correct 8 ms 1744 KB Output is correct
37 Correct 7 ms 1628 KB Output is correct
38 Correct 5 ms 1628 KB Output is correct
39 Correct 5 ms 1628 KB Output is correct
40 Correct 4 ms 1712 KB Output is correct
41 Correct 5 ms 1628 KB Output is correct
42 Correct 5 ms 1712 KB Output is correct
43 Correct 9 ms 1628 KB Output is correct
44 Correct 6 ms 1628 KB Output is correct
45 Correct 5 ms 1628 KB Output is correct
46 Correct 5 ms 1628 KB Output is correct
47 Correct 6 ms 1628 KB Output is correct
48 Correct 5 ms 1628 KB Output is correct
49 Correct 245 ms 1384 KB Output is correct
50 Correct 5 ms 1372 KB Output is correct
51 Correct 5 ms 1884 KB Output is correct
52 Correct 6 ms 1628 KB Output is correct
53 Correct 8 ms 1760 KB Output is correct
54 Correct 6 ms 1628 KB Output is correct
55 Correct 5 ms 1572 KB Output is correct
56 Correct 5 ms 1624 KB Output is correct
57 Correct 5 ms 1672 KB Output is correct
58 Correct 6 ms 1628 KB Output is correct
59 Correct 6 ms 1720 KB Output is correct
60 Correct 5 ms 1592 KB Output is correct
61 Correct 5 ms 1756 KB Output is correct
62 Correct 6 ms 1628 KB Output is correct
63 Correct 6 ms 1624 KB Output is correct
64 Correct 6 ms 1624 KB Output is correct
65 Correct 5 ms 1628 KB Output is correct
66 Correct 6 ms 1588 KB Output is correct
67 Correct 5 ms 1548 KB Output is correct
68 Correct 1 ms 600 KB Output is correct
69 Correct 3 ms 1200 KB Output is correct
70 Correct 3 ms 1208 KB Output is correct
71 Correct 4 ms 1368 KB Output is correct
72 Correct 3 ms 1372 KB Output is correct
73 Correct 1 ms 860 KB Output is correct
74 Correct 3 ms 1372 KB Output is correct
75 Correct 47 ms 1748 KB Output is correct
76 Correct 107 ms 1864 KB Output is correct
77 Correct 156 ms 1628 KB Output is correct
78 Correct 164 ms 1768 KB Output is correct
79 Correct 172 ms 1768 KB Output is correct
80 Correct 6 ms 1624 KB Output is correct
81 Correct 9 ms 1728 KB Output is correct
82 Correct 6 ms 1592 KB Output is correct
83 Correct 6 ms 1724 KB Output is correct
84 Correct 6 ms 1628 KB Output is correct
85 Correct 6 ms 1748 KB Output is correct
86 Correct 7 ms 1628 KB Output is correct
87 Correct 6 ms 1628 KB Output is correct
88 Correct 9 ms 1628 KB Output is correct
89 Correct 6 ms 1628 KB Output is correct
90 Correct 12 ms 1628 KB Output is correct
91 Correct 11 ms 1628 KB Output is correct
92 Correct 20 ms 1616 KB Output is correct
93 Correct 20 ms 1628 KB Output is correct
94 Correct 20 ms 1756 KB Output is correct
95 Correct 24 ms 1628 KB Output is correct
96 Correct 64 ms 1652 KB Output is correct
97 Correct 385 ms 1624 KB Output is correct
98 Correct 573 ms 1624 KB Output is correct
99 Correct 627 ms 1872 KB Output is correct
100 Correct 247 ms 1372 KB Output is correct