Submission #858868

#	Time	Username	Problem	Language	Result	Execution time	Memory
858868		teamariaa	Speedrun (RMI21_speedrun)	C++17	21 / 100	25 ms	1928 KiB

speedrun

#include <bits/stdc++.h>
#include "speedrun.h"

using namespace std;

#define MAX_N 1000

int n;
bitset <MAX_N + 1> viz;

void assign1(int a[], int b[])
{
    setHintLen(n);
    for(int i = 1; i < n; i ++)
    {
        setHint(a[i], b[i], 1);
        setHint(b[i], a[i], 1);
    }
}

void assign2and3()
{

}

void assign4()
{

}

void dfs(int node, int parent)
{
    viz[node] = 1;
    for(int i = 1; i <= n; i ++)
        if(getHint(i)  &&  !viz[i])
        {
            goTo(i);
            dfs(i, node);
        }
    goTo(parent);
}

void speedrun1(int root)
{
    dfs(root, root);
}

void assignHints(int subtask, int N, int A[], int B[])
{
    if(subtask == 1)
    {
        n = N;
        assign1(A, B);
    }
}

void speedrun(int subtask, int N, int start)
{
    if(subtask == 1)
    {
        n = N;
        speedrun1(start);
    }
}

• Subtask 1: 21 / 21
• Subtask 2: 0 / 8
• Subtask 3: 0 / 19
• Subtask 4: 0 / 12
• Subtask 5: 0 / 40