oj.uz

Submission #644825

# Submission time Handle Problem Language Result Execution time Memory
644825 2022-09-25T10:06:23 Z PanTkd Speedrun (RMI21_speedrun) C++14
0 / 100
 21 ms 756 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);
ll posa[1001]={};
ll arxi=1;
void assignHints(int subtask, int N, int A[], int B[]) { 
    setHintLen(20);
    for(ll i=1;i<N;i++){
        posa[A[i]]++;
        posa[B[i]]++;
        if(posa[A[i]]>=2){
            arxi=A[i];
            break;
        }else if(posa[B[i]]>=2){
            arxi=B[i];
            break;
        }
    }

}
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 */
    if(start==arxi){
        for(ll i=1;i<=N;i++){
            if(i==arxi)continue;
            goTo(i);
            goTo(arxi);
        }
    }else{
        goTo(arxi);
        for(ll i=1;i<=N;i++){
            if(i==arxi)continue;
            goTo(i);
            goTo(arxi);
        }
    }
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 724 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 21 ms 724 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

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

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 40.0

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