oj.uz

Submission #699820

# Submission time Handle Problem Language Result Execution time Memory
699820 2023-02-18T05:00:10 Z Nursik Speedrun (RMI21_speedrun) C++14
0 / 100
 1 ms 336 KB 
#include "speedrun.h"
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>

using namespace std;
int n;
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
    setHintLen(N);
    for (int i = 1; i < N; ++i){
        int x = A[i], y = B[i];
        setHint(x, y - 1, 1);
        setHint(y, x - 1, 1);
     //   cout << x << " " << y << '\n';
    }
}
void dfs(int v, int p){
   // cout << v << " " << 
    for (int j = 1; j <= n; ++j){
        if (j != p && getHint(j - 1)){
            goTo(j);
            dfs(j, v);
        }
    }
    if (p){
        goTo(p);
    }
}
void speedrun(int subtask, int N, int start) { /* your solution here */
    n = N;
    dfs(start, 0);
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Invalid bit index for setHint
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 336 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 336 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 336 KB The length is too large
2 Halted 0 ms 0 KB -