Submission #406818

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
406818	2021-05-18T05:36:50 Z	daniel920712	Toy Train (IOI17_train)	C++14	11 / 100	1000 ms	25616 KB

train

#include "train.h"
using namespace std;
vector < int > Next[5005],Next2[5005],ans,P,W;
bool have1[5005][5005];
bool can[5005];
bool have2[5005];
bool F(int st,int here,int deg)
{
    int ok=0,t;
    if(here==st&&deg) return 1;
    if(have1[st][here]) return can[here];
    have1[st][here]=1;
    for(auto i:Next[here])
    {
        t=F(st,i,deg+1);
        if(W[here]==t) ok=1;
    }
    if(ok) can[here]=W[here];
    else can[here]=1-W[here];
    return can[here];

}
void F2(int here)
{
    if(have2[here]) return;
    have2[here]=1;
    for(auto i:Next2[here]) F2(i);
}
vector < int > who_wins(vector < int > who, vector < int > power, vector < int > u, vector < int > v)
{
    P=power;
    W=who;
    int N=who.size(),M=u.size(),i;
	for(i=0;i<N;i++) ans.push_back(0);
	for(i=0;i<M;i++) Next[u[i]].push_back(v[i]);
	for(i=0;i<M;i++) Next2[v[i]].push_back(u[i]);
    for(i=0;i<N;i++) if(power[i]) F(i,i,0);
    for(i=0;i<N;i++) if(can[i]) F2(i);

    for(i=0;i<N;i++) ans[i]=have2[i];
	return ans;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	161 ms	15420 KB	3rd lines differ - on the 1st token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	460 KB	3rd lines differ - on the 8th token, expected: '0', found: '1'
2	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	5816 KB	Output is correct
2	Correct	41 ms	9672 KB	Output is correct
3	Correct	78 ms	13120 KB	Output is correct
4	Correct	387 ms	12032 KB	Output is correct
5	Correct	58 ms	4660 KB	Output is correct
6	Correct	103 ms	5444 KB	Output is correct
7	Correct	305 ms	18840 KB	Output is correct
8	Correct	8 ms	1612 KB	Output is correct
9	Correct	8 ms	1636 KB	Output is correct
10	Correct	11 ms	1740 KB	Output is correct
11	Correct	8 ms	1484 KB	Output is correct
12	Correct	8 ms	1484 KB	Output is correct
13	Correct	9 ms	1828 KB	Output is correct
14	Correct	9 ms	1868 KB	Output is correct
15	Correct	9 ms	1856 KB	Output is correct
16	Correct	9 ms	1816 KB	Output is correct
17	Correct	9 ms	1740 KB	Output is correct
18	Correct	235 ms	18824 KB	Output is correct