oj.uz

답안 #287228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287228 2020-08-31T14:03:10 Z peti1234 장난감 기차 (IOI17_train) C++17
100 / 100
 447 ms 1920 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=5002;
int n, m, db[c], si[c];
bool v[c], ki[c], sol[c], uj=1;
vector<int> sz[c], inv[c], ans;
queue<int> q;
void solve() {
    while(q.size()>0) {
        int id=q.front();
        q.pop();
        if (!v[id]) {
            v[id]=1;
            for (int i=0; i<inv[id].size(); i++) {
                int x=inv[id][i];
                db[x]++;
                if (!v[x] && (db[x]==si[x] || (db[x]==1 && ki[x]))) q.push(x);
            }
        }
    }
}
vector<int> who_wins(vector<int> f, vector<int> t, vector<int> x, vector<int> y) {
    n=f.size(), m=x.size();
    for (int i=0; i<m; i++) {
        int a=x[i], b=y[i];
        sz[a].push_back(b), inv[b].push_back(a);
    }
    for (int i=0; i<n; i++) si[i]=sz[i].size(), ki[i]=f[i];
    while(uj) {
        uj=0;
        for (int i=0; i<n; i++) {
            v[i]=0, db[i]=0;
            if (t[i]) q.push(i);
        }
        solve();
        for (int i=0; i<n; i++) {
            if (t[i] && (db[i]==0 || db[i]!=si[i] && ki[i]==0)) t[i]=0, uj=1;
            //if (i==0) cout << "valt " << t[i] << "\n";
        }
    }

    for (int i=0; i<n; i++) {
        if (!v[i]) q.push(i);
        //if (!v[i]) cout << "ures " << i << endl;
        v[i]=0, ki[i]=1-ki[i], db[i]=0;
    }
    solve();
    for (int i=0; i<n; i++) ans.push_back(!v[i]);
    return ans;
}

Compilation message

train.cpp: In function 'void solve()':
train.cpp:15:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |             for (int i=0; i<inv[id].size(); i++) {
      |                           ~^~~~~~~~~~~~~~~
train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:38:51: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   38 |             if (t[i] && (db[i]==0 || db[i]!=si[i] && ki[i]==0)) t[i]=0, uj=1;
      |                                      ~~~~~~~~~~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 1784 KB Output is correct
2 Correct 169 ms 1784 KB Output is correct
3 Correct 239 ms 1712 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct
5 Correct 15 ms 1664 KB Output is correct
6 Correct 16 ms 1664 KB Output is correct
7 Correct 13 ms 1664 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 9 ms 1664 KB Output is correct
10 Correct 10 ms 1572 KB Output is correct
11 Correct 9 ms 1664 KB Output is correct
12 Correct 10 ms 1536 KB Output is correct
13 Correct 10 ms 1664 KB Output is correct
14 Correct 10 ms 1664 KB Output is correct
15 Correct 10 ms 1664 KB Output is correct
16 Correct 10 ms 1664 KB Output is correct
17 Correct 10 ms 1664 KB Output is correct
18 Correct 315 ms 1332 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1536 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 10 ms 1664 KB Output is correct
4 Correct 11 ms 1664 KB Output is correct
5 Correct 11 ms 1664 KB Output is correct
6 Correct 10 ms 1664 KB Output is correct
7 Correct 10 ms 1664 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 10 ms 1664 KB Output is correct
11 Correct 10 ms 1664 KB Output is correct
12 Correct 10 ms 1664 KB Output is correct
13 Correct 10 ms 1664 KB Output is correct
14 Correct 10 ms 1536 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1664 KB Output is correct
2 Correct 10 ms 1664 KB Output is correct
3 Correct 10 ms 1664 KB Output is correct
4 Correct 9 ms 1536 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 6 ms 1280 KB Output is correct
8 Correct 7 ms 1280 KB Output is correct
9 Correct 6 ms 1280 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1280 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 8 ms 1280 KB Output is correct
5 Correct 7 ms 1280 KB Output is correct
6 Correct 8 ms 1280 KB Output is correct
7 Correct 7 ms 1280 KB Output is correct
8 Correct 7 ms 1280 KB Output is correct
9 Correct 6 ms 1280 KB Output is correct
10 Correct 6 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 544 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 92 ms 1784 KB Output is correct
33 Correct 169 ms 1784 KB Output is correct
34 Correct 239 ms 1712 KB Output is correct
35 Correct 10 ms 1664 KB Output is correct
36 Correct 15 ms 1664 KB Output is correct
37 Correct 16 ms 1664 KB Output is correct
38 Correct 13 ms 1664 KB Output is correct
39 Correct 10 ms 1664 KB Output is correct
40 Correct 9 ms 1664 KB Output is correct
41 Correct 10 ms 1572 KB Output is correct
42 Correct 9 ms 1664 KB Output is correct
43 Correct 10 ms 1536 KB Output is correct
44 Correct 10 ms 1664 KB Output is correct
45 Correct 10 ms 1664 KB Output is correct
46 Correct 10 ms 1664 KB Output is correct
47 Correct 10 ms 1664 KB Output is correct
48 Correct 10 ms 1664 KB Output is correct
49 Correct 315 ms 1332 KB Output is correct
50 Correct 9 ms 1536 KB Output is correct
51 Correct 9 ms 1536 KB Output is correct
52 Correct 10 ms 1664 KB Output is correct
53 Correct 11 ms 1664 KB Output is correct
54 Correct 11 ms 1664 KB Output is correct
55 Correct 10 ms 1664 KB Output is correct
56 Correct 10 ms 1664 KB Output is correct
57 Correct 10 ms 1664 KB Output is correct
58 Correct 11 ms 1536 KB Output is correct
59 Correct 10 ms 1664 KB Output is correct
60 Correct 10 ms 1664 KB Output is correct
61 Correct 10 ms 1664 KB Output is correct
62 Correct 10 ms 1664 KB Output is correct
63 Correct 10 ms 1536 KB Output is correct
64 Correct 10 ms 1664 KB Output is correct
65 Correct 10 ms 1664 KB Output is correct
66 Correct 10 ms 1664 KB Output is correct
67 Correct 9 ms 1536 KB Output is correct
68 Correct 1 ms 640 KB Output is correct
69 Correct 5 ms 1152 KB Output is correct
70 Correct 6 ms 1280 KB Output is correct
71 Correct 7 ms 1280 KB Output is correct
72 Correct 6 ms 1280 KB Output is correct
73 Correct 2 ms 768 KB Output is correct
74 Correct 6 ms 1280 KB Output is correct
75 Correct 128 ms 1688 KB Output is correct
76 Correct 170 ms 1724 KB Output is correct
77 Correct 244 ms 1784 KB Output is correct
78 Correct 243 ms 1784 KB Output is correct
79 Correct 243 ms 1708 KB Output is correct
80 Correct 10 ms 1664 KB Output is correct
81 Correct 11 ms 1664 KB Output is correct
82 Correct 13 ms 1920 KB Output is correct
83 Correct 14 ms 1664 KB Output is correct
84 Correct 14 ms 1664 KB Output is correct
85 Correct 12 ms 1664 KB Output is correct
86 Correct 14 ms 1664 KB Output is correct
87 Correct 11 ms 1664 KB Output is correct
88 Correct 16 ms 1664 KB Output is correct
89 Correct 11 ms 1664 KB Output is correct
90 Correct 23 ms 1792 KB Output is correct
91 Correct 24 ms 1664 KB Output is correct
92 Correct 48 ms 1664 KB Output is correct
93 Correct 34 ms 1792 KB Output is correct
94 Correct 33 ms 1664 KB Output is correct
95 Correct 38 ms 1664 KB Output is correct
96 Correct 83 ms 1656 KB Output is correct
97 Correct 286 ms 1664 KB Output is correct
98 Correct 415 ms 1656 KB Output is correct
99 Correct 447 ms 1644 KB Output is correct
100 Correct 323 ms 1400 KB Output is correct