oj.uz

답안 #860870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860870 2023-10-14T16:43:33 Z vjudge1 Speedrun (RMI21_speedrun) C++17
21 / 100
 25 ms 1776 KB 
#include <bits/stdc++.h>
#include "speedrun.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

vector<bool> vis(1002);
int n, hintSize;

void dfs(int u, int p) {
    vis[u] = 1;

    for(int i=1; i<=n; i++) {
        if(vis[i]) continue;
        if(!getHint(i)) continue;
        goTo(i);
        dfs(i, u);
    }

    if(p) goTo(p);
}

void assignHints(int subtask, int N, int A[], int B[]) {
    setHintLen(N);

    for(int i=1; i<N; i++){
        setHint(A[i], B[i], 1);
        setHint(B[i], A[i], 1);
    }
}

void speedrun(int subtask, int N, int start) {
    n = N;
    hintSize = getLength();
    dfs(start, 0);
}

// int32_t main() {
//     setIO();

//     //code starts here

//     return 0;
// }

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 1604 KB Output is correct
2 Correct 20 ms 1776 KB Output is correct
3 Correct 25 ms 1284 KB Output is correct
4 Correct 21 ms 1612 KB Output is correct

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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 340 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 -