oj.uz

답안 #644820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
644820 2022-09-25T09:48:12 Z PanTkd Speedrun (RMI21_speedrun) C++14
21 / 100
 45 ms 844 KB 
#include "speedrun.h"
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#ifdef px
    #define p(x) cerr<<#x<<' '<<x<<endl;
#else
    #define p(x) {}
#endif
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void assignHints(int subtask, int N, int A[], int B[]) { 
    setHintLen(N);
    for(ll i=1;i<N;i++){
        setHint(A[i],B[i],1);
        setHint(B[i],A[i],1);
    }

}
ll l;
void dfs(ll s,ll p=-1){
    for(ll i=1;i<=l;i++){
        if(i==p||i==s)continue;
        if(getHint(i)){
            goTo(i);
            dfs(i,s);
        }
    }
    goTo(p);
}
void speedrun(int subtask, int N, int start) { /* your solution here */
    l = getLength();
    dfs(start,start);
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 760 KB Output is correct
2 Correct 45 ms 792 KB Output is correct
3 Correct 36 ms 844 KB Output is correct
4 Correct 37 ms 796 KB Output is correct

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 336 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 336 KB The length is too large
2 Halted 0 ms 0 KB -