제출 #856771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
856771		iulia_morariu	Speedrun (RMI21_speedrun)	C++14	21 / 100	25 ms	1804 KiB

speedrun

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

using namespace std;
 
void assignHints (int subtask , int N, int A[], int B[]){
    vector <vector <int>> v[N + 1];
    setHintLen( N );
 
    for(int i = 1; i < N; i++){
        setHint( A[i], B[i], 1);
        setHint( B[i], A[i], 1);
    }
}
 
int vis[1001];
void dfs(int nd, int n){
    vis[nd] = 1;
    //cout << "Suntem la " << nd << endl;
    for(int i = 1; i <= n; i++){
        if( vis[i] || getHint(i) == 0 ) continue;
        //cout << "  -- > i = " << i << " getHint = " << getHint(i) << endl;
        goTo(i);
        vis[i] = 1;
        dfs(i, n);
        goTo(nd);
    }
}
 
void speedrun(int subtask , int N, int start ){
    for(int i = 0; i <= N; i++) vis[i] = 0;
    vis[start] = 1;
    stack<int> s;
    s.push(start);
 
    dfs(start, N);
}

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