oj.uz

답안 #991714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991714 2024-06-02T21:23:15 Z De3b0o Speedrun (RMI21_speedrun) C++17
0 / 100
 6 ms 768 KB 
#include "speedrun.h"
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)

using namespace std;

vector<ll> adj[1009];
bool vis[1009];
vector<ll> et;

void assignHints(int subtask, int N, int A[], int B[])
{
    setHintLen(N);
    for(int i = 1 ; N>i ; i++)
    {
        setHint(A[i],B[i],1);
        setHint(B[i],A[i],1);
    }
    return;
}

void speedrun(int subtask, int N, int start)
{
    ll n = N;
    vis[start]=1;
    for(int j = 1 ; n>=j ; j++)
    {
        if(vis[j]==0&&getHint(j))
            goTo(j);
    }
}

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 768 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 19.0

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

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

Subtask #5
0.0 / 40.0

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