oj.uz

Submission #406829

# Submission time Handle Problem Language Result Execution time Memory
406829 2021-05-18T05:47:19 Z daniel920712 Toy Train (IOI17_train) C++14
0 / 100
 1196 ms 25564 KB 
#include "train.h"
#include <stdio.h>

using namespace std;
vector < int > Next[5005],Next2[5005],ans,P,W;
bool have1[5005][5005];
bool can[5005];
bool have2[5][5005];
bool vis[5005];
bool F(int st,int here,int deg)
{

    int ok=0,t;
    //printf("%d %d %d\n",st,here,deg);
    vis[here]=1;
    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,int xx)
{
    if(have2[xx][here]) return;
    have2[xx][here]=1;
    for(auto i:Next2[here]) F2(i,xx);
}
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(vis[i]) F2(i,can[i]);

    for(i=0;i<N;i++)
    {
        if(vis[i]) ans[i]=can[i];
        else if(have2[0][i]&&have2[1][i]) ans[i]=who[i];
        else if(have2[0][i]) ans[i]=0;
        else ans[i]=1;
    }
	return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 15672 KB 3rd lines differ - on the 14th token, expected: '1', found: '0'
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 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 5836 KB Output is correct
2 Correct 43 ms 9840 KB Output is correct
3 Correct 88 ms 13356 KB Output is correct
4 Correct 432 ms 12360 KB Output is correct
5 Correct 66 ms 4708 KB Output is correct
6 Incorrect 119 ms 5496 KB 3rd lines differ - on the 87th token, expected: '1', found: '0'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

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