oj.uz

Submission #95257

# Submission time Handle Problem Language Result Execution time Memory
95257 2019-01-29T06:58:58 Z andy627 Toy Train (IOI17_train) C++17
100 / 100
 534 ms 1892 KB 
#include "train.h"
#include <bits/stdc++.h>
#define N 5005
using namespace std;
vector<int>g[N],rev[N];
bool f[N],iq[N],ans[N],ig[N];int goal[N],fc[N],a[N];
int n,m,k;
void getfunx(int t) // calculate function : t=1 then A, t=0 then B result : bool array f
{
    for(int i=0;i<n;i++)
        fc[i]=iq[i]=0;
    queue<int>que;
    for(int i=0;i<n;i++){
        if(!ig[i]&&f[i]){
            iq[i]=true;
            que.push(i);
        }
    }
    while(que.size()){
        int i=que.front();
        que.pop();
        f[i]=true;
        for(auto &it : rev[i]){
            if(ig[it])
                continue;
            fc[it]++;
            if(iq[it])
                continue;
            if(a[it]==t){
                iq[it]=true;
                que.push(it);
            }
            else if(fc[it]==goal[it]){
                iq[it]=true;
                que.push(it);
            }
        }
    }
}
vector<int> who_wins(vector<int> A,vector<int> r,vector<int> u,vector<int> v)
{
    n=A.size(),m=u.size(),k=r.size();
    for(int i=0;i<n;i++)
        a[i]=A[i];
	vector<int> res(n);
	for(int i=0;i<m;i++){
        g[u[i]].push_back(v[i]);
        goal[u[i]]++;
        rev[v[i]].push_back(u[i]);
    }
    while(1){
        for(int i=0;i<n;i++)
            if(!ig[i])
                f[i]=r[i];
        getfunx(1);
        bool isans=true;
        for(int i=0;i<n;i++){
            if(ig[i])
                continue;
            if(!f[i])
                isans=false;
            f[i]=!f[i];
        }
        if(isans){
            for(int i=0;i<n;i++)
                if(!ig[i])
                    ans[i]=true;
            break;
        }
        getfunx(0);
        for(int i=0;i<n;i++){
            if(!ig[i]&&f[i]){
                ig[i]=true;
                for(auto &it : rev[i])
                    goal[it]--;
            }
        }
    }
    for(int i=0;i<n;i++)
        res[i]=ans[i];
	return res;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:43:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i=0;i<n;i++)
     ^~~
train.cpp:45:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  vector<int> res(n);
  ^~~~~~
train.cpp:79:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i=0;i<n;i++)
     ^~~
train.cpp:81:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return res;
  ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1312 KB Output is correct
2 Correct 7 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 7 ms 1272 KB Output is correct
5 Correct 7 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 6 ms 1272 KB Output is correct
8 Correct 2 ms 1272 KB Output is correct
9 Correct 6 ms 1276 KB Output is correct
10 Correct 6 ms 1144 KB Output is correct
11 Correct 10 ms 1144 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 508 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 1768 KB Output is correct
2 Correct 222 ms 1760 KB Output is correct
3 Correct 278 ms 1748 KB Output is correct
4 Correct 10 ms 1656 KB Output is correct
5 Correct 10 ms 1656 KB Output is correct
6 Correct 11 ms 1656 KB Output is correct
7 Correct 10 ms 1656 KB Output is correct
8 Correct 10 ms 1656 KB Output is correct
9 Correct 9 ms 1656 KB Output is correct
10 Correct 9 ms 1656 KB Output is correct
11 Correct 9 ms 1656 KB Output is correct
12 Correct 9 ms 1528 KB Output is correct
13 Correct 10 ms 1656 KB Output is correct
14 Correct 10 ms 1656 KB Output is correct
15 Correct 10 ms 1656 KB Output is correct
16 Correct 10 ms 1664 KB Output is correct
17 Correct 10 ms 1656 KB Output is correct
18 Correct 423 ms 1480 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1528 KB Output is correct
2 Correct 9 ms 1528 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 11 ms 1656 KB Output is correct
5 Correct 11 ms 1656 KB Output is correct
6 Correct 11 ms 1656 KB Output is correct
7 Correct 10 ms 1656 KB Output is correct
8 Correct 9 ms 1656 KB Output is correct
9 Correct 9 ms 1656 KB Output is correct
10 Correct 10 ms 1660 KB Output is correct
11 Correct 10 ms 1784 KB Output is correct
12 Correct 10 ms 1784 KB Output is correct
13 Correct 10 ms 1656 KB Output is correct
14 Correct 10 ms 1656 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1656 KB Output is correct
2 Correct 10 ms 1656 KB Output is correct
3 Correct 11 ms 1656 KB Output is correct
4 Correct 9 ms 1528 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 7 ms 1272 KB Output is correct
8 Correct 7 ms 1400 KB Output is correct
9 Correct 7 ms 1272 KB Output is correct
10 Correct 3 ms 764 KB Output is correct
11 Correct 7 ms 1272 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1312 KB Output is correct
2 Correct 7 ms 1272 KB Output is correct
3 Correct 6 ms 1272 KB Output is correct
4 Correct 7 ms 1272 KB Output is correct
5 Correct 7 ms 1272 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 6 ms 1272 KB Output is correct
8 Correct 2 ms 1272 KB Output is correct
9 Correct 6 ms 1276 KB Output is correct
10 Correct 6 ms 1144 KB Output is correct
11 Correct 10 ms 1144 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 508 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 632 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 2 ms 632 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 632 KB Output is correct
25 Correct 2 ms 508 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 632 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 99 ms 1768 KB Output is correct
33 Correct 222 ms 1760 KB Output is correct
34 Correct 278 ms 1748 KB Output is correct
35 Correct 10 ms 1656 KB Output is correct
36 Correct 10 ms 1656 KB Output is correct
37 Correct 11 ms 1656 KB Output is correct
38 Correct 10 ms 1656 KB Output is correct
39 Correct 10 ms 1656 KB Output is correct
40 Correct 9 ms 1656 KB Output is correct
41 Correct 9 ms 1656 KB Output is correct
42 Correct 9 ms 1656 KB Output is correct
43 Correct 9 ms 1528 KB Output is correct
44 Correct 10 ms 1656 KB Output is correct
45 Correct 10 ms 1656 KB Output is correct
46 Correct 10 ms 1656 KB Output is correct
47 Correct 10 ms 1664 KB Output is correct
48 Correct 10 ms 1656 KB Output is correct
49 Correct 423 ms 1480 KB Output is correct
50 Correct 9 ms 1528 KB Output is correct
51 Correct 9 ms 1528 KB Output is correct
52 Correct 10 ms 1656 KB Output is correct
53 Correct 11 ms 1656 KB Output is correct
54 Correct 11 ms 1656 KB Output is correct
55 Correct 11 ms 1656 KB Output is correct
56 Correct 10 ms 1656 KB Output is correct
57 Correct 9 ms 1656 KB Output is correct
58 Correct 9 ms 1656 KB Output is correct
59 Correct 10 ms 1660 KB Output is correct
60 Correct 10 ms 1784 KB Output is correct
61 Correct 10 ms 1784 KB Output is correct
62 Correct 10 ms 1656 KB Output is correct
63 Correct 10 ms 1656 KB Output is correct
64 Correct 10 ms 1656 KB Output is correct
65 Correct 10 ms 1656 KB Output is correct
66 Correct 11 ms 1656 KB Output is correct
67 Correct 9 ms 1528 KB Output is correct
68 Correct 3 ms 632 KB Output is correct
69 Correct 6 ms 1272 KB Output is correct
70 Correct 7 ms 1272 KB Output is correct
71 Correct 7 ms 1400 KB Output is correct
72 Correct 7 ms 1272 KB Output is correct
73 Correct 3 ms 764 KB Output is correct
74 Correct 7 ms 1272 KB Output is correct
75 Correct 119 ms 1892 KB Output is correct
76 Correct 236 ms 1740 KB Output is correct
77 Correct 313 ms 1756 KB Output is correct
78 Correct 315 ms 1656 KB Output is correct
79 Correct 303 ms 1656 KB Output is correct
80 Correct 11 ms 1656 KB Output is correct
81 Correct 11 ms 1784 KB Output is correct
82 Correct 12 ms 1784 KB Output is correct
83 Correct 11 ms 1656 KB Output is correct
84 Correct 12 ms 1640 KB Output is correct
85 Correct 11 ms 1656 KB Output is correct
86 Correct 12 ms 1656 KB Output is correct
87 Correct 11 ms 1656 KB Output is correct
88 Correct 14 ms 1656 KB Output is correct
89 Correct 11 ms 1656 KB Output is correct
90 Correct 18 ms 1656 KB Output is correct
91 Correct 16 ms 1656 KB Output is correct
92 Correct 27 ms 1656 KB Output is correct
93 Correct 28 ms 1656 KB Output is correct
94 Correct 27 ms 1656 KB Output is correct
95 Correct 29 ms 1720 KB Output is correct
96 Correct 84 ms 1656 KB Output is correct
97 Correct 333 ms 1784 KB Output is correct
98 Correct 522 ms 1784 KB Output is correct
99 Correct 534 ms 1656 KB Output is correct
100 Correct 421 ms 1400 KB Output is correct