oj.uz

Submission #1025018

# Submission time Handle Problem Language Result Execution time Memory
1025018 2024-07-16T14:18:26 Z ASGA_RedSea Speedrun (RMI21_speedrun) C++17
0 / 100
 1 ms 776 KB 
/**

                                    * بسم الله الرحمن الرحيم *

                ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿

*/

/// author : "ASGA"

#include <bits/stdc++.h>

using namespace std;

#include "speedrun.h"

void assignHints(int sub, int n, int* A, int* B){
    setHintLen(n);
  
  	return;

    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++)setHint(i,j,0);
    }

    for(int i = 1;i < n;i++){
        int u = A[i];
        int v = B[i];

        setHint(u,v,1);
        setHint(v,u,1);
    }

    return;
}

namespace solve{
    int n;

    void calc(int i,int p){
        for(int j = 1;j <= n;j++){
            if(j != p && getHint(j)){
                goTo(j);
                calc(j,i);
                goTo(i);
            }
        }
    }
}

void speedrun(int sub,int N,int u){
    solve::n = N;

    //solve::calc(u,-1);
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 776 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -